/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/safe024_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 14:57:25,604 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 14:57:25,607 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 14:57:25,619 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 14:57:25,619 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 14:57:25,620 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 14:57:25,622 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 14:57:25,624 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 14:57:25,625 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 14:57:25,626 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 14:57:25,627 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 14:57:25,628 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 14:57:25,629 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 14:57:25,630 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 14:57:25,631 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 14:57:25,632 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 14:57:25,633 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 14:57:25,634 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 14:57:25,635 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 14:57:25,637 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 14:57:25,639 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 14:57:25,640 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 14:57:25,645 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 14:57:25,646 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 14:57:25,650 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 14:57:25,650 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 14:57:25,650 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 14:57:25,651 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 14:57:25,652 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 14:57:25,653 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 14:57:25,654 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 14:57:25,655 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 14:57:25,657 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 14:57:25,658 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 14:57:25,661 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 14:57:25,661 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 14:57:25,662 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 14:57:25,663 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 14:57:25,663 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 14:57:25,665 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 14:57:25,666 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 14:57:25,669 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-18 14:57:25,694 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 14:57:25,694 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 14:57:25,696 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 14:57:25,696 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 14:57:25,697 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 14:57:25,697 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 14:57:25,697 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 14:57:25,697 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 14:57:25,697 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 14:57:25,698 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 14:57:25,699 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 14:57:25,699 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 14:57:25,699 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 14:57:25,700 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 14:57:25,700 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 14:57:25,700 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 14:57:25,700 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 14:57:25,700 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 14:57:25,701 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 14:57:25,701 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 14:57:25,701 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 14:57:25,701 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 14:57:25,702 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 14:57:25,702 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 14:57:25,702 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 14:57:25,702 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 14:57:25,703 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 14:57:25,703 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 14:57:25,703 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-18 14:57:25,703 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 14:57:25,994 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 14:57:26,006 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 14:57:26,009 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 14:57:26,011 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 14:57:26,011 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 14:57:26,012 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe024_pso.opt.i [2019-12-18 14:57:26,075 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/874da452b/15ce4fb08025487f9a7eebb9889b421b/FLAG41dca0e86 [2019-12-18 14:57:26,640 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 14:57:26,641 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe024_pso.opt.i [2019-12-18 14:57:26,677 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/874da452b/15ce4fb08025487f9a7eebb9889b421b/FLAG41dca0e86 [2019-12-18 14:57:26,931 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/874da452b/15ce4fb08025487f9a7eebb9889b421b [2019-12-18 14:57:26,939 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 14:57:26,941 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 14:57:26,942 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 14:57:26,942 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 14:57:26,946 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 14:57:26,947 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 02:57:26" (1/1) ... [2019-12-18 14:57:26,950 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75cc43a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:57:26, skipping insertion in model container [2019-12-18 14:57:26,950 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 02:57:26" (1/1) ... [2019-12-18 14:57:26,958 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 14:57:27,020 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 14:57:27,579 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 14:57:27,597 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 14:57:27,679 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 14:57:27,752 INFO L208 MainTranslator]: Completed translation [2019-12-18 14:57:27,752 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:57:27 WrapperNode [2019-12-18 14:57:27,752 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 14:57:27,753 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 14:57:27,753 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 14:57:27,753 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 14:57:27,762 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:57:27" (1/1) ... [2019-12-18 14:57:27,782 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:57:27" (1/1) ... [2019-12-18 14:57:27,814 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 14:57:27,814 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 14:57:27,814 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 14:57:27,814 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 14:57:27,824 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:57:27" (1/1) ... [2019-12-18 14:57:27,825 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:57:27" (1/1) ... [2019-12-18 14:57:27,830 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:57:27" (1/1) ... [2019-12-18 14:57:27,830 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:57:27" (1/1) ... [2019-12-18 14:57:27,846 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:57:27" (1/1) ... [2019-12-18 14:57:27,856 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:57:27" (1/1) ... [2019-12-18 14:57:27,861 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:57:27" (1/1) ... [2019-12-18 14:57:27,866 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 14:57:27,869 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 14:57:27,869 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 14:57:27,869 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 14:57:27,870 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:57:27" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 14:57:27,928 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 14:57:27,928 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 14:57:27,928 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 14:57:27,928 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 14:57:27,929 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 14:57:27,929 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 14:57:27,929 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 14:57:27,929 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 14:57:27,929 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 14:57:27,930 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 14:57:27,930 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 14:57:27,930 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 14:57:27,930 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 14:57:27,932 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 14:57:28,702 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 14:57:28,703 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 14:57:28,704 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 02:57:28 BoogieIcfgContainer [2019-12-18 14:57:28,704 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 14:57:28,706 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 14:57:28,707 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 14:57:28,711 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 14:57:28,712 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 02:57:26" (1/3) ... [2019-12-18 14:57:28,715 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45d7185 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 02:57:28, skipping insertion in model container [2019-12-18 14:57:28,715 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:57:27" (2/3) ... [2019-12-18 14:57:28,716 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45d7185 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 02:57:28, skipping insertion in model container [2019-12-18 14:57:28,716 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 02:57:28" (3/3) ... [2019-12-18 14:57:28,719 INFO L109 eAbstractionObserver]: Analyzing ICFG safe024_pso.opt.i [2019-12-18 14:57:28,727 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 14:57:28,727 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 14:57:28,735 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 14:57:28,736 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 14:57:28,775 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:57:28,775 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:57:28,775 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:57:28,776 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:57:28,776 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:57:28,776 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:57:28,776 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:57:28,777 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:57:28,777 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:57:28,778 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:57:28,778 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:57:28,778 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:57:28,778 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:57:28,779 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:57:28,779 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:57:28,779 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:57:28,780 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:57:28,780 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:57:28,780 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:57:28,780 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:57:28,781 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:57:28,781 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:57:28,781 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:57:28,782 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:57:28,782 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:57:28,782 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:57:28,783 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:57:28,783 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:57:28,783 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:57:28,783 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:57:28,784 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:57:28,784 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:57:28,784 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:57:28,784 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:57:28,785 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:57:28,785 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:57:28,785 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:57:28,786 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:57:28,786 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:57:28,786 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:57:28,786 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:57:28,787 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:57:28,787 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:57:28,787 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:57:28,787 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:57:28,788 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:57:28,788 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:57:28,788 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:57:28,788 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:57:28,789 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:57:28,789 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:57:28,789 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:57:28,790 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:57:28,790 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:57:28,790 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:57:28,790 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:57:28,791 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:57:28,791 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:57:28,791 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:57:28,791 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:57:28,792 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:57:28,792 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:57:28,792 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:57:28,792 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:57:28,793 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:57:28,793 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:57:28,793 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:57:28,793 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:57:28,794 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:57:28,794 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:57:28,794 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:57:28,794 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:57:28,794 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:57:28,795 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:57:28,795 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:57:28,795 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:57:28,795 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:57:28,796 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:57:28,796 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:57:28,796 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:57:28,796 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:57:28,797 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:57:28,797 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:57:28,797 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:57:28,797 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:57:28,798 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:57:28,798 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:57:28,798 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:57:28,798 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:57:28,799 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:57:28,815 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:57:28,816 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:57:28,816 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:57:28,816 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:57:28,817 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:57:28,817 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:57:28,817 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:57:28,817 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:57:28,818 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:57:28,818 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:57:28,818 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:57:28,818 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:57:28,819 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:57:28,819 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:57:28,819 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:57:28,819 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:57:28,820 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:57:28,820 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:57:28,820 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:57:28,820 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:57:28,821 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:57:28,821 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:57:28,821 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:57:28,821 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:57:28,821 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:57:28,821 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:57:28,822 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:57:28,822 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:57:28,822 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:57:28,822 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:57:28,822 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:57:28,823 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:57:28,823 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:57:28,823 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:57:28,823 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:57:28,823 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:57:28,824 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:57:28,824 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:57:28,824 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:57:28,825 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:57:28,825 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:57:28,825 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:57:28,825 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:57:28,825 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:57:28,825 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:57:28,826 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:57:28,826 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:57:28,826 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:57:28,826 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:57:28,827 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:57:28,827 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:57:28,827 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:57:28,827 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:57:28,827 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:57:28,827 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:57:28,828 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:57:28,828 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:57:28,828 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:57:28,828 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:57:28,828 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:57:28,829 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:57:28,829 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:57:28,829 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:57:28,829 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:57:28,829 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:57:28,830 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:57:28,830 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:57:28,830 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:57:28,833 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:57:28,834 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:57:28,834 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:57:28,834 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:57:28,834 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:57:28,834 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:57:28,835 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:57:28,835 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:57:28,835 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:57:28,835 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:57:28,835 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:57:28,836 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:57:28,838 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:57:28,839 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:57:28,839 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:57:28,839 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:57:28,839 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:57:28,839 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:57:28,840 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:57:28,840 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:57:28,840 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:57:28,840 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:57:28,843 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:57:28,844 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:57:28,844 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:57:28,844 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:57:28,844 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:57:28,844 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:57:28,845 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:57:28,845 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:57:28,845 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:57:28,845 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:57:28,845 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:57:28,845 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:57:28,846 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:57:28,846 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:57:28,846 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:57:28,846 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:57:28,846 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:57:28,847 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:57:28,847 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:57:28,847 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:57:28,847 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:57:28,847 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:57:28,847 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:57:28,848 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:57:28,848 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:57:28,848 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:57:28,848 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:57:28,863 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 14:57:28,878 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 14:57:28,879 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 14:57:28,879 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 14:57:28,879 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 14:57:28,879 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 14:57:28,879 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 14:57:28,879 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 14:57:28,879 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 14:57:28,896 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 164 places, 195 transitions [2019-12-18 14:57:28,898 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 164 places, 195 transitions [2019-12-18 14:57:28,985 INFO L126 PetriNetUnfolder]: 41/192 cut-off events. [2019-12-18 14:57:28,985 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 14:57:29,002 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. 9/158 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-18 14:57:29,028 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 164 places, 195 transitions [2019-12-18 14:57:29,070 INFO L126 PetriNetUnfolder]: 41/192 cut-off events. [2019-12-18 14:57:29,071 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 14:57:29,078 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. 9/158 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-18 14:57:29,099 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 16696 [2019-12-18 14:57:29,100 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 14:57:34,786 WARN L192 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 89 [2019-12-18 14:57:34,907 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-12-18 14:57:34,932 INFO L206 etLargeBlockEncoding]: Checked pairs total: 66430 [2019-12-18 14:57:34,933 INFO L214 etLargeBlockEncoding]: Total number of compositions: 109 [2019-12-18 14:57:34,936 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 83 places, 89 transitions [2019-12-18 14:57:46,874 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 89098 states. [2019-12-18 14:57:46,876 INFO L276 IsEmpty]: Start isEmpty. Operand 89098 states. [2019-12-18 14:57:46,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-18 14:57:46,882 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:57:46,883 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-18 14:57:46,885 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-18 14:57:46,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:57:46,891 INFO L82 PathProgramCache]: Analyzing trace with hash 797474656, now seen corresponding path program 1 times [2019-12-18 14:57:46,898 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:57:46,898 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251707952] [2019-12-18 14:57:46,899 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:57:47,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:57:47,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:57:47,137 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251707952] [2019-12-18 14:57:47,139 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:57:47,140 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 14:57:47,141 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132938171] [2019-12-18 14:57:47,146 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:57:47,146 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:57:47,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:57:47,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:57:47,163 INFO L87 Difference]: Start difference. First operand 89098 states. Second operand 3 states. [2019-12-18 14:57:48,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:57:48,434 INFO L93 Difference]: Finished difference Result 87834 states and 374974 transitions. [2019-12-18 14:57:48,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:57:48,436 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-18 14:57:48,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:57:51,453 INFO L225 Difference]: With dead ends: 87834 [2019-12-18 14:57:51,453 INFO L226 Difference]: Without dead ends: 82738 [2019-12-18 14:57:51,455 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:57:56,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82738 states. [2019-12-18 14:57:58,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82738 to 82738. [2019-12-18 14:57:58,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82738 states. [2019-12-18 14:57:58,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82738 states to 82738 states and 352742 transitions. [2019-12-18 14:57:58,891 INFO L78 Accepts]: Start accepts. Automaton has 82738 states and 352742 transitions. Word has length 5 [2019-12-18 14:57:58,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:57:58,891 INFO L462 AbstractCegarLoop]: Abstraction has 82738 states and 352742 transitions. [2019-12-18 14:57:58,891 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:57:58,891 INFO L276 IsEmpty]: Start isEmpty. Operand 82738 states and 352742 transitions. [2019-12-18 14:57:58,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 14:57:58,902 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:57:58,902 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:57:58,902 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-18 14:57:58,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:57:58,903 INFO L82 PathProgramCache]: Analyzing trace with hash 334215788, now seen corresponding path program 1 times [2019-12-18 14:57:58,903 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:57:58,903 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390394007] [2019-12-18 14:57:58,903 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:57:58,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:57:59,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:57:59,033 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390394007] [2019-12-18 14:57:59,033 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:57:59,033 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:57:59,034 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021652946] [2019-12-18 14:57:59,035 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 14:57:59,036 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:57:59,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 14:57:59,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 14:57:59,036 INFO L87 Difference]: Start difference. First operand 82738 states and 352742 transitions. Second operand 4 states. [2019-12-18 14:58:03,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:58:03,571 INFO L93 Difference]: Finished difference Result 127286 states and 521114 transitions. [2019-12-18 14:58:03,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 14:58:03,571 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-18 14:58:03,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:58:04,204 INFO L225 Difference]: With dead ends: 127286 [2019-12-18 14:58:04,204 INFO L226 Difference]: Without dead ends: 127202 [2019-12-18 14:58:04,208 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:58:08,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127202 states. [2019-12-18 14:58:11,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127202 to 115962. [2019-12-18 14:58:11,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115962 states. [2019-12-18 14:58:11,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115962 states to 115962 states and 480151 transitions. [2019-12-18 14:58:11,788 INFO L78 Accepts]: Start accepts. Automaton has 115962 states and 480151 transitions. Word has length 13 [2019-12-18 14:58:11,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:58:11,789 INFO L462 AbstractCegarLoop]: Abstraction has 115962 states and 480151 transitions. [2019-12-18 14:58:11,789 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 14:58:11,789 INFO L276 IsEmpty]: Start isEmpty. Operand 115962 states and 480151 transitions. [2019-12-18 14:58:11,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 14:58:11,793 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:58:11,793 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:58:11,793 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-18 14:58:11,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:58:11,793 INFO L82 PathProgramCache]: Analyzing trace with hash -1013985610, now seen corresponding path program 1 times [2019-12-18 14:58:11,794 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:58:11,794 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705463845] [2019-12-18 14:58:11,794 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:58:11,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:58:11,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:58:11,883 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705463845] [2019-12-18 14:58:11,883 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:58:11,883 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:58:11,884 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196512948] [2019-12-18 14:58:11,884 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:58:11,884 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:58:11,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:58:11,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:58:11,885 INFO L87 Difference]: Start difference. First operand 115962 states and 480151 transitions. Second operand 3 states. [2019-12-18 14:58:12,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:58:12,019 INFO L93 Difference]: Finished difference Result 28492 states and 95363 transitions. [2019-12-18 14:58:12,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:58:12,020 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-18 14:58:12,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:58:12,092 INFO L225 Difference]: With dead ends: 28492 [2019-12-18 14:58:12,093 INFO L226 Difference]: Without dead ends: 28492 [2019-12-18 14:58:12,093 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:58:12,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28492 states. [2019-12-18 14:58:16,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28492 to 28492. [2019-12-18 14:58:16,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28492 states. [2019-12-18 14:58:16,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28492 states to 28492 states and 95363 transitions. [2019-12-18 14:58:16,550 INFO L78 Accepts]: Start accepts. Automaton has 28492 states and 95363 transitions. Word has length 13 [2019-12-18 14:58:16,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:58:16,551 INFO L462 AbstractCegarLoop]: Abstraction has 28492 states and 95363 transitions. [2019-12-18 14:58:16,551 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:58:16,551 INFO L276 IsEmpty]: Start isEmpty. Operand 28492 states and 95363 transitions. [2019-12-18 14:58:16,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 14:58:16,553 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:58:16,553 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:58:16,553 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-18 14:58:16,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:58:16,553 INFO L82 PathProgramCache]: Analyzing trace with hash 319138254, now seen corresponding path program 1 times [2019-12-18 14:58:16,554 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:58:16,554 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818455872] [2019-12-18 14:58:16,554 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:58:16,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:58:16,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:58:16,660 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818455872] [2019-12-18 14:58:16,660 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:58:16,661 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 14:58:16,661 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811973172] [2019-12-18 14:58:16,661 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 14:58:16,662 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:58:16,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 14:58:16,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:58:16,662 INFO L87 Difference]: Start difference. First operand 28492 states and 95363 transitions. Second operand 5 states. [2019-12-18 14:58:17,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:58:17,140 INFO L93 Difference]: Finished difference Result 41156 states and 135447 transitions. [2019-12-18 14:58:17,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 14:58:17,140 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-18 14:58:17,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:58:17,218 INFO L225 Difference]: With dead ends: 41156 [2019-12-18 14:58:17,218 INFO L226 Difference]: Without dead ends: 41141 [2019-12-18 14:58:17,218 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 14:58:17,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41141 states. [2019-12-18 14:58:17,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41141 to 31619. [2019-12-18 14:58:17,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31619 states. [2019-12-18 14:58:17,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31619 states to 31619 states and 105299 transitions. [2019-12-18 14:58:17,868 INFO L78 Accepts]: Start accepts. Automaton has 31619 states and 105299 transitions. Word has length 14 [2019-12-18 14:58:17,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:58:17,869 INFO L462 AbstractCegarLoop]: Abstraction has 31619 states and 105299 transitions. [2019-12-18 14:58:17,869 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 14:58:17,869 INFO L276 IsEmpty]: Start isEmpty. Operand 31619 states and 105299 transitions. [2019-12-18 14:58:17,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 14:58:17,879 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:58:17,880 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:58:17,880 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-18 14:58:17,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:58:17,880 INFO L82 PathProgramCache]: Analyzing trace with hash 436639450, now seen corresponding path program 1 times [2019-12-18 14:58:17,881 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:58:17,881 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625500156] [2019-12-18 14:58:17,881 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:58:17,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:58:18,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:58:18,095 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625500156] [2019-12-18 14:58:18,095 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:58:18,095 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 14:58:18,096 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039446852] [2019-12-18 14:58:18,096 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 14:58:18,096 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:58:18,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 14:58:18,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 14:58:18,097 INFO L87 Difference]: Start difference. First operand 31619 states and 105299 transitions. Second operand 6 states. [2019-12-18 14:58:19,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:58:19,034 INFO L93 Difference]: Finished difference Result 48363 states and 157775 transitions. [2019-12-18 14:58:19,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 14:58:19,035 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-18 14:58:19,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:58:19,557 INFO L225 Difference]: With dead ends: 48363 [2019-12-18 14:58:19,557 INFO L226 Difference]: Without dead ends: 48336 [2019-12-18 14:58:19,558 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-18 14:58:19,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48336 states. [2019-12-18 14:58:20,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48336 to 33272. [2019-12-18 14:58:20,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33272 states. [2019-12-18 14:58:20,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33272 states to 33272 states and 109841 transitions. [2019-12-18 14:58:20,213 INFO L78 Accepts]: Start accepts. Automaton has 33272 states and 109841 transitions. Word has length 22 [2019-12-18 14:58:20,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:58:20,213 INFO L462 AbstractCegarLoop]: Abstraction has 33272 states and 109841 transitions. [2019-12-18 14:58:20,213 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 14:58:20,213 INFO L276 IsEmpty]: Start isEmpty. Operand 33272 states and 109841 transitions. [2019-12-18 14:58:20,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 14:58:20,230 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:58:20,230 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:58:20,231 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-18 14:58:20,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:58:20,231 INFO L82 PathProgramCache]: Analyzing trace with hash -1832050687, now seen corresponding path program 1 times [2019-12-18 14:58:20,231 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:58:20,231 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991182637] [2019-12-18 14:58:20,232 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:58:20,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:58:20,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:58:20,304 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991182637] [2019-12-18 14:58:20,305 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:58:20,305 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 14:58:20,305 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308839531] [2019-12-18 14:58:20,305 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 14:58:20,306 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:58:20,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 14:58:20,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 14:58:20,306 INFO L87 Difference]: Start difference. First operand 33272 states and 109841 transitions. Second operand 4 states. [2019-12-18 14:58:20,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:58:20,388 INFO L93 Difference]: Finished difference Result 12861 states and 39176 transitions. [2019-12-18 14:58:20,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 14:58:20,389 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-18 14:58:20,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:58:20,415 INFO L225 Difference]: With dead ends: 12861 [2019-12-18 14:58:20,415 INFO L226 Difference]: Without dead ends: 12861 [2019-12-18 14:58:20,415 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 14:58:20,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12861 states. [2019-12-18 14:58:20,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12861 to 12721. [2019-12-18 14:58:20,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12721 states. [2019-12-18 14:58:20,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12721 states to 12721 states and 38766 transitions. [2019-12-18 14:58:20,672 INFO L78 Accepts]: Start accepts. Automaton has 12721 states and 38766 transitions. Word has length 25 [2019-12-18 14:58:20,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:58:20,673 INFO L462 AbstractCegarLoop]: Abstraction has 12721 states and 38766 transitions. [2019-12-18 14:58:20,673 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 14:58:20,673 INFO L276 IsEmpty]: Start isEmpty. Operand 12721 states and 38766 transitions. [2019-12-18 14:58:20,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-18 14:58:20,689 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:58:20,689 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:58:20,689 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-18 14:58:20,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:58:20,690 INFO L82 PathProgramCache]: Analyzing trace with hash 207279171, now seen corresponding path program 1 times [2019-12-18 14:58:20,690 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:58:20,690 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387873781] [2019-12-18 14:58:20,690 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:58:20,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:58:20,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:58:20,773 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387873781] [2019-12-18 14:58:20,773 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:58:20,773 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 14:58:20,774 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327234179] [2019-12-18 14:58:20,774 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 14:58:20,774 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:58:20,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 14:58:20,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:58:20,775 INFO L87 Difference]: Start difference. First operand 12721 states and 38766 transitions. Second operand 5 states. [2019-12-18 14:58:20,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:58:20,842 INFO L93 Difference]: Finished difference Result 11425 states and 35436 transitions. [2019-12-18 14:58:20,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 14:58:20,842 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2019-12-18 14:58:20,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:58:20,862 INFO L225 Difference]: With dead ends: 11425 [2019-12-18 14:58:20,862 INFO L226 Difference]: Without dead ends: 11425 [2019-12-18 14:58:20,862 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:58:20,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11425 states. [2019-12-18 14:58:21,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11425 to 10977. [2019-12-18 14:58:21,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10977 states. [2019-12-18 14:58:21,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10977 states to 10977 states and 34172 transitions. [2019-12-18 14:58:21,028 INFO L78 Accepts]: Start accepts. Automaton has 10977 states and 34172 transitions. Word has length 39 [2019-12-18 14:58:21,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:58:21,028 INFO L462 AbstractCegarLoop]: Abstraction has 10977 states and 34172 transitions. [2019-12-18 14:58:21,028 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 14:58:21,028 INFO L276 IsEmpty]: Start isEmpty. Operand 10977 states and 34172 transitions. [2019-12-18 14:58:21,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-18 14:58:21,046 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:58:21,046 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:58:21,046 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-18 14:58:21,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:58:21,047 INFO L82 PathProgramCache]: Analyzing trace with hash 1179829373, now seen corresponding path program 1 times [2019-12-18 14:58:21,047 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:58:21,047 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622879200] [2019-12-18 14:58:21,047 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:58:21,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:58:21,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-18 14:58:21,134 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622879200] [2019-12-18 14:58:21,134 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:58:21,134 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 14:58:21,134 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256771591] [2019-12-18 14:58:21,135 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 14:58:21,135 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:58:21,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 14:58:21,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 14:58:21,136 INFO L87 Difference]: Start difference. First operand 10977 states and 34172 transitions. Second operand 4 states. [2019-12-18 14:58:21,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:58:21,211 INFO L93 Difference]: Finished difference Result 20009 states and 62260 transitions. [2019-12-18 14:58:21,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 14:58:21,211 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 53 [2019-12-18 14:58:21,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:58:21,225 INFO L225 Difference]: With dead ends: 20009 [2019-12-18 14:58:21,225 INFO L226 Difference]: Without dead ends: 9365 [2019-12-18 14:58:21,225 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:58:21,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9365 states. [2019-12-18 14:58:21,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9365 to 9365. [2019-12-18 14:58:21,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9365 states. [2019-12-18 14:58:21,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9365 states to 9365 states and 29013 transitions. [2019-12-18 14:58:21,365 INFO L78 Accepts]: Start accepts. Automaton has 9365 states and 29013 transitions. Word has length 53 [2019-12-18 14:58:21,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:58:21,366 INFO L462 AbstractCegarLoop]: Abstraction has 9365 states and 29013 transitions. [2019-12-18 14:58:21,366 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 14:58:21,366 INFO L276 IsEmpty]: Start isEmpty. Operand 9365 states and 29013 transitions. [2019-12-18 14:58:21,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-18 14:58:21,379 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:58:21,379 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:58:21,379 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-18 14:58:21,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:58:21,380 INFO L82 PathProgramCache]: Analyzing trace with hash 383407097, now seen corresponding path program 2 times [2019-12-18 14:58:21,380 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:58:21,380 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953259302] [2019-12-18 14:58:21,380 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:58:21,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:58:21,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:58:21,476 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953259302] [2019-12-18 14:58:21,477 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:58:21,477 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 14:58:21,477 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527396352] [2019-12-18 14:58:21,477 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 14:58:21,478 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:58:21,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 14:58:21,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 14:58:21,478 INFO L87 Difference]: Start difference. First operand 9365 states and 29013 transitions. Second operand 7 states. [2019-12-18 14:58:21,827 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 6 [2019-12-18 14:58:21,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:58:21,995 INFO L93 Difference]: Finished difference Result 23182 states and 71788 transitions. [2019-12-18 14:58:21,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 14:58:21,996 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2019-12-18 14:58:21,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:58:22,022 INFO L225 Difference]: With dead ends: 23182 [2019-12-18 14:58:22,022 INFO L226 Difference]: Without dead ends: 18276 [2019-12-18 14:58:22,022 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-18 14:58:22,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18276 states. [2019-12-18 14:58:22,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18276 to 11162. [2019-12-18 14:58:22,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11162 states. [2019-12-18 14:58:22,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11162 states to 11162 states and 34879 transitions. [2019-12-18 14:58:22,243 INFO L78 Accepts]: Start accepts. Automaton has 11162 states and 34879 transitions. Word has length 53 [2019-12-18 14:58:22,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:58:22,243 INFO L462 AbstractCegarLoop]: Abstraction has 11162 states and 34879 transitions. [2019-12-18 14:58:22,243 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 14:58:22,243 INFO L276 IsEmpty]: Start isEmpty. Operand 11162 states and 34879 transitions. [2019-12-18 14:58:22,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-18 14:58:22,258 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:58:22,258 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:58:22,259 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-18 14:58:22,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:58:22,259 INFO L82 PathProgramCache]: Analyzing trace with hash 1401815865, now seen corresponding path program 3 times [2019-12-18 14:58:22,259 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:58:22,259 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265292663] [2019-12-18 14:58:22,260 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:58:22,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:58:22,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:58:22,350 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265292663] [2019-12-18 14:58:22,350 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:58:22,350 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 14:58:22,350 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973949526] [2019-12-18 14:58:22,351 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 14:58:22,351 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:58:22,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 14:58:22,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 14:58:22,351 INFO L87 Difference]: Start difference. First operand 11162 states and 34879 transitions. Second operand 7 states. [2019-12-18 14:58:22,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:58:22,724 INFO L93 Difference]: Finished difference Result 27840 states and 85084 transitions. [2019-12-18 14:58:22,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 14:58:22,724 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2019-12-18 14:58:22,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:58:22,756 INFO L225 Difference]: With dead ends: 27840 [2019-12-18 14:58:22,757 INFO L226 Difference]: Without dead ends: 19924 [2019-12-18 14:58:22,757 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-18 14:58:22,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19924 states. [2019-12-18 14:58:23,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19924 to 13020. [2019-12-18 14:58:23,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13020 states. [2019-12-18 14:58:23,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13020 states to 13020 states and 40574 transitions. [2019-12-18 14:58:23,026 INFO L78 Accepts]: Start accepts. Automaton has 13020 states and 40574 transitions. Word has length 53 [2019-12-18 14:58:23,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:58:23,026 INFO L462 AbstractCegarLoop]: Abstraction has 13020 states and 40574 transitions. [2019-12-18 14:58:23,026 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 14:58:23,026 INFO L276 IsEmpty]: Start isEmpty. Operand 13020 states and 40574 transitions. [2019-12-18 14:58:23,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-18 14:58:23,045 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:58:23,045 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:58:23,045 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-18 14:58:23,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:58:23,046 INFO L82 PathProgramCache]: Analyzing trace with hash 1901485579, now seen corresponding path program 4 times [2019-12-18 14:58:23,046 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:58:23,046 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754475758] [2019-12-18 14:58:23,046 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:58:23,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:58:23,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:58:23,162 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754475758] [2019-12-18 14:58:23,162 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:58:23,162 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 14:58:23,163 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475486750] [2019-12-18 14:58:23,163 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 14:58:23,163 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:58:23,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 14:58:23,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 14:58:23,164 INFO L87 Difference]: Start difference. First operand 13020 states and 40574 transitions. Second operand 7 states. [2019-12-18 14:58:23,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:58:23,547 INFO L93 Difference]: Finished difference Result 25803 states and 80188 transitions. [2019-12-18 14:58:23,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 14:58:23,548 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2019-12-18 14:58:23,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:58:23,583 INFO L225 Difference]: With dead ends: 25803 [2019-12-18 14:58:23,583 INFO L226 Difference]: Without dead ends: 23832 [2019-12-18 14:58:23,583 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-12-18 14:58:23,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23832 states. [2019-12-18 14:58:23,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23832 to 13086. [2019-12-18 14:58:23,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13086 states. [2019-12-18 14:58:23,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13086 states to 13086 states and 40859 transitions. [2019-12-18 14:58:23,865 INFO L78 Accepts]: Start accepts. Automaton has 13086 states and 40859 transitions. Word has length 53 [2019-12-18 14:58:23,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:58:23,865 INFO L462 AbstractCegarLoop]: Abstraction has 13086 states and 40859 transitions. [2019-12-18 14:58:23,865 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 14:58:23,865 INFO L276 IsEmpty]: Start isEmpty. Operand 13086 states and 40859 transitions. [2019-12-18 14:58:23,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-18 14:58:23,880 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:58:23,880 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:58:23,881 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-18 14:58:23,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:58:23,881 INFO L82 PathProgramCache]: Analyzing trace with hash -9451933, now seen corresponding path program 1 times [2019-12-18 14:58:23,881 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:58:23,881 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825221638] [2019-12-18 14:58:23,881 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:58:23,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:58:23,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:58:23,929 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825221638] [2019-12-18 14:58:23,929 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:58:23,929 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 14:58:23,930 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944537975] [2019-12-18 14:58:23,930 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:58:23,930 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:58:23,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:58:23,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:58:23,931 INFO L87 Difference]: Start difference. First operand 13086 states and 40859 transitions. Second operand 3 states. [2019-12-18 14:58:24,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:58:24,025 INFO L93 Difference]: Finished difference Result 18737 states and 58738 transitions. [2019-12-18 14:58:24,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:58:24,026 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-12-18 14:58:24,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:58:24,052 INFO L225 Difference]: With dead ends: 18737 [2019-12-18 14:58:24,053 INFO L226 Difference]: Without dead ends: 18737 [2019-12-18 14:58:24,053 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:58:24,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18737 states. [2019-12-18 14:58:24,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18737 to 16909. [2019-12-18 14:58:24,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16909 states. [2019-12-18 14:58:24,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16909 states to 16909 states and 53533 transitions. [2019-12-18 14:58:24,543 INFO L78 Accepts]: Start accepts. Automaton has 16909 states and 53533 transitions. Word has length 53 [2019-12-18 14:58:24,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:58:24,543 INFO L462 AbstractCegarLoop]: Abstraction has 16909 states and 53533 transitions. [2019-12-18 14:58:24,543 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:58:24,543 INFO L276 IsEmpty]: Start isEmpty. Operand 16909 states and 53533 transitions. [2019-12-18 14:58:24,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-18 14:58:24,563 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:58:24,563 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:58:24,563 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-18 14:58:24,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:58:24,564 INFO L82 PathProgramCache]: Analyzing trace with hash 2081547793, now seen corresponding path program 5 times [2019-12-18 14:58:24,564 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:58:24,564 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127274344] [2019-12-18 14:58:24,564 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:58:24,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:58:24,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:58:24,664 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127274344] [2019-12-18 14:58:24,664 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:58:24,664 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 14:58:24,664 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541708786] [2019-12-18 14:58:24,665 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 14:58:24,665 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:58:24,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 14:58:24,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 14:58:24,668 INFO L87 Difference]: Start difference. First operand 16909 states and 53533 transitions. Second operand 6 states. [2019-12-18 14:58:25,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:58:25,353 INFO L93 Difference]: Finished difference Result 31543 states and 97867 transitions. [2019-12-18 14:58:25,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 14:58:25,354 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2019-12-18 14:58:25,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:58:25,400 INFO L225 Difference]: With dead ends: 31543 [2019-12-18 14:58:25,400 INFO L226 Difference]: Without dead ends: 31459 [2019-12-18 14:58:25,400 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-18 14:58:25,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31459 states. [2019-12-18 14:58:25,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31459 to 19853. [2019-12-18 14:58:25,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19853 states. [2019-12-18 14:58:25,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19853 states to 19853 states and 62091 transitions. [2019-12-18 14:58:25,771 INFO L78 Accepts]: Start accepts. Automaton has 19853 states and 62091 transitions. Word has length 53 [2019-12-18 14:58:25,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:58:25,771 INFO L462 AbstractCegarLoop]: Abstraction has 19853 states and 62091 transitions. [2019-12-18 14:58:25,771 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 14:58:25,771 INFO L276 IsEmpty]: Start isEmpty. Operand 19853 states and 62091 transitions. [2019-12-18 14:58:25,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-18 14:58:25,802 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:58:25,802 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:58:25,803 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-18 14:58:25,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:58:25,803 INFO L82 PathProgramCache]: Analyzing trace with hash -1629843107, now seen corresponding path program 6 times [2019-12-18 14:58:25,803 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:58:25,803 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672194697] [2019-12-18 14:58:25,804 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:58:25,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:58:25,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:58:25,915 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672194697] [2019-12-18 14:58:25,915 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:58:25,916 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 14:58:25,916 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777584579] [2019-12-18 14:58:25,916 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 14:58:25,916 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:58:25,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 14:58:25,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 14:58:25,917 INFO L87 Difference]: Start difference. First operand 19853 states and 62091 transitions. Second operand 7 states. [2019-12-18 14:58:26,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:58:26,846 INFO L93 Difference]: Finished difference Result 31464 states and 95079 transitions. [2019-12-18 14:58:26,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-18 14:58:26,846 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2019-12-18 14:58:26,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:58:26,890 INFO L225 Difference]: With dead ends: 31464 [2019-12-18 14:58:26,890 INFO L226 Difference]: Without dead ends: 31342 [2019-12-18 14:58:26,890 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2019-12-18 14:58:26,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31342 states. [2019-12-18 14:58:27,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31342 to 25003. [2019-12-18 14:58:27,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25003 states. [2019-12-18 14:58:27,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25003 states to 25003 states and 77213 transitions. [2019-12-18 14:58:27,348 INFO L78 Accepts]: Start accepts. Automaton has 25003 states and 77213 transitions. Word has length 53 [2019-12-18 14:58:27,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:58:27,349 INFO L462 AbstractCegarLoop]: Abstraction has 25003 states and 77213 transitions. [2019-12-18 14:58:27,349 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 14:58:27,349 INFO L276 IsEmpty]: Start isEmpty. Operand 25003 states and 77213 transitions. [2019-12-18 14:58:27,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-18 14:58:27,387 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:58:27,387 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:58:27,388 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-18 14:58:27,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:58:27,388 INFO L82 PathProgramCache]: Analyzing trace with hash -1109995221, now seen corresponding path program 7 times [2019-12-18 14:58:27,388 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:58:27,388 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354099869] [2019-12-18 14:58:27,389 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:58:27,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:58:27,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:58:27,520 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354099869] [2019-12-18 14:58:27,520 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:58:27,520 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 14:58:27,520 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036010041] [2019-12-18 14:58:27,521 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 14:58:27,521 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:58:27,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 14:58:27,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-12-18 14:58:27,521 INFO L87 Difference]: Start difference. First operand 25003 states and 77213 transitions. Second operand 9 states. [2019-12-18 14:58:29,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:58:29,392 INFO L93 Difference]: Finished difference Result 41056 states and 124508 transitions. [2019-12-18 14:58:29,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-18 14:58:29,392 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 53 [2019-12-18 14:58:29,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:58:29,453 INFO L225 Difference]: With dead ends: 41056 [2019-12-18 14:58:29,453 INFO L226 Difference]: Without dead ends: 41056 [2019-12-18 14:58:29,454 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=138, Invalid=512, Unknown=0, NotChecked=0, Total=650 [2019-12-18 14:58:29,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41056 states. [2019-12-18 14:58:29,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41056 to 23556. [2019-12-18 14:58:29,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23556 states. [2019-12-18 14:58:29,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23556 states to 23556 states and 73044 transitions. [2019-12-18 14:58:29,943 INFO L78 Accepts]: Start accepts. Automaton has 23556 states and 73044 transitions. Word has length 53 [2019-12-18 14:58:29,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:58:29,944 INFO L462 AbstractCegarLoop]: Abstraction has 23556 states and 73044 transitions. [2019-12-18 14:58:29,944 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 14:58:29,944 INFO L276 IsEmpty]: Start isEmpty. Operand 23556 states and 73044 transitions. [2019-12-18 14:58:29,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-18 14:58:29,969 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:58:29,969 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:58:29,969 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-18 14:58:29,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:58:29,970 INFO L82 PathProgramCache]: Analyzing trace with hash 2099294685, now seen corresponding path program 8 times [2019-12-18 14:58:29,970 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:58:29,970 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717809574] [2019-12-18 14:58:29,970 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:58:29,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:58:30,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:58:30,034 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717809574] [2019-12-18 14:58:30,034 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:58:30,034 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:58:30,035 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331627247] [2019-12-18 14:58:30,035 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:58:30,035 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:58:30,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:58:30,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:58:30,036 INFO L87 Difference]: Start difference. First operand 23556 states and 73044 transitions. Second operand 3 states. [2019-12-18 14:58:30,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:58:30,111 INFO L93 Difference]: Finished difference Result 17418 states and 53184 transitions. [2019-12-18 14:58:30,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:58:30,111 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-12-18 14:58:30,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:58:30,143 INFO L225 Difference]: With dead ends: 17418 [2019-12-18 14:58:30,144 INFO L226 Difference]: Without dead ends: 17418 [2019-12-18 14:58:30,144 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:58:30,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17418 states. [2019-12-18 14:58:30,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17418 to 16845. [2019-12-18 14:58:30,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16845 states. [2019-12-18 14:58:30,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16845 states to 16845 states and 51304 transitions. [2019-12-18 14:58:30,604 INFO L78 Accepts]: Start accepts. Automaton has 16845 states and 51304 transitions. Word has length 53 [2019-12-18 14:58:30,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:58:30,604 INFO L462 AbstractCegarLoop]: Abstraction has 16845 states and 51304 transitions. [2019-12-18 14:58:30,605 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:58:30,605 INFO L276 IsEmpty]: Start isEmpty. Operand 16845 states and 51304 transitions. [2019-12-18 14:58:30,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 14:58:30,637 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:58:30,638 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:58:30,638 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-18 14:58:30,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:58:30,638 INFO L82 PathProgramCache]: Analyzing trace with hash -2130494140, now seen corresponding path program 1 times [2019-12-18 14:58:30,639 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:58:30,639 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927617583] [2019-12-18 14:58:30,639 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:58:30,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:58:30,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:58:30,848 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927617583] [2019-12-18 14:58:30,848 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:58:30,849 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 14:58:30,849 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044002756] [2019-12-18 14:58:30,851 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 14:58:30,851 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:58:30,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 14:58:30,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-18 14:58:30,852 INFO L87 Difference]: Start difference. First operand 16845 states and 51304 transitions. Second operand 7 states. [2019-12-18 14:58:31,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:58:31,687 INFO L93 Difference]: Finished difference Result 23352 states and 69676 transitions. [2019-12-18 14:58:31,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 14:58:31,688 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-12-18 14:58:31,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:58:31,719 INFO L225 Difference]: With dead ends: 23352 [2019-12-18 14:58:31,720 INFO L226 Difference]: Without dead ends: 23216 [2019-12-18 14:58:31,720 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-18 14:58:31,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23216 states. [2019-12-18 14:58:31,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23216 to 18293. [2019-12-18 14:58:31,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18293 states. [2019-12-18 14:58:32,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18293 states to 18293 states and 55408 transitions. [2019-12-18 14:58:32,009 INFO L78 Accepts]: Start accepts. Automaton has 18293 states and 55408 transitions. Word has length 54 [2019-12-18 14:58:32,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:58:32,010 INFO L462 AbstractCegarLoop]: Abstraction has 18293 states and 55408 transitions. [2019-12-18 14:58:32,010 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 14:58:32,010 INFO L276 IsEmpty]: Start isEmpty. Operand 18293 states and 55408 transitions. [2019-12-18 14:58:32,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 14:58:32,029 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:58:32,029 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:58:32,029 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-18 14:58:32,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:58:32,029 INFO L82 PathProgramCache]: Analyzing trace with hash -1027069858, now seen corresponding path program 2 times [2019-12-18 14:58:32,030 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:58:32,030 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603003502] [2019-12-18 14:58:32,030 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:58:32,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:58:32,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:58:32,879 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603003502] [2019-12-18 14:58:32,879 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:58:32,879 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 14:58:32,879 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208527903] [2019-12-18 14:58:32,880 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-18 14:58:32,880 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:58:32,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-18 14:58:32,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2019-12-18 14:58:32,880 INFO L87 Difference]: Start difference. First operand 18293 states and 55408 transitions. Second operand 15 states. [2019-12-18 14:58:37,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:58:37,224 INFO L93 Difference]: Finished difference Result 39787 states and 118911 transitions. [2019-12-18 14:58:37,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-12-18 14:58:37,225 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 54 [2019-12-18 14:58:37,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:58:37,271 INFO L225 Difference]: With dead ends: 39787 [2019-12-18 14:58:37,271 INFO L226 Difference]: Without dead ends: 33383 [2019-12-18 14:58:37,272 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 0 SyntacticMatches, 4 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 944 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=519, Invalid=2787, Unknown=0, NotChecked=0, Total=3306 [2019-12-18 14:58:37,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33383 states. [2019-12-18 14:58:37,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33383 to 18933. [2019-12-18 14:58:37,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18933 states. [2019-12-18 14:58:37,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18933 states to 18933 states and 57023 transitions. [2019-12-18 14:58:37,633 INFO L78 Accepts]: Start accepts. Automaton has 18933 states and 57023 transitions. Word has length 54 [2019-12-18 14:58:37,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:58:37,633 INFO L462 AbstractCegarLoop]: Abstraction has 18933 states and 57023 transitions. [2019-12-18 14:58:37,633 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-18 14:58:37,633 INFO L276 IsEmpty]: Start isEmpty. Operand 18933 states and 57023 transitions. [2019-12-18 14:58:37,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 14:58:37,652 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:58:37,652 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:58:37,652 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-18 14:58:37,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:58:37,653 INFO L82 PathProgramCache]: Analyzing trace with hash 414061482, now seen corresponding path program 3 times [2019-12-18 14:58:37,653 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:58:37,653 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593893515] [2019-12-18 14:58:37,653 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:58:37,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:58:38,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:58:38,094 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593893515] [2019-12-18 14:58:38,095 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:58:38,095 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 14:58:38,095 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229519288] [2019-12-18 14:58:38,095 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-18 14:58:38,096 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:58:38,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-18 14:58:38,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2019-12-18 14:58:38,096 INFO L87 Difference]: Start difference. First operand 18933 states and 57023 transitions. Second operand 15 states. [2019-12-18 14:58:41,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:58:41,867 INFO L93 Difference]: Finished difference Result 35536 states and 105965 transitions. [2019-12-18 14:58:41,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-12-18 14:58:41,868 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 54 [2019-12-18 14:58:41,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:58:41,913 INFO L225 Difference]: With dead ends: 35536 [2019-12-18 14:58:41,913 INFO L226 Difference]: Without dead ends: 33368 [2019-12-18 14:58:41,914 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 860 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=514, Invalid=2566, Unknown=0, NotChecked=0, Total=3080 [2019-12-18 14:58:42,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33368 states. [2019-12-18 14:58:42,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33368 to 19029. [2019-12-18 14:58:42,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19029 states. [2019-12-18 14:58:42,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19029 states to 19029 states and 57259 transitions. [2019-12-18 14:58:42,272 INFO L78 Accepts]: Start accepts. Automaton has 19029 states and 57259 transitions. Word has length 54 [2019-12-18 14:58:42,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:58:42,272 INFO L462 AbstractCegarLoop]: Abstraction has 19029 states and 57259 transitions. [2019-12-18 14:58:42,272 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-18 14:58:42,272 INFO L276 IsEmpty]: Start isEmpty. Operand 19029 states and 57259 transitions. [2019-12-18 14:58:42,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 14:58:42,290 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:58:42,291 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:58:42,291 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-18 14:58:42,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:58:42,291 INFO L82 PathProgramCache]: Analyzing trace with hash -1398179606, now seen corresponding path program 4 times [2019-12-18 14:58:42,291 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:58:42,292 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54010772] [2019-12-18 14:58:42,292 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:58:42,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:58:42,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:58:42,698 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54010772] [2019-12-18 14:58:42,699 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:58:42,699 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 14:58:42,699 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279250601] [2019-12-18 14:58:42,700 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-18 14:58:42,700 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:58:42,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-18 14:58:42,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2019-12-18 14:58:42,701 INFO L87 Difference]: Start difference. First operand 19029 states and 57259 transitions. Second operand 15 states. [2019-12-18 14:58:46,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:58:46,165 INFO L93 Difference]: Finished difference Result 33362 states and 99518 transitions. [2019-12-18 14:58:46,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-12-18 14:58:46,165 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 54 [2019-12-18 14:58:46,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:58:46,211 INFO L225 Difference]: With dead ends: 33362 [2019-12-18 14:58:46,211 INFO L226 Difference]: Without dead ends: 32948 [2019-12-18 14:58:46,212 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 824 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=497, Invalid=2473, Unknown=0, NotChecked=0, Total=2970 [2019-12-18 14:58:46,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32948 states. [2019-12-18 14:58:46,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32948 to 18885. [2019-12-18 14:58:46,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18885 states. [2019-12-18 14:58:46,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18885 states to 18885 states and 56887 transitions. [2019-12-18 14:58:46,564 INFO L78 Accepts]: Start accepts. Automaton has 18885 states and 56887 transitions. Word has length 54 [2019-12-18 14:58:46,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:58:46,564 INFO L462 AbstractCegarLoop]: Abstraction has 18885 states and 56887 transitions. [2019-12-18 14:58:46,564 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-18 14:58:46,564 INFO L276 IsEmpty]: Start isEmpty. Operand 18885 states and 56887 transitions. [2019-12-18 14:58:46,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 14:58:46,582 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:58:46,582 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:58:46,582 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-18 14:58:46,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:58:46,583 INFO L82 PathProgramCache]: Analyzing trace with hash 792697694, now seen corresponding path program 5 times [2019-12-18 14:58:46,583 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:58:46,583 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192385897] [2019-12-18 14:58:46,583 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:58:46,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:58:47,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:58:47,196 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192385897] [2019-12-18 14:58:47,196 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:58:47,196 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 14:58:47,196 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982296925] [2019-12-18 14:58:47,197 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-18 14:58:47,197 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:58:47,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-18 14:58:47,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2019-12-18 14:58:47,197 INFO L87 Difference]: Start difference. First operand 18885 states and 56887 transitions. Second operand 15 states. [2019-12-18 14:58:51,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:58:51,366 INFO L93 Difference]: Finished difference Result 45720 states and 137146 transitions. [2019-12-18 14:58:51,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-12-18 14:58:51,366 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 54 [2019-12-18 14:58:51,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:58:51,429 INFO L225 Difference]: With dead ends: 45720 [2019-12-18 14:58:51,429 INFO L226 Difference]: Without dead ends: 44426 [2019-12-18 14:58:51,431 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1185 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=576, Invalid=3456, Unknown=0, NotChecked=0, Total=4032 [2019-12-18 14:58:51,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44426 states. [2019-12-18 14:58:51,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44426 to 24692. [2019-12-18 14:58:51,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24692 states. [2019-12-18 14:58:51,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24692 states to 24692 states and 74487 transitions. [2019-12-18 14:58:51,962 INFO L78 Accepts]: Start accepts. Automaton has 24692 states and 74487 transitions. Word has length 54 [2019-12-18 14:58:51,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:58:51,962 INFO L462 AbstractCegarLoop]: Abstraction has 24692 states and 74487 transitions. [2019-12-18 14:58:51,962 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-18 14:58:51,962 INFO L276 IsEmpty]: Start isEmpty. Operand 24692 states and 74487 transitions. [2019-12-18 14:58:51,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 14:58:51,989 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:58:51,989 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:58:51,989 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-18 14:58:51,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:58:51,990 INFO L82 PathProgramCache]: Analyzing trace with hash -1159977158, now seen corresponding path program 6 times [2019-12-18 14:58:51,990 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:58:51,990 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839256709] [2019-12-18 14:58:51,990 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:58:52,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:58:52,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:58:52,319 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839256709] [2019-12-18 14:58:52,319 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:58:52,319 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 14:58:52,319 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792732615] [2019-12-18 14:58:52,320 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-18 14:58:52,320 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:58:52,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-18 14:58:52,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2019-12-18 14:58:52,320 INFO L87 Difference]: Start difference. First operand 24692 states and 74487 transitions. Second operand 15 states. [2019-12-18 14:58:56,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:58:56,045 INFO L93 Difference]: Finished difference Result 45267 states and 134915 transitions. [2019-12-18 14:58:56,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-12-18 14:58:56,046 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 54 [2019-12-18 14:58:56,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:58:56,093 INFO L225 Difference]: With dead ends: 45267 [2019-12-18 14:58:56,093 INFO L226 Difference]: Without dead ends: 32915 [2019-12-18 14:58:56,094 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 758 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=490, Invalid=2372, Unknown=0, NotChecked=0, Total=2862 [2019-12-18 14:58:56,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32915 states. [2019-12-18 14:58:56,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32915 to 18840. [2019-12-18 14:58:56,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18840 states. [2019-12-18 14:58:56,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18840 states to 18840 states and 56518 transitions. [2019-12-18 14:58:56,458 INFO L78 Accepts]: Start accepts. Automaton has 18840 states and 56518 transitions. Word has length 54 [2019-12-18 14:58:56,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:58:56,458 INFO L462 AbstractCegarLoop]: Abstraction has 18840 states and 56518 transitions. [2019-12-18 14:58:56,458 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-18 14:58:56,458 INFO L276 IsEmpty]: Start isEmpty. Operand 18840 states and 56518 transitions. [2019-12-18 14:58:56,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 14:58:56,478 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:58:56,478 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:58:56,478 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-18 14:58:56,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:58:56,478 INFO L82 PathProgramCache]: Analyzing trace with hash -1760218510, now seen corresponding path program 7 times [2019-12-18 14:58:56,478 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:58:56,479 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954698818] [2019-12-18 14:58:56,479 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:58:56,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:58:56,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:58:56,948 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954698818] [2019-12-18 14:58:56,949 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:58:56,949 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 14:58:56,949 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151630426] [2019-12-18 14:58:56,949 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 14:58:56,950 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:58:56,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 14:58:56,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2019-12-18 14:58:56,950 INFO L87 Difference]: Start difference. First operand 18840 states and 56518 transitions. Second operand 16 states. [2019-12-18 14:59:01,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:59:01,018 INFO L93 Difference]: Finished difference Result 35049 states and 104553 transitions. [2019-12-18 14:59:01,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-12-18 14:59:01,019 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 54 [2019-12-18 14:59:01,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:59:01,068 INFO L225 Difference]: With dead ends: 35049 [2019-12-18 14:59:01,068 INFO L226 Difference]: Without dead ends: 34615 [2019-12-18 14:59:01,069 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 750 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=434, Invalid=2428, Unknown=0, NotChecked=0, Total=2862 [2019-12-18 14:59:01,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34615 states. [2019-12-18 14:59:01,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34615 to 20730. [2019-12-18 14:59:01,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20730 states. [2019-12-18 14:59:01,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20730 states to 20730 states and 61975 transitions. [2019-12-18 14:59:01,795 INFO L78 Accepts]: Start accepts. Automaton has 20730 states and 61975 transitions. Word has length 54 [2019-12-18 14:59:01,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:59:01,795 INFO L462 AbstractCegarLoop]: Abstraction has 20730 states and 61975 transitions. [2019-12-18 14:59:01,796 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 14:59:01,796 INFO L276 IsEmpty]: Start isEmpty. Operand 20730 states and 61975 transitions. [2019-12-18 14:59:01,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 14:59:01,818 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:59:01,818 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:59:01,818 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-18 14:59:01,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:59:01,819 INFO L82 PathProgramCache]: Analyzing trace with hash 582073934, now seen corresponding path program 8 times [2019-12-18 14:59:01,819 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:59:01,819 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354517263] [2019-12-18 14:59:01,819 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:59:01,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:59:02,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:59:02,240 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354517263] [2019-12-18 14:59:02,241 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:59:02,241 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 14:59:02,241 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152217108] [2019-12-18 14:59:02,243 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 14:59:02,243 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:59:02,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 14:59:02,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2019-12-18 14:59:02,244 INFO L87 Difference]: Start difference. First operand 20730 states and 61975 transitions. Second operand 16 states. [2019-12-18 14:59:05,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:59:05,954 INFO L93 Difference]: Finished difference Result 35095 states and 104247 transitions. [2019-12-18 14:59:05,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-12-18 14:59:05,954 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 54 [2019-12-18 14:59:05,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:59:06,001 INFO L225 Difference]: With dead ends: 35095 [2019-12-18 14:59:06,001 INFO L226 Difference]: Without dead ends: 32873 [2019-12-18 14:59:06,002 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 677 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=449, Invalid=2203, Unknown=0, NotChecked=0, Total=2652 [2019-12-18 14:59:06,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32873 states. [2019-12-18 14:59:06,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32873 to 18834. [2019-12-18 14:59:06,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18834 states. [2019-12-18 14:59:06,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18834 states to 18834 states and 56512 transitions. [2019-12-18 14:59:06,364 INFO L78 Accepts]: Start accepts. Automaton has 18834 states and 56512 transitions. Word has length 54 [2019-12-18 14:59:06,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:59:06,364 INFO L462 AbstractCegarLoop]: Abstraction has 18834 states and 56512 transitions. [2019-12-18 14:59:06,364 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 14:59:06,364 INFO L276 IsEmpty]: Start isEmpty. Operand 18834 states and 56512 transitions. [2019-12-18 14:59:06,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 14:59:06,382 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:59:06,382 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:59:06,382 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-18 14:59:06,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:59:06,383 INFO L82 PathProgramCache]: Analyzing trace with hash 1391330862, now seen corresponding path program 9 times [2019-12-18 14:59:06,383 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:59:06,383 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574991839] [2019-12-18 14:59:06,383 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:59:06,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:59:06,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:59:06,497 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574991839] [2019-12-18 14:59:06,497 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:59:06,497 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 14:59:06,497 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042969365] [2019-12-18 14:59:06,498 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 14:59:06,498 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:59:06,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 14:59:06,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-18 14:59:06,498 INFO L87 Difference]: Start difference. First operand 18834 states and 56512 transitions. Second operand 9 states. [2019-12-18 14:59:07,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:59:07,633 INFO L93 Difference]: Finished difference Result 32437 states and 97011 transitions. [2019-12-18 14:59:07,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 14:59:07,633 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 54 [2019-12-18 14:59:07,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:59:07,670 INFO L225 Difference]: With dead ends: 32437 [2019-12-18 14:59:07,670 INFO L226 Difference]: Without dead ends: 26141 [2019-12-18 14:59:07,670 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2019-12-18 14:59:07,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26141 states. [2019-12-18 14:59:07,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26141 to 18764. [2019-12-18 14:59:07,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18764 states. [2019-12-18 14:59:07,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18764 states to 18764 states and 56195 transitions. [2019-12-18 14:59:07,986 INFO L78 Accepts]: Start accepts. Automaton has 18764 states and 56195 transitions. Word has length 54 [2019-12-18 14:59:07,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:59:07,986 INFO L462 AbstractCegarLoop]: Abstraction has 18764 states and 56195 transitions. [2019-12-18 14:59:07,986 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 14:59:07,987 INFO L276 IsEmpty]: Start isEmpty. Operand 18764 states and 56195 transitions. [2019-12-18 14:59:08,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 14:59:08,005 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:59:08,005 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:59:08,005 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:59:08,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:59:08,006 INFO L82 PathProgramCache]: Analyzing trace with hash 1687814112, now seen corresponding path program 10 times [2019-12-18 14:59:08,006 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:59:08,006 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246788453] [2019-12-18 14:59:08,006 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:59:08,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:59:08,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:59:08,195 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246788453] [2019-12-18 14:59:08,195 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:59:08,195 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 14:59:08,196 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526762957] [2019-12-18 14:59:08,197 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 14:59:08,197 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:59:08,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 14:59:08,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-12-18 14:59:08,198 INFO L87 Difference]: Start difference. First operand 18764 states and 56195 transitions. Second operand 11 states. [2019-12-18 14:59:11,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:59:11,178 INFO L93 Difference]: Finished difference Result 31907 states and 93136 transitions. [2019-12-18 14:59:11,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-12-18 14:59:11,179 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 54 [2019-12-18 14:59:11,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:59:11,225 INFO L225 Difference]: With dead ends: 31907 [2019-12-18 14:59:11,225 INFO L226 Difference]: Without dead ends: 31907 [2019-12-18 14:59:11,225 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=174, Invalid=818, Unknown=0, NotChecked=0, Total=992 [2019-12-18 14:59:11,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31907 states. [2019-12-18 14:59:11,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31907 to 20856. [2019-12-18 14:59:11,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20856 states. [2019-12-18 14:59:11,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20856 states to 20856 states and 61963 transitions. [2019-12-18 14:59:11,598 INFO L78 Accepts]: Start accepts. Automaton has 20856 states and 61963 transitions. Word has length 54 [2019-12-18 14:59:11,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:59:11,599 INFO L462 AbstractCegarLoop]: Abstraction has 20856 states and 61963 transitions. [2019-12-18 14:59:11,599 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 14:59:11,599 INFO L276 IsEmpty]: Start isEmpty. Operand 20856 states and 61963 transitions. [2019-12-18 14:59:11,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 14:59:11,619 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:59:11,619 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:59:11,619 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:59:11,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:59:11,619 INFO L82 PathProgramCache]: Analyzing trace with hash 1451766760, now seen corresponding path program 11 times [2019-12-18 14:59:11,620 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:59:11,620 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723837272] [2019-12-18 14:59:11,620 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:59:11,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:59:11,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:59:11,829 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723837272] [2019-12-18 14:59:11,829 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:59:11,829 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-18 14:59:11,829 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445357527] [2019-12-18 14:59:11,830 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 14:59:11,830 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:59:11,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 14:59:11,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2019-12-18 14:59:11,831 INFO L87 Difference]: Start difference. First operand 20856 states and 61963 transitions. Second operand 12 states. [2019-12-18 14:59:14,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:59:14,248 INFO L93 Difference]: Finished difference Result 31452 states and 91546 transitions. [2019-12-18 14:59:14,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-18 14:59:14,248 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 54 [2019-12-18 14:59:14,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:59:14,291 INFO L225 Difference]: With dead ends: 31452 [2019-12-18 14:59:14,292 INFO L226 Difference]: Without dead ends: 31452 [2019-12-18 14:59:14,292 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=135, Invalid=621, Unknown=0, NotChecked=0, Total=756 [2019-12-18 14:59:14,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31452 states. [2019-12-18 14:59:14,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31452 to 20655. [2019-12-18 14:59:14,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20655 states. [2019-12-18 14:59:14,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20655 states to 20655 states and 61527 transitions. [2019-12-18 14:59:14,671 INFO L78 Accepts]: Start accepts. Automaton has 20655 states and 61527 transitions. Word has length 54 [2019-12-18 14:59:14,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:59:14,671 INFO L462 AbstractCegarLoop]: Abstraction has 20655 states and 61527 transitions. [2019-12-18 14:59:14,671 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 14:59:14,671 INFO L276 IsEmpty]: Start isEmpty. Operand 20655 states and 61527 transitions. [2019-12-18 14:59:14,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 14:59:14,692 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:59:14,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] [2019-12-18 14:59:14,692 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:59:14,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:59:14,693 INFO L82 PathProgramCache]: Analyzing trace with hash -1496564564, now seen corresponding path program 12 times [2019-12-18 14:59:14,693 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:59:14,693 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050539088] [2019-12-18 14:59:14,693 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:59:14,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:59:15,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:59:15,228 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050539088] [2019-12-18 14:59:15,228 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:59:15,228 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-12-18 14:59:15,228 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671786424] [2019-12-18 14:59:15,229 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-18 14:59:15,229 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:59:15,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-18 14:59:15,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2019-12-18 14:59:15,229 INFO L87 Difference]: Start difference. First operand 20655 states and 61527 transitions. Second operand 18 states. [2019-12-18 14:59:19,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:59:19,598 INFO L93 Difference]: Finished difference Result 26221 states and 78907 transitions. [2019-12-18 14:59:19,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-12-18 14:59:19,598 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 54 [2019-12-18 14:59:19,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:59:19,634 INFO L225 Difference]: With dead ends: 26221 [2019-12-18 14:59:19,634 INFO L226 Difference]: Without dead ends: 25291 [2019-12-18 14:59:19,635 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 593 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=350, Invalid=2200, Unknown=0, NotChecked=0, Total=2550 [2019-12-18 14:59:19,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25291 states. [2019-12-18 14:59:19,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25291 to 21572. [2019-12-18 14:59:19,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21572 states. [2019-12-18 14:59:19,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21572 states to 21572 states and 64361 transitions. [2019-12-18 14:59:19,979 INFO L78 Accepts]: Start accepts. Automaton has 21572 states and 64361 transitions. Word has length 54 [2019-12-18 14:59:19,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:59:19,979 INFO L462 AbstractCegarLoop]: Abstraction has 21572 states and 64361 transitions. [2019-12-18 14:59:19,979 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-18 14:59:19,979 INFO L276 IsEmpty]: Start isEmpty. Operand 21572 states and 64361 transitions. [2019-12-18 14:59:20,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 14:59:20,003 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:59:20,003 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:59:20,003 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:59:20,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:59:20,003 INFO L82 PathProgramCache]: Analyzing trace with hash 845727880, now seen corresponding path program 13 times [2019-12-18 14:59:20,004 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:59:20,004 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325866974] [2019-12-18 14:59:20,004 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:59:20,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:59:20,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:59:20,454 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325866974] [2019-12-18 14:59:20,454 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:59:20,455 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-18 14:59:20,455 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759964154] [2019-12-18 14:59:20,455 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-18 14:59:20,455 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:59:20,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-18 14:59:20,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2019-12-18 14:59:20,456 INFO L87 Difference]: Start difference. First operand 21572 states and 64361 transitions. Second operand 17 states. [2019-12-18 14:59:23,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:59:23,995 INFO L93 Difference]: Finished difference Result 25589 states and 76778 transitions. [2019-12-18 14:59:23,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-12-18 14:59:23,996 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 54 [2019-12-18 14:59:23,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:59:24,031 INFO L225 Difference]: With dead ends: 25589 [2019-12-18 14:59:24,031 INFO L226 Difference]: Without dead ends: 24663 [2019-12-18 14:59:24,032 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 345 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=254, Invalid=1386, Unknown=0, NotChecked=0, Total=1640 [2019-12-18 14:59:24,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24663 states. [2019-12-18 14:59:24,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24663 to 20936. [2019-12-18 14:59:24,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20936 states. [2019-12-18 14:59:24,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20936 states to 20936 states and 62298 transitions. [2019-12-18 14:59:24,370 INFO L78 Accepts]: Start accepts. Automaton has 20936 states and 62298 transitions. Word has length 54 [2019-12-18 14:59:24,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:59:24,370 INFO L462 AbstractCegarLoop]: Abstraction has 20936 states and 62298 transitions. [2019-12-18 14:59:24,370 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-18 14:59:24,370 INFO L276 IsEmpty]: Start isEmpty. Operand 20936 states and 62298 transitions. [2019-12-18 14:59:24,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 14:59:24,393 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:59:24,393 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:59:24,394 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:59:24,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:59:24,394 INFO L82 PathProgramCache]: Analyzing trace with hash -81642772, now seen corresponding path program 14 times [2019-12-18 14:59:24,394 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:59:24,394 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935885245] [2019-12-18 14:59:24,394 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:59:24,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:59:24,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:59:24,608 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935885245] [2019-12-18 14:59:24,608 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:59:24,608 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 14:59:24,609 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675584765] [2019-12-18 14:59:24,609 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 14:59:24,609 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:59:24,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 14:59:24,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 14:59:24,610 INFO L87 Difference]: Start difference. First operand 20936 states and 62298 transitions. Second operand 11 states. [2019-12-18 14:59:26,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:59:26,240 INFO L93 Difference]: Finished difference Result 36888 states and 110061 transitions. [2019-12-18 14:59:26,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-18 14:59:26,240 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 54 [2019-12-18 14:59:26,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:59:26,289 INFO L225 Difference]: With dead ends: 36888 [2019-12-18 14:59:26,290 INFO L226 Difference]: Without dead ends: 35802 [2019-12-18 14:59:26,290 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=165, Invalid=705, Unknown=0, NotChecked=0, Total=870 [2019-12-18 14:59:26,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35802 states. [2019-12-18 14:59:26,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35802 to 23793. [2019-12-18 14:59:26,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23793 states. [2019-12-18 14:59:26,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23793 states to 23793 states and 70601 transitions. [2019-12-18 14:59:26,739 INFO L78 Accepts]: Start accepts. Automaton has 23793 states and 70601 transitions. Word has length 54 [2019-12-18 14:59:26,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:59:26,739 INFO L462 AbstractCegarLoop]: Abstraction has 23793 states and 70601 transitions. [2019-12-18 14:59:26,739 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 14:59:26,740 INFO L276 IsEmpty]: Start isEmpty. Operand 23793 states and 70601 transitions. [2019-12-18 14:59:26,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 14:59:26,769 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:59:26,769 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:59:26,770 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:59:26,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:59:26,770 INFO L82 PathProgramCache]: Analyzing trace with hash -2034317624, now seen corresponding path program 15 times [2019-12-18 14:59:26,770 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:59:26,770 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391368279] [2019-12-18 14:59:26,770 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:59:26,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:59:26,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:59:26,951 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391368279] [2019-12-18 14:59:26,951 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:59:26,951 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 14:59:26,951 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279676271] [2019-12-18 14:59:26,951 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 14:59:26,951 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:59:26,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 14:59:26,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 14:59:26,952 INFO L87 Difference]: Start difference. First operand 23793 states and 70601 transitions. Second operand 11 states. [2019-12-18 14:59:27,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:59:27,790 INFO L93 Difference]: Finished difference Result 36291 states and 107724 transitions. [2019-12-18 14:59:27,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-18 14:59:27,791 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 54 [2019-12-18 14:59:27,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:59:27,834 INFO L225 Difference]: With dead ends: 36291 [2019-12-18 14:59:27,834 INFO L226 Difference]: Without dead ends: 30290 [2019-12-18 14:59:27,834 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=438, Unknown=0, NotChecked=0, Total=552 [2019-12-18 14:59:27,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30290 states. [2019-12-18 14:59:28,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30290 to 19443. [2019-12-18 14:59:28,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19443 states. [2019-12-18 14:59:28,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19443 states to 19443 states and 58166 transitions. [2019-12-18 14:59:28,196 INFO L78 Accepts]: Start accepts. Automaton has 19443 states and 58166 transitions. Word has length 54 [2019-12-18 14:59:28,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:59:28,197 INFO L462 AbstractCegarLoop]: Abstraction has 19443 states and 58166 transitions. [2019-12-18 14:59:28,197 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 14:59:28,197 INFO L276 IsEmpty]: Start isEmpty. Operand 19443 states and 58166 transitions. [2019-12-18 14:59:28,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 14:59:28,216 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:59:28,216 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:59:28,216 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:59:28,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:59:28,217 INFO L82 PathProgramCache]: Analyzing trace with hash -139497916, now seen corresponding path program 16 times [2019-12-18 14:59:28,217 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:59:28,217 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016680910] [2019-12-18 14:59:28,217 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:59:28,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:59:28,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:59:28,266 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016680910] [2019-12-18 14:59:28,266 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:59:28,266 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:59:28,267 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372576261] [2019-12-18 14:59:28,267 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:59:28,267 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:59:28,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:59:28,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:59:28,268 INFO L87 Difference]: Start difference. First operand 19443 states and 58166 transitions. Second operand 3 states. [2019-12-18 14:59:28,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:59:28,348 INFO L93 Difference]: Finished difference Result 19441 states and 58161 transitions. [2019-12-18 14:59:28,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:59:28,348 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-12-18 14:59:28,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:59:28,390 INFO L225 Difference]: With dead ends: 19441 [2019-12-18 14:59:28,391 INFO L226 Difference]: Without dead ends: 19441 [2019-12-18 14:59:28,391 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:59:28,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19441 states. [2019-12-18 14:59:28,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19441 to 17381. [2019-12-18 14:59:28,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17381 states. [2019-12-18 14:59:28,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17381 states to 17381 states and 52561 transitions. [2019-12-18 14:59:28,851 INFO L78 Accepts]: Start accepts. Automaton has 17381 states and 52561 transitions. Word has length 54 [2019-12-18 14:59:28,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:59:28,851 INFO L462 AbstractCegarLoop]: Abstraction has 17381 states and 52561 transitions. [2019-12-18 14:59:28,851 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:59:28,851 INFO L276 IsEmpty]: Start isEmpty. Operand 17381 states and 52561 transitions. [2019-12-18 14:59:28,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 14:59:28,879 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:59:28,879 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-18 14:59:28,879 INFO L410 AbstractCegarLoop]: === Iteration 33 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:59:28,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:59:28,880 INFO L82 PathProgramCache]: Analyzing trace with hash -1678920401, now seen corresponding path program 1 times [2019-12-18 14:59:28,880 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:59:28,880 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366970539] [2019-12-18 14:59:28,880 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:59:28,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 14:59:28,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 14:59:29,025 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 14:59:29,025 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 14:59:29,031 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [810] [810] ULTIMATE.startENTRY-->L820: Formula: (let ((.cse0 (store |v_#valid_61| 0 0))) (and (= 0 v_~x$read_delayed_var~0.base_6) (= 0 v_~x$read_delayed_var~0.offset_6) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t2354~0.base_24|)) (= 0 v_~x$w_buff1_used~0_531) (= v_~x$r_buff0_thd1~0_337 0) (= |v_#NULL.offset_6| 0) (= 0 v_~x$w_buff1~0_304) (= 0 v_~x$r_buff1_thd3~0_123) (< 0 |v_#StackHeapBarrier_16|) (= v_~y~0_70 0) (= 0 |v_ULTIMATE.start_main_~#t2354~0.offset_18|) (= v_~x$mem_tmp~0_42 0) (= v_~z~0_50 0) (= 0 v_~x$r_buff0_thd2~0_165) (= v_~x$r_buff1_thd1~0_232 0) (< |v_#StackHeapBarrier_16| |v_ULTIMATE.start_main_~#t2354~0.base_24|) (= 0 v_~x$r_buff0_thd3~0_134) (= 0 v_~x$read_delayed~0_6) (= 0 |v_#NULL.base_6|) (= 0 v_~__unbuffered_p2_EAX~0_49) (= 0 v_~x$r_buff1_thd2~0_115) (= v_~x$r_buff0_thd0~0_141 0) (= v_~main$tmp_guard0~0_21 0) (= |v_#valid_59| (store .cse0 |v_ULTIMATE.start_main_~#t2354~0.base_24| 1)) (= v_~__unbuffered_p2_EBX~0_49 0) (= 0 v_~x~0_214) (= v_~__unbuffered_cnt~0_139 0) (= 0 v_~x$w_buff0~0_515) (= v_~weak$$choice2~0_149 0) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2354~0.base_24| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2354~0.base_24|) |v_ULTIMATE.start_main_~#t2354~0.offset_18| 0)) |v_#memory_int_23|) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t2354~0.base_24| 4)) (= v_~x$flush_delayed~0_77 0) (= 0 v_~weak$$choice0~0_34) (= 0 v_~__unbuffered_p0_EAX~0_48) (= v_~x$r_buff1_thd0~0_132 0) (= 0 v_~x$w_buff0_used~0_899) (= v_~main$tmp_guard1~0_40 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_16|, #valid=|v_#valid_61|, #memory_int=|v_#memory_int_24|, #length=|v_#length_24|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_515, ~x$flush_delayed~0=v_~x$flush_delayed~0_77, #NULL.offset=|v_#NULL.offset_6|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_232, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_134, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_44|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_34|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_48, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_49, ULTIMATE.start_main_~#t2355~0.offset=|v_ULTIMATE.start_main_~#t2355~0.offset_19|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_141, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_49, ~x$w_buff1~0=v_~x$w_buff1~0_304, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_531, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_115, ULTIMATE.start_main_~#t2354~0.offset=|v_ULTIMATE.start_main_~#t2354~0.offset_18|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_6, ~weak$$choice0~0=v_~weak$$choice0~0_34, ULTIMATE.start_main_~#t2354~0.base=|v_ULTIMATE.start_main_~#t2354~0.base_24|, #StackHeapBarrier=|v_#StackHeapBarrier_16|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_139, ~x~0=v_~x~0_214, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_337, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_82|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_123, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_40, ~x$mem_tmp~0=v_~x$mem_tmp~0_42, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_68|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_38|, ULTIMATE.start_main_~#t2356~0.offset=|v_ULTIMATE.start_main_~#t2356~0.offset_19|, ULTIMATE.start_main_~#t2355~0.base=|v_ULTIMATE.start_main_~#t2355~0.base_26|, ~y~0=v_~y~0_70, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_20|, ULTIMATE.start_main_~#t2356~0.base=|v_ULTIMATE.start_main_~#t2356~0.base_26|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_21, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_132, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_165, #NULL.base=|v_#NULL.base_6|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_899, 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_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_25|, #valid=|v_#valid_59|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_8|, ~z~0=v_~z~0_50, ~weak$$choice2~0=v_~weak$$choice2~0_149, ~x$read_delayed~0=v_~x$read_delayed~0_6} 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, ULTIMATE.start_main_~#t2355~0.offset, ~x$r_buff0_thd0~0, ~__unbuffered_p2_EBX~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_~#t2354~0.offset, ~x$read_delayed_var~0.base, ~weak$$choice0~0, ULTIMATE.start_main_~#t2354~0.base, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ~x~0, ~x$r_buff0_thd1~0, 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, ULTIMATE.start_main_~#t2356~0.offset, ULTIMATE.start_main_~#t2355~0.base, ~y~0, ULTIMATE.start_main_#t~nondet40, ULTIMATE.start_main_~#t2356~0.base, ~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_#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-18 14:59:29,032 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [783] [783] L820-1-->L822: Formula: (and (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2355~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2355~0.base_13|) |v_ULTIMATE.start_main_~#t2355~0.offset_11| 1)) |v_#memory_int_15|) (= 0 (select |v_#valid_37| |v_ULTIMATE.start_main_~#t2355~0.base_13|)) (not (= |v_ULTIMATE.start_main_~#t2355~0.base_13| 0)) (= |v_#valid_36| (store |v_#valid_37| |v_ULTIMATE.start_main_~#t2355~0.base_13| 1)) (= 0 |v_ULTIMATE.start_main_~#t2355~0.offset_11|) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t2355~0.base_13| 4) |v_#length_15|) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t2355~0.base_13|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, ULTIMATE.start_main_~#t2355~0.base=|v_ULTIMATE.start_main_~#t2355~0.base_13|, #length=|v_#length_15|, ULTIMATE.start_main_~#t2355~0.offset=|v_ULTIMATE.start_main_~#t2355~0.offset_11|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_#t~nondet38, ULTIMATE.start_main_~#t2355~0.base, #length, ULTIMATE.start_main_~#t2355~0.offset] because there is no mapped edge [2019-12-18 14:59:29,033 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [785] [785] L822-1-->L824: Formula: (and (= 0 |v_ULTIMATE.start_main_~#t2356~0.offset_11|) (= 0 (select |v_#valid_39| |v_ULTIMATE.start_main_~#t2356~0.base_13|)) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t2356~0.base_13| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t2356~0.base_13|) |v_ULTIMATE.start_main_~#t2356~0.offset_11| 2)) |v_#memory_int_17|) (= (store |v_#valid_39| |v_ULTIMATE.start_main_~#t2356~0.base_13| 1) |v_#valid_38|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t2356~0.base_13| 4)) (not (= 0 |v_ULTIMATE.start_main_~#t2356~0.base_13|)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t2356~0.base_13|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t2356~0.base=|v_ULTIMATE.start_main_~#t2356~0.base_13|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_17|, #length=|v_#length_17|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_5|, ULTIMATE.start_main_~#t2356~0.offset=|v_ULTIMATE.start_main_~#t2356~0.offset_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2356~0.base, #valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet39, ULTIMATE.start_main_~#t2356~0.offset] because there is no mapped edge [2019-12-18 14:59:29,033 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [791] [791] P1ENTRY-->L5-3: Formula: (and (= ~x$w_buff0_used~0_In-270468560 ~x$w_buff1_used~0_Out-270468560) (= ~x$w_buff0_used~0_Out-270468560 1) (= P1Thread1of1ForFork0_~arg.base_Out-270468560 |P1Thread1of1ForFork0_#in~arg.base_In-270468560|) (= P1Thread1of1ForFork0___VERIFIER_assert_~expression_Out-270468560 |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-270468560|) (= P1Thread1of1ForFork0_~arg.offset_Out-270468560 |P1Thread1of1ForFork0_#in~arg.offset_In-270468560|) (= ~x$w_buff1~0_Out-270468560 ~x$w_buff0~0_In-270468560) (= ~x$w_buff0~0_Out-270468560 1) (= 1 |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-270468560|) (= 0 (mod ~x$w_buff1_used~0_Out-270468560 256))) InVars {~x$w_buff0~0=~x$w_buff0~0_In-270468560, P1Thread1of1ForFork0_#in~arg.base=|P1Thread1of1ForFork0_#in~arg.base_In-270468560|, P1Thread1of1ForFork0_#in~arg.offset=|P1Thread1of1ForFork0_#in~arg.offset_In-270468560|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-270468560} OutVars{~x$w_buff0~0=~x$w_buff0~0_Out-270468560, P1Thread1of1ForFork0___VERIFIER_assert_~expression=P1Thread1of1ForFork0___VERIFIER_assert_~expression_Out-270468560, P1Thread1of1ForFork0_~arg.offset=P1Thread1of1ForFork0_~arg.offset_Out-270468560, P1Thread1of1ForFork0_~arg.base=P1Thread1of1ForFork0_~arg.base_Out-270468560, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression=|P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-270468560|, P1Thread1of1ForFork0_#in~arg.base=|P1Thread1of1ForFork0_#in~arg.base_In-270468560|, ~x$w_buff1~0=~x$w_buff1~0_Out-270468560, P1Thread1of1ForFork0_#in~arg.offset=|P1Thread1of1ForFork0_#in~arg.offset_In-270468560|, ~x$w_buff1_used~0=~x$w_buff1_used~0_Out-270468560, ~x$w_buff0_used~0=~x$w_buff0_used~0_Out-270468560} 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-18 14:59:29,040 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [741] [741] L797-2-->L797-4: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff1_used~0_In960216490 256))) (.cse1 (= 0 (mod ~x$r_buff1_thd3~0_In960216490 256)))) (or (and (not .cse0) (= ~x$w_buff1~0_In960216490 |P2Thread1of1ForFork1_#t~ite32_Out960216490|) (not .cse1)) (and (or .cse0 .cse1) (= ~x~0_In960216490 |P2Thread1of1ForFork1_#t~ite32_Out960216490|)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In960216490, ~x$w_buff1_used~0=~x$w_buff1_used~0_In960216490, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In960216490, ~x~0=~x~0_In960216490} OutVars{P2Thread1of1ForFork1_#t~ite32=|P2Thread1of1ForFork1_#t~ite32_Out960216490|, ~x$w_buff1~0=~x$w_buff1~0_In960216490, ~x$w_buff1_used~0=~x$w_buff1_used~0_In960216490, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In960216490, ~x~0=~x~0_In960216490} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-18 14:59:29,040 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L797-4-->L798: Formula: (= v_~x~0_64 |v_P2Thread1of1ForFork1_#t~ite32_22|) InVars {P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_22|} OutVars{P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_21|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_29|, ~x~0=v_~x~0_64} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite33, ~x~0] because there is no mapped edge [2019-12-18 14:59:29,040 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [759] [759] L798-->L798-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd3~0_In1378680829 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In1378680829 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork1_#t~ite34_Out1378680829|)) (and (= ~x$w_buff0_used~0_In1378680829 |P2Thread1of1ForFork1_#t~ite34_Out1378680829|) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1378680829, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1378680829} OutVars{P2Thread1of1ForFork1_#t~ite34=|P2Thread1of1ForFork1_#t~ite34_Out1378680829|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1378680829, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1378680829} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-18 14:59:29,044 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] L778-->L778-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In1226149322 256))) (.cse0 (= (mod ~x$r_buff0_thd2~0_In1226149322 256) 0))) (or (and (not .cse0) (= |P1Thread1of1ForFork0_#t~ite28_Out1226149322| 0) (not .cse1)) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork0_#t~ite28_Out1226149322| ~x$w_buff0_used~0_In1226149322)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1226149322, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1226149322} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1226149322, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out1226149322|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1226149322} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-18 14:59:29,044 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] L779-->L779-2: Formula: (let ((.cse2 (= (mod ~x$w_buff1_used~0_In-760205016 256) 0)) (.cse3 (= 0 (mod ~x$r_buff1_thd2~0_In-760205016 256))) (.cse0 (= (mod ~x$r_buff0_thd2~0_In-760205016 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In-760205016 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork0_#t~ite29_Out-760205016| ~x$w_buff1_used~0_In-760205016) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= |P1Thread1of1ForFork0_#t~ite29_Out-760205016| 0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-760205016, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-760205016, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-760205016, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-760205016} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-760205016, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-760205016, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-760205016, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out-760205016|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-760205016} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-18 14:59:29,045 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L780-->L781: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In195529679 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In195529679 256)))) (or (and (or .cse0 .cse1) (= ~x$r_buff0_thd2~0_Out195529679 ~x$r_buff0_thd2~0_In195529679)) (and (not .cse0) (= ~x$r_buff0_thd2~0_Out195529679 0) (not .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In195529679, ~x$w_buff0_used~0=~x$w_buff0_used~0_In195529679} OutVars{P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out195529679|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out195529679, ~x$w_buff0_used~0=~x$w_buff0_used~0_In195529679} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-18 14:59:29,045 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L781-->L781-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In-239758123 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-239758123 256))) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In-239758123 256))) (.cse2 (= (mod ~x$r_buff1_thd2~0_In-239758123 256) 0))) (or (and (or .cse0 .cse1) (= ~x$r_buff1_thd2~0_In-239758123 |P1Thread1of1ForFork0_#t~ite31_Out-239758123|) (or .cse2 .cse3)) (and (= 0 |P1Thread1of1ForFork0_#t~ite31_Out-239758123|) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-239758123, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-239758123, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-239758123, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-239758123} OutVars{P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out-239758123|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-239758123, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-239758123, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-239758123, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-239758123} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-18 14:59:29,045 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L781-2-->P1EXIT: Formula: (and (= v_~x$r_buff1_thd2~0_55 |v_P1Thread1of1ForFork0_#t~ite31_38|) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|) (= v_~__unbuffered_cnt~0_67 (+ v_~__unbuffered_cnt~0_68 1))) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_38|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_68} OutVars{P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_37|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_55, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_67, 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-18 14:59:29,047 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [790] [790] L743-->L743-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-2117284021 256)))) (or (and .cse0 (= ~x$w_buff1~0_In-2117284021 |P0Thread1of1ForFork2_#t~ite11_Out-2117284021|) (let ((.cse1 (= (mod ~x$r_buff0_thd1~0_In-2117284021 256) 0))) (or (and .cse1 (= 0 (mod ~x$r_buff1_thd1~0_In-2117284021 256))) (= (mod ~x$w_buff0_used~0_In-2117284021 256) 0) (and .cse1 (= 0 (mod ~x$w_buff1_used~0_In-2117284021 256))))) (= |P0Thread1of1ForFork2_#t~ite12_Out-2117284021| |P0Thread1of1ForFork2_#t~ite11_Out-2117284021|)) (and (not .cse0) (= ~x$w_buff1~0_In-2117284021 |P0Thread1of1ForFork2_#t~ite12_Out-2117284021|) (= |P0Thread1of1ForFork2_#t~ite11_In-2117284021| |P0Thread1of1ForFork2_#t~ite11_Out-2117284021|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-2117284021, ~x$w_buff1~0=~x$w_buff1~0_In-2117284021, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2117284021, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-2117284021, ~weak$$choice2~0=~weak$$choice2~0_In-2117284021, P0Thread1of1ForFork2_#t~ite11=|P0Thread1of1ForFork2_#t~ite11_In-2117284021|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2117284021} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-2117284021, ~x$w_buff1~0=~x$w_buff1~0_In-2117284021, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2117284021, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-2117284021, ~weak$$choice2~0=~weak$$choice2~0_In-2117284021, P0Thread1of1ForFork2_#t~ite12=|P0Thread1of1ForFork2_#t~ite12_Out-2117284021|, P0Thread1of1ForFork2_#t~ite11=|P0Thread1of1ForFork2_#t~ite11_Out-2117284021|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2117284021} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite12, P0Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-18 14:59:29,048 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [792] [792] L744-->L744-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1806322828 256) 0))) (or (and (= ~x$w_buff0_used~0_In1806322828 |P0Thread1of1ForFork2_#t~ite15_Out1806322828|) (not .cse0) (= |P0Thread1of1ForFork2_#t~ite14_In1806322828| |P0Thread1of1ForFork2_#t~ite14_Out1806322828|)) (and .cse0 (= ~x$w_buff0_used~0_In1806322828 |P0Thread1of1ForFork2_#t~ite14_Out1806322828|) (let ((.cse1 (= (mod ~x$r_buff0_thd1~0_In1806322828 256) 0))) (or (= (mod ~x$w_buff0_used~0_In1806322828 256) 0) (and .cse1 (= 0 (mod ~x$w_buff1_used~0_In1806322828 256))) (and .cse1 (= 0 (mod ~x$r_buff1_thd1~0_In1806322828 256))))) (= |P0Thread1of1ForFork2_#t~ite14_Out1806322828| |P0Thread1of1ForFork2_#t~ite15_Out1806322828|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1806322828, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1806322828, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1806322828, P0Thread1of1ForFork2_#t~ite14=|P0Thread1of1ForFork2_#t~ite14_In1806322828|, ~weak$$choice2~0=~weak$$choice2~0_In1806322828, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1806322828} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1806322828, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1806322828, P0Thread1of1ForFork2_#t~ite15=|P0Thread1of1ForFork2_#t~ite15_Out1806322828|, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1806322828, P0Thread1of1ForFork2_#t~ite14=|P0Thread1of1ForFork2_#t~ite14_Out1806322828|, ~weak$$choice2~0=~weak$$choice2~0_In1806322828, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1806322828} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite15, P0Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-18 14:59:29,050 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L745-->L745-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1584682997 256) 0))) (or (and (= ~x$w_buff1_used~0_In-1584682997 |P0Thread1of1ForFork2_#t~ite18_Out-1584682997|) (not .cse0) (= |P0Thread1of1ForFork2_#t~ite17_In-1584682997| |P0Thread1of1ForFork2_#t~ite17_Out-1584682997|)) (and (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In-1584682997 256)))) (or (= (mod ~x$w_buff0_used~0_In-1584682997 256) 0) (and (= 0 (mod ~x$w_buff1_used~0_In-1584682997 256)) .cse1) (and .cse1 (= (mod ~x$r_buff1_thd1~0_In-1584682997 256) 0)))) .cse0 (= ~x$w_buff1_used~0_In-1584682997 |P0Thread1of1ForFork2_#t~ite17_Out-1584682997|) (= |P0Thread1of1ForFork2_#t~ite18_Out-1584682997| |P0Thread1of1ForFork2_#t~ite17_Out-1584682997|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1584682997, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_In-1584682997|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1584682997, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1584682997, ~weak$$choice2~0=~weak$$choice2~0_In-1584682997, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1584682997} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1584682997, P0Thread1of1ForFork2_#t~ite18=|P0Thread1of1ForFork2_#t~ite18_Out-1584682997|, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_Out-1584682997|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1584682997, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1584682997, ~weak$$choice2~0=~weak$$choice2~0_In-1584682997, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1584682997} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite18, P0Thread1of1ForFork2_#t~ite17] because there is no mapped edge [2019-12-18 14:59:29,051 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [804] [804] L746-->L747-8: Formula: (and (= |v_P0Thread1of1ForFork2_#t~ite23_39| |v_P0Thread1of1ForFork2_#t~ite23_40|) (= v_~x$r_buff1_thd1~0_214 |v_P0Thread1of1ForFork2_#t~ite24_35|) (= v_~x$r_buff0_thd1~0_321 v_~x$r_buff0_thd1~0_320) (not (= 0 (mod v_~weak$$choice2~0_142 256))) (= |v_P0Thread1of1ForFork2_#t~ite22_36| |v_P0Thread1of1ForFork2_#t~ite22_35|)) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_321, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_214, ~weak$$choice2~0=v_~weak$$choice2~0_142, P0Thread1of1ForFork2_#t~ite23=|v_P0Thread1of1ForFork2_#t~ite23_40|, P0Thread1of1ForFork2_#t~ite22=|v_P0Thread1of1ForFork2_#t~ite22_36|} OutVars{P0Thread1of1ForFork2_#t~ite20=|v_P0Thread1of1ForFork2_#t~ite20_31|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_320, P0Thread1of1ForFork2_#t~ite19=|v_P0Thread1of1ForFork2_#t~ite19_27|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_214, P0Thread1of1ForFork2_#t~ite24=|v_P0Thread1of1ForFork2_#t~ite24_35|, ~weak$$choice2~0=v_~weak$$choice2~0_142, P0Thread1of1ForFork2_#t~ite23=|v_P0Thread1of1ForFork2_#t~ite23_39|, P0Thread1of1ForFork2_#t~ite22=|v_P0Thread1of1ForFork2_#t~ite22_35|, P0Thread1of1ForFork2_#t~ite21=|v_P0Thread1of1ForFork2_#t~ite21_15|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite20, ~x$r_buff0_thd1~0, P0Thread1of1ForFork2_#t~ite19, P0Thread1of1ForFork2_#t~ite24, P0Thread1of1ForFork2_#t~ite23, P0Thread1of1ForFork2_#t~ite22, P0Thread1of1ForFork2_#t~ite21] because there is no mapped edge [2019-12-18 14:59:29,052 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L749-->L757: Formula: (and (= v_~x~0_54 v_~x$mem_tmp~0_11) (not (= 0 (mod v_~x$flush_delayed~0_20 256))) (= (+ v_~__unbuffered_cnt~0_42 1) v_~__unbuffered_cnt~0_41) (= v_~x$flush_delayed~0_19 0)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_20, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_42, ~x$mem_tmp~0=v_~x$mem_tmp~0_11} OutVars{P0Thread1of1ForFork2_#t~ite25=|v_P0Thread1of1ForFork2_#t~ite25_19|, ~x$flush_delayed~0=v_~x$flush_delayed~0_19, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_41, ~x$mem_tmp~0=v_~x$mem_tmp~0_11, ~x~0=v_~x~0_54} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite25, ~x$flush_delayed~0, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-18 14:59:29,054 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L799-->L799-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd3~0_In2115237606 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In2115237606 256))) (.cse3 (= (mod ~x$r_buff1_thd3~0_In2115237606 256) 0)) (.cse2 (= (mod ~x$w_buff1_used~0_In2115237606 256) 0))) (or (and (or .cse0 .cse1) (= ~x$w_buff1_used~0_In2115237606 |P2Thread1of1ForFork1_#t~ite35_Out2115237606|) (or .cse2 .cse3)) (and (= 0 |P2Thread1of1ForFork1_#t~ite35_Out2115237606|) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In2115237606, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In2115237606, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In2115237606, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2115237606} OutVars{P2Thread1of1ForFork1_#t~ite35=|P2Thread1of1ForFork1_#t~ite35_Out2115237606|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2115237606, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In2115237606, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In2115237606, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2115237606} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-18 14:59:29,055 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L800-->L800-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd3~0_In1363277609 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In1363277609 256)))) (or (and (not .cse0) (= 0 |P2Thread1of1ForFork1_#t~ite36_Out1363277609|) (not .cse1)) (and (= ~x$r_buff0_thd3~0_In1363277609 |P2Thread1of1ForFork1_#t~ite36_Out1363277609|) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1363277609, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1363277609} OutVars{P2Thread1of1ForFork1_#t~ite36=|P2Thread1of1ForFork1_#t~ite36_Out1363277609|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1363277609, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1363277609} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-18 14:59:29,056 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L801-->L801-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd3~0_In-376520527 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In-376520527 256) 0)) (.cse3 (= (mod ~x$w_buff1_used~0_In-376520527 256) 0)) (.cse2 (= 0 (mod ~x$r_buff1_thd3~0_In-376520527 256)))) (or (and (= 0 |P2Thread1of1ForFork1_#t~ite37_Out-376520527|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= |P2Thread1of1ForFork1_#t~ite37_Out-376520527| ~x$r_buff1_thd3~0_In-376520527) (or .cse3 .cse2)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-376520527, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-376520527, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-376520527, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-376520527} OutVars{P2Thread1of1ForFork1_#t~ite37=|P2Thread1of1ForFork1_#t~ite37_Out-376520527|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-376520527, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-376520527, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-376520527, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-376520527} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-18 14:59:29,056 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L801-2-->P2EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_85 1) v_~__unbuffered_cnt~0_84) (= 0 |v_P2Thread1of1ForFork1_#res.offset_5|) (= v_~x$r_buff1_thd3~0_72 |v_P2Thread1of1ForFork1_#t~ite37_40|) (= 0 |v_P2Thread1of1ForFork1_#res.base_5|)) InVars {P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_40|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_85} OutVars{P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_39|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_5|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_72, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_84, 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-18 14:59:29,057 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L824-1-->L830: Formula: (and (= 3 v_~__unbuffered_cnt~0_39) (= v_~main$tmp_guard0~0_8 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39} OutVars{ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet40, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 14:59:29,058 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L830-2-->L830-4: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff1_used~0_In-102096705 256))) (.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In-102096705 256)))) (or (and (not .cse0) (= ~x$w_buff1~0_In-102096705 |ULTIMATE.start_main_#t~ite41_Out-102096705|) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite41_Out-102096705| ~x~0_In-102096705) (or .cse1 .cse0)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-102096705, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-102096705, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-102096705, ~x~0=~x~0_In-102096705} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out-102096705|, ~x$w_buff1~0=~x$w_buff1~0_In-102096705, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-102096705, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-102096705, ~x~0=~x~0_In-102096705} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-12-18 14:59:29,058 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [677] [677] L830-4-->L831: Formula: (= v_~x~0_17 |v_ULTIMATE.start_main_#t~ite41_10|) InVars {ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_10|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_9|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_13|, ~x~0=v_~x~0_17} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite42, ~x~0] because there is no mapped edge [2019-12-18 14:59:29,058 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [738] [738] L831-->L831-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In-487626149 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In-487626149 256)))) (or (and (= |ULTIMATE.start_main_#t~ite43_Out-487626149| ~x$w_buff0_used~0_In-487626149) (or .cse0 .cse1)) (and (= |ULTIMATE.start_main_#t~ite43_Out-487626149| 0) (not .cse0) (not .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-487626149, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-487626149} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-487626149, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-487626149|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-487626149} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-18 14:59:29,060 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [744] [744] L832-->L832-2: Formula: (let ((.cse2 (= (mod ~x$r_buff0_thd0~0_In-1725964012 256) 0)) (.cse3 (= (mod ~x$w_buff0_used~0_In-1725964012 256) 0)) (.cse0 (= (mod ~x$w_buff1_used~0_In-1725964012 256) 0)) (.cse1 (= (mod ~x$r_buff1_thd0~0_In-1725964012 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite44_Out-1725964012|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse0 .cse1) (= ~x$w_buff1_used~0_In-1725964012 |ULTIMATE.start_main_#t~ite44_Out-1725964012|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1725964012, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1725964012, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1725964012, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1725964012} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1725964012, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1725964012, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1725964012, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-1725964012|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1725964012} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-18 14:59:29,061 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [740] [740] L833-->L833-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In513739135 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd0~0_In513739135 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite45_Out513739135|) (not .cse0) (not .cse1)) (and (= ~x$r_buff0_thd0~0_In513739135 |ULTIMATE.start_main_#t~ite45_Out513739135|) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In513739135, ~x$w_buff0_used~0=~x$w_buff0_used~0_In513739135} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In513739135, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out513739135|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In513739135} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-18 14:59:29,062 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [742] [742] L834-->L834-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In-575986187 256))) (.cse0 (= (mod ~x$w_buff1_used~0_In-575986187 256) 0)) (.cse2 (= 0 (mod ~x$r_buff0_thd0~0_In-575986187 256))) (.cse3 (= (mod ~x$w_buff0_used~0_In-575986187 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite46_Out-575986187| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |ULTIMATE.start_main_#t~ite46_Out-575986187| ~x$r_buff1_thd0~0_In-575986187) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-575986187, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-575986187, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-575986187, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-575986187} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-575986187, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out-575986187|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-575986187, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-575986187, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-575986187} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-18 14:59:29,063 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [797] [797] L834-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= 1 v_~__unbuffered_p2_EAX~0_20) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13| (mod v_~main$tmp_guard1~0_16 256)) (= v_~main$tmp_guard1~0_16 0) (= 0 v_~__unbuffered_p0_EAX~0_21) (= v_~__unbuffered_p2_EBX~0_20 0) (= v_~x$r_buff1_thd0~0_80 |v_ULTIMATE.start_main_#t~ite46_35|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_21, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_20, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_35|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_20} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_21, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_20, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_34|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_16, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_20, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_80, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|} 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-18 14:59:29,206 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 02:59:29 BasicIcfg [2019-12-18 14:59:29,206 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 14:59:29,212 INFO L168 Benchmark]: Toolchain (without parser) took 122271.04 ms. Allocated memory was 137.9 MB in the beginning and 3.2 GB in the end (delta: 3.1 GB). Free memory was 100.3 MB in the beginning and 1.0 GB in the end (delta: -935.8 MB). Peak memory consumption was 2.1 GB. Max. memory is 7.1 GB. [2019-12-18 14:59:29,212 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 137.9 MB. Free memory was 121.1 MB in the beginning and 120.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-18 14:59:29,215 INFO L168 Benchmark]: CACSL2BoogieTranslator took 810.80 ms. Allocated memory was 137.9 MB in the beginning and 201.9 MB in the end (delta: 64.0 MB). Free memory was 99.9 MB in the beginning and 153.4 MB in the end (delta: -53.5 MB). Peak memory consumption was 24.4 MB. Max. memory is 7.1 GB. [2019-12-18 14:59:29,216 INFO L168 Benchmark]: Boogie Procedure Inliner took 60.77 ms. Allocated memory is still 201.9 MB. Free memory was 153.4 MB in the beginning and 150.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-18 14:59:29,216 INFO L168 Benchmark]: Boogie Preprocessor took 52.61 ms. Allocated memory is still 201.9 MB. Free memory was 150.7 MB in the beginning and 148.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-18 14:59:29,217 INFO L168 Benchmark]: RCFGBuilder took 835.67 ms. Allocated memory is still 201.9 MB. Free memory was 148.7 MB in the beginning and 101.9 MB in the end (delta: 46.8 MB). Peak memory consumption was 46.8 MB. Max. memory is 7.1 GB. [2019-12-18 14:59:29,220 INFO L168 Benchmark]: TraceAbstraction took 120500.13 ms. Allocated memory was 201.9 MB in the beginning and 3.2 GB in the end (delta: 3.0 GB). Free memory was 101.2 MB in the beginning and 1.0 GB in the end (delta: -934.9 MB). Peak memory consumption was 2.1 GB. Max. memory is 7.1 GB. [2019-12-18 14:59:29,228 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.23 ms. Allocated memory is still 137.9 MB. Free memory was 121.1 MB in the beginning and 120.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 810.80 ms. Allocated memory was 137.9 MB in the beginning and 201.9 MB in the end (delta: 64.0 MB). Free memory was 99.9 MB in the beginning and 153.4 MB in the end (delta: -53.5 MB). Peak memory consumption was 24.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 60.77 ms. Allocated memory is still 201.9 MB. Free memory was 153.4 MB in the beginning and 150.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 52.61 ms. Allocated memory is still 201.9 MB. Free memory was 150.7 MB in the beginning and 148.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 835.67 ms. Allocated memory is still 201.9 MB. Free memory was 148.7 MB in the beginning and 101.9 MB in the end (delta: 46.8 MB). Peak memory consumption was 46.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 120500.13 ms. Allocated memory was 201.9 MB in the beginning and 3.2 GB in the end (delta: 3.0 GB). Free memory was 101.2 MB in the beginning and 1.0 GB in the end (delta: -934.9 MB). Peak memory consumption was 2.1 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.0s, 164 ProgramPointsBefore, 83 ProgramPointsAfterwards, 195 TransitionsBefore, 89 TransitionsAfterwards, 16696 CoEnabledTransitionPairs, 7 FixpointIterations, 33 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 27 ConcurrentYvCompositions, 29 ChoiceCompositions, 6837 VarBasedMoverChecksPositive, 237 VarBasedMoverChecksNegative, 60 SemBasedMoverChecksPositive, 262 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.0s, 0 MoverChecksTotal, 66430 CheckedPairsTotal, 109 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L820] FCALL, FORK 0 pthread_create(&t2354, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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] [L822] FCALL, FORK 0 pthread_create(&t2355, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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] [L767] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L768] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L769] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L770] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L771] 2 x$r_buff0_thd2 = (_Bool)1 [L774] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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] [L777] 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_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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] [L824] FCALL, FORK 0 pthread_create(&t2356, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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] [L791] 3 __unbuffered_p2_EAX = y [L794] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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] [L797] 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_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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] [L732] 1 z = 1 [L737] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L738] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L739] 1 x$flush_delayed = weak$$choice2 [L740] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, 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=1, 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] 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=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, 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=1, 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 = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L778] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L779] 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 [L741] 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) [L742] EXPR 1 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)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, 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))=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] [L742] 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)) [L743] 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)) [L744] 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)) [L745] 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)) [L747] 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)) [L748] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, 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] [L798] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L799] 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 [L800] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L830] 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=8, 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=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] [L831] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L832] 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 [L833] 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: 120.1s, OverallIterations: 33, TraceHistogramMax: 1, AutomataDifference: 63.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 8029 SDtfs, 13322 SDslu, 37976 SDs, 0 SdLazy, 37729 SolverSat, 729 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 31.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 824 GetRequests, 71 SyntacticMatches, 42 SemanticMatches, 711 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7872 ImplicationChecksByTransitivity, 15.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=115962occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 30.7s AutomataMinimizationTime, 32 MinimizatonAttempts, 270119 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 6.5s InterpolantComputationTime, 1527 NumberOfCodeBlocks, 1527 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 1440 ConstructedInterpolants, 0 QuantifiedInterpolants, 414360 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 32 InterpolantComputations, 32 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...