/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/mix056_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 13:59:10,700 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 13:59:10,703 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 13:59:10,722 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 13:59:10,722 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 13:59:10,724 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 13:59:10,725 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 13:59:10,735 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 13:59:10,739 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 13:59:10,742 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 13:59:10,744 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 13:59:10,746 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 13:59:10,746 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 13:59:10,748 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 13:59:10,750 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 13:59:10,752 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 13:59:10,753 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 13:59:10,755 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 13:59:10,756 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 13:59:10,761 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 13:59:10,765 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 13:59:10,770 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 13:59:10,771 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 13:59:10,772 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 13:59:10,774 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 13:59:10,775 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 13:59:10,775 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 13:59:10,777 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 13:59:10,778 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 13:59:10,779 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 13:59:10,779 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 13:59:10,780 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 13:59:10,780 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 13:59:10,781 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 13:59:10,782 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 13:59:10,782 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 13:59:10,783 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 13:59:10,783 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 13:59:10,783 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 13:59:10,784 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 13:59:10,784 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 13:59:10,785 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-18 13:59:10,818 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 13:59:10,819 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 13:59:10,820 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 13:59:10,820 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 13:59:10,820 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 13:59:10,820 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 13:59:10,821 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 13:59:10,823 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 13:59:10,823 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 13:59:10,823 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 13:59:10,824 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 13:59:10,824 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 13:59:10,824 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 13:59:10,824 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 13:59:10,824 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 13:59:10,825 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 13:59:10,825 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 13:59:10,825 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 13:59:10,825 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 13:59:10,825 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 13:59:10,825 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 13:59:10,826 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 13:59:10,827 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 13:59:10,827 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 13:59:10,827 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 13:59:10,827 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 13:59:10,827 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 13:59:10,828 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 13:59:10,828 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-18 13:59:10,828 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 13:59:11,116 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 13:59:11,131 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 13:59:11,134 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 13:59:11,136 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 13:59:11,136 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 13:59:11,137 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix056_power.oepc.i [2019-12-18 13:59:11,199 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aa8babac7/39e9fb8c8b924ad3ba489a15fa7ad28b/FLAGba1064a4c [2019-12-18 13:59:11,768 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 13:59:11,769 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix056_power.oepc.i [2019-12-18 13:59:11,784 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aa8babac7/39e9fb8c8b924ad3ba489a15fa7ad28b/FLAGba1064a4c [2019-12-18 13:59:12,012 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aa8babac7/39e9fb8c8b924ad3ba489a15fa7ad28b [2019-12-18 13:59:12,021 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 13:59:12,023 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 13:59:12,024 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 13:59:12,024 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 13:59:12,028 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 13:59:12,029 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 01:59:12" (1/1) ... [2019-12-18 13:59:12,032 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39ceaf76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:59:12, skipping insertion in model container [2019-12-18 13:59:12,032 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 01:59:12" (1/1) ... [2019-12-18 13:59:12,040 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 13:59:12,083 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 13:59:12,577 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 13:59:12,593 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 13:59:12,678 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 13:59:12,765 INFO L208 MainTranslator]: Completed translation [2019-12-18 13:59:12,765 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:59:12 WrapperNode [2019-12-18 13:59:12,766 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 13:59:12,766 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 13:59:12,766 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 13:59:12,766 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 13:59:12,776 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:59:12" (1/1) ... [2019-12-18 13:59:12,807 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:59:12" (1/1) ... [2019-12-18 13:59:12,842 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 13:59:12,842 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 13:59:12,842 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 13:59:12,843 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 13:59:12,853 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:59:12" (1/1) ... [2019-12-18 13:59:12,853 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:59:12" (1/1) ... [2019-12-18 13:59:12,858 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:59:12" (1/1) ... [2019-12-18 13:59:12,858 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:59:12" (1/1) ... [2019-12-18 13:59:12,869 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:59:12" (1/1) ... [2019-12-18 13:59:12,873 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:59:12" (1/1) ... [2019-12-18 13:59:12,877 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:59:12" (1/1) ... [2019-12-18 13:59:12,882 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 13:59:12,883 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 13:59:12,883 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 13:59:12,883 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 13:59:12,884 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:59:12" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 13:59:12,954 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 13:59:12,954 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 13:59:12,954 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 13:59:12,955 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 13:59:12,955 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 13:59:12,956 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 13:59:12,956 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 13:59:12,957 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 13:59:12,957 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 13:59:12,959 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 13:59:12,959 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 13:59:12,959 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 13:59:12,959 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 13:59:12,961 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 13:59:13,806 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 13:59:13,807 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 13:59:13,809 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 01:59:13 BoogieIcfgContainer [2019-12-18 13:59:13,809 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 13:59:13,810 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 13:59:13,811 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 13:59:13,814 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 13:59:13,814 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 01:59:12" (1/3) ... [2019-12-18 13:59:13,815 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5710be6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 01:59:13, skipping insertion in model container [2019-12-18 13:59:13,815 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:59:12" (2/3) ... [2019-12-18 13:59:13,816 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5710be6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 01:59:13, skipping insertion in model container [2019-12-18 13:59:13,816 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 01:59:13" (3/3) ... [2019-12-18 13:59:13,818 INFO L109 eAbstractionObserver]: Analyzing ICFG mix056_power.oepc.i [2019-12-18 13:59:13,828 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 13:59:13,829 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 13:59:13,837 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 13:59:13,838 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 13:59:13,881 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,882 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,882 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,882 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,883 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,883 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,883 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,884 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,884 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,885 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,885 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,885 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,885 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,886 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,886 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,886 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,887 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,887 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,887 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,887 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,888 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,888 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,888 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,889 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,889 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,889 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,889 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,890 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,890 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,890 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,890 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,891 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,891 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,891 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,892 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,892 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,892 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,892 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,893 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,893 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,909 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,910 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,910 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,911 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,911 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,911 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,911 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,912 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,912 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,912 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,912 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,912 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,913 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,913 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,913 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,913 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,913 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,914 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,914 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,914 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,914 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,915 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,915 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,915 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,916 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,916 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,916 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,917 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,917 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,917 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,917 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,917 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,918 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,918 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,918 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,918 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,919 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,919 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,919 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,919 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,920 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,920 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,920 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,920 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,920 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,920 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,921 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,921 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,921 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,921 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,922 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,922 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,922 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,922 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,922 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,923 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,923 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,923 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,923 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,924 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,924 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,924 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,924 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,924 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,925 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,925 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,925 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,925 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,925 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,926 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,926 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,926 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,926 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,927 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,927 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,927 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,927 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,927 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,927 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,928 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,928 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,928 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,928 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,928 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,929 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,929 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,929 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,929 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,929 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,930 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,930 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,930 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,930 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,930 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,931 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,931 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,931 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,931 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,932 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,932 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,932 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,932 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,932 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,933 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,933 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,933 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,933 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,933 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,934 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,934 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,934 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,934 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,935 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,935 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,935 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,935 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,935 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,936 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,936 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,936 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,936 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,936 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,936 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,937 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,937 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,937 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,937 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,937 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,938 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,938 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,938 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,938 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,938 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,939 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,939 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,939 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,939 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,939 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,940 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,940 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,940 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,940 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,944 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,944 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,944 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,945 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,945 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,945 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,945 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,945 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,945 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,946 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,946 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,946 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,949 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,950 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,950 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,950 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,950 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,950 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,951 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,951 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,951 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,951 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,954 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,955 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,955 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,955 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,955 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,955 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,956 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,956 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,956 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,956 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,956 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,957 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,957 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,957 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,957 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,957 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,958 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,958 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,958 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,958 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,958 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,959 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,959 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,959 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,959 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,959 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,960 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,960 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,960 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,960 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,961 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,961 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,961 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:13,981 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 13:59:14,001 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 13:59:14,002 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 13:59:14,002 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 13:59:14,002 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 13:59:14,002 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 13:59:14,002 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 13:59:14,002 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 13:59:14,003 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 13:59:14,019 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 174 places, 211 transitions [2019-12-18 13:59:14,021 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 174 places, 211 transitions [2019-12-18 13:59:14,128 INFO L126 PetriNetUnfolder]: 47/208 cut-off events. [2019-12-18 13:59:14,128 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 13:59:14,152 INFO L76 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 208 events. 47/208 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 430 event pairs. 9/168 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 13:59:14,179 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 174 places, 211 transitions [2019-12-18 13:59:14,239 INFO L126 PetriNetUnfolder]: 47/208 cut-off events. [2019-12-18 13:59:14,240 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 13:59:14,249 INFO L76 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 208 events. 47/208 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 430 event pairs. 9/168 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 13:59:14,270 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-18 13:59:14,271 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 13:59:18,932 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 21 [2019-12-18 13:59:20,152 WARN L192 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-12-18 13:59:20,276 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-12-18 13:59:20,299 INFO L206 etLargeBlockEncoding]: Checked pairs total: 77200 [2019-12-18 13:59:20,299 INFO L214 etLargeBlockEncoding]: Total number of compositions: 114 [2019-12-18 13:59:20,302 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 92 places, 102 transitions [2019-12-18 13:59:33,938 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 102314 states. [2019-12-18 13:59:33,940 INFO L276 IsEmpty]: Start isEmpty. Operand 102314 states. [2019-12-18 13:59:33,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 13:59:33,952 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:59:33,953 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 13:59:33,954 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:59:33,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:59:33,960 INFO L82 PathProgramCache]: Analyzing trace with hash 909908, now seen corresponding path program 1 times [2019-12-18 13:59:33,969 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:59:33,969 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596987222] [2019-12-18 13:59:33,969 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:59:34,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:59:34,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:59:34,270 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596987222] [2019-12-18 13:59:34,271 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:59:34,271 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 13:59:34,274 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962080070] [2019-12-18 13:59:34,280 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:59:34,280 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:59:34,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:59:34,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:59:34,298 INFO L87 Difference]: Start difference. First operand 102314 states. Second operand 3 states. [2019-12-18 13:59:37,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:59:37,002 INFO L93 Difference]: Finished difference Result 101472 states and 432734 transitions. [2019-12-18 13:59:37,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:59:37,004 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 13:59:37,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:59:37,768 INFO L225 Difference]: With dead ends: 101472 [2019-12-18 13:59:37,768 INFO L226 Difference]: Without dead ends: 95232 [2019-12-18 13:59:37,770 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:59:43,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95232 states. [2019-12-18 13:59:45,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95232 to 95232. [2019-12-18 13:59:45,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95232 states. [2019-12-18 13:59:46,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95232 states to 95232 states and 405538 transitions. [2019-12-18 13:59:46,058 INFO L78 Accepts]: Start accepts. Automaton has 95232 states and 405538 transitions. Word has length 3 [2019-12-18 13:59:46,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:59:46,058 INFO L462 AbstractCegarLoop]: Abstraction has 95232 states and 405538 transitions. [2019-12-18 13:59:46,058 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:59:46,058 INFO L276 IsEmpty]: Start isEmpty. Operand 95232 states and 405538 transitions. [2019-12-18 13:59:46,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 13:59:46,063 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:59:46,063 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:59:46,063 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:59:46,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:59:46,064 INFO L82 PathProgramCache]: Analyzing trace with hash 1729820714, now seen corresponding path program 1 times [2019-12-18 13:59:46,064 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:59:46,064 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389187002] [2019-12-18 13:59:46,064 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:59:46,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:59:46,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:59:46,143 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389187002] [2019-12-18 13:59:46,144 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:59:46,144 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:59:46,145 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170408989] [2019-12-18 13:59:46,146 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 13:59:46,147 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:59:46,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 13:59:46,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:59:46,147 INFO L87 Difference]: Start difference. First operand 95232 states and 405538 transitions. Second operand 4 states. [2019-12-18 13:59:50,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:59:50,966 INFO L93 Difference]: Finished difference Result 151692 states and 619304 transitions. [2019-12-18 13:59:50,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 13:59:50,966 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 13:59:50,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:59:51,740 INFO L225 Difference]: With dead ends: 151692 [2019-12-18 13:59:51,741 INFO L226 Difference]: Without dead ends: 151643 [2019-12-18 13:59:51,741 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:59:58,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151643 states. [2019-12-18 14:00:02,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151643 to 138429. [2019-12-18 14:00:02,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138429 states. [2019-12-18 14:00:02,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138429 states to 138429 states and 572602 transitions. [2019-12-18 14:00:02,531 INFO L78 Accepts]: Start accepts. Automaton has 138429 states and 572602 transitions. Word has length 11 [2019-12-18 14:00:02,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:00:02,531 INFO L462 AbstractCegarLoop]: Abstraction has 138429 states and 572602 transitions. [2019-12-18 14:00:02,531 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 14:00:02,531 INFO L276 IsEmpty]: Start isEmpty. Operand 138429 states and 572602 transitions. [2019-12-18 14:00:02,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 14:00:02,537 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:00:02,537 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:00:02,538 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:00:02,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:00:02,538 INFO L82 PathProgramCache]: Analyzing trace with hash 1791451612, now seen corresponding path program 1 times [2019-12-18 14:00:02,538 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:00:02,538 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863982851] [2019-12-18 14:00:02,539 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:00:02,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:00:02,592 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:00:02,593 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863982851] [2019-12-18 14:00:02,593 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:00:02,593 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:00:02,593 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741647169] [2019-12-18 14:00:02,594 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:00:02,594 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:00:02,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:00:02,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:00:02,594 INFO L87 Difference]: Start difference. First operand 138429 states and 572602 transitions. Second operand 3 states. [2019-12-18 14:00:02,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:00:02,709 INFO L93 Difference]: Finished difference Result 30955 states and 100617 transitions. [2019-12-18 14:00:02,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:00:02,710 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-18 14:00:02,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:00:02,762 INFO L225 Difference]: With dead ends: 30955 [2019-12-18 14:00:02,763 INFO L226 Difference]: Without dead ends: 30955 [2019-12-18 14:00:02,763 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:00:02,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30955 states. [2019-12-18 14:00:07,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30955 to 30955. [2019-12-18 14:00:07,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30955 states. [2019-12-18 14:00:07,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30955 states to 30955 states and 100617 transitions. [2019-12-18 14:00:07,842 INFO L78 Accepts]: Start accepts. Automaton has 30955 states and 100617 transitions. Word has length 13 [2019-12-18 14:00:07,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:00:07,843 INFO L462 AbstractCegarLoop]: Abstraction has 30955 states and 100617 transitions. [2019-12-18 14:00:07,843 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:00:07,843 INFO L276 IsEmpty]: Start isEmpty. Operand 30955 states and 100617 transitions. [2019-12-18 14:00:07,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 14:00:07,846 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:00:07,846 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:00:07,846 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:00:07,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:00:07,846 INFO L82 PathProgramCache]: Analyzing trace with hash -137996123, now seen corresponding path program 1 times [2019-12-18 14:00:07,846 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:00:07,847 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333030008] [2019-12-18 14:00:07,847 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:00:07,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:00:07,942 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:00:07,942 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333030008] [2019-12-18 14:00:07,942 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:00:07,942 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 14:00:07,943 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961774633] [2019-12-18 14:00:07,943 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:00:07,943 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:00:07,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:00:07,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:00:07,944 INFO L87 Difference]: Start difference. First operand 30955 states and 100617 transitions. Second operand 3 states. [2019-12-18 14:00:08,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:00:08,218 INFO L93 Difference]: Finished difference Result 47061 states and 152507 transitions. [2019-12-18 14:00:08,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:00:08,219 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-18 14:00:08,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:00:08,413 INFO L225 Difference]: With dead ends: 47061 [2019-12-18 14:00:08,413 INFO L226 Difference]: Without dead ends: 47061 [2019-12-18 14:00:08,414 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:00:08,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47061 states. [2019-12-18 14:00:09,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47061 to 33925. [2019-12-18 14:00:09,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33925 states. [2019-12-18 14:00:09,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33925 states to 33925 states and 111057 transitions. [2019-12-18 14:00:09,139 INFO L78 Accepts]: Start accepts. Automaton has 33925 states and 111057 transitions. Word has length 16 [2019-12-18 14:00:09,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:00:09,140 INFO L462 AbstractCegarLoop]: Abstraction has 33925 states and 111057 transitions. [2019-12-18 14:00:09,140 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:00:09,141 INFO L276 IsEmpty]: Start isEmpty. Operand 33925 states and 111057 transitions. [2019-12-18 14:00:09,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 14:00:09,142 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:00:09,143 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:00:09,143 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:00:09,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:00:09,143 INFO L82 PathProgramCache]: Analyzing trace with hash -137876649, now seen corresponding path program 1 times [2019-12-18 14:00:09,143 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:00:09,144 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355136562] [2019-12-18 14:00:09,144 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:00:09,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:00:09,218 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:00:09,219 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355136562] [2019-12-18 14:00:09,219 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:00:09,219 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:00:09,219 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734563337] [2019-12-18 14:00:09,220 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 14:00:09,220 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:00:09,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 14:00:09,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 14:00:09,221 INFO L87 Difference]: Start difference. First operand 33925 states and 111057 transitions. Second operand 4 states. [2019-12-18 14:00:09,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:00:09,575 INFO L93 Difference]: Finished difference Result 41000 states and 132194 transitions. [2019-12-18 14:00:09,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 14:00:09,575 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-18 14:00:09,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:00:09,657 INFO L225 Difference]: With dead ends: 41000 [2019-12-18 14:00:09,657 INFO L226 Difference]: Without dead ends: 41000 [2019-12-18 14:00:09,658 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:00:10,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41000 states. [2019-12-18 14:00:10,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41000 to 37405. [2019-12-18 14:00:10,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37405 states. [2019-12-18 14:00:10,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37405 states to 37405 states and 121522 transitions. [2019-12-18 14:00:10,704 INFO L78 Accepts]: Start accepts. Automaton has 37405 states and 121522 transitions. Word has length 16 [2019-12-18 14:00:10,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:00:10,705 INFO L462 AbstractCegarLoop]: Abstraction has 37405 states and 121522 transitions. [2019-12-18 14:00:10,705 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 14:00:10,705 INFO L276 IsEmpty]: Start isEmpty. Operand 37405 states and 121522 transitions. [2019-12-18 14:00:10,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 14:00:10,707 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:00:10,707 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:00:10,707 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:00:10,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:00:10,707 INFO L82 PathProgramCache]: Analyzing trace with hash -219444717, now seen corresponding path program 1 times [2019-12-18 14:00:10,707 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:00:10,708 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852968697] [2019-12-18 14:00:10,708 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:00:10,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:00:10,765 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:00:10,765 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852968697] [2019-12-18 14:00:10,766 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:00:10,766 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:00:10,766 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829612976] [2019-12-18 14:00:10,766 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 14:00:10,767 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:00:10,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 14:00:10,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 14:00:10,767 INFO L87 Difference]: Start difference. First operand 37405 states and 121522 transitions. Second operand 4 states. [2019-12-18 14:00:11,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:00:11,104 INFO L93 Difference]: Finished difference Result 45062 states and 145323 transitions. [2019-12-18 14:00:11,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 14:00:11,104 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-18 14:00:11,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:00:11,195 INFO L225 Difference]: With dead ends: 45062 [2019-12-18 14:00:11,196 INFO L226 Difference]: Without dead ends: 45062 [2019-12-18 14:00:11,196 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:00:11,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45062 states. [2019-12-18 14:00:12,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45062 to 38365. [2019-12-18 14:00:12,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38365 states. [2019-12-18 14:00:12,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38365 states to 38365 states and 124903 transitions. [2019-12-18 14:00:12,432 INFO L78 Accepts]: Start accepts. Automaton has 38365 states and 124903 transitions. Word has length 16 [2019-12-18 14:00:12,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:00:12,432 INFO L462 AbstractCegarLoop]: Abstraction has 38365 states and 124903 transitions. [2019-12-18 14:00:12,432 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 14:00:12,433 INFO L276 IsEmpty]: Start isEmpty. Operand 38365 states and 124903 transitions. [2019-12-18 14:00:12,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 14:00:12,443 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:00:12,443 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:00:12,444 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:00:12,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:00:12,444 INFO L82 PathProgramCache]: Analyzing trace with hash -1066994180, now seen corresponding path program 1 times [2019-12-18 14:00:12,444 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:00:12,445 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715460663] [2019-12-18 14:00:12,445 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:00:12,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:00:12,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:00:12,561 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715460663] [2019-12-18 14:00:12,562 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:00:12,562 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 14:00:12,562 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885972655] [2019-12-18 14:00:12,562 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 14:00:12,562 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:00:12,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 14:00:12,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:00:12,564 INFO L87 Difference]: Start difference. First operand 38365 states and 124903 transitions. Second operand 5 states. [2019-12-18 14:00:13,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:00:13,204 INFO L93 Difference]: Finished difference Result 53898 states and 171065 transitions. [2019-12-18 14:00:13,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 14:00:13,205 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-18 14:00:13,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:00:13,294 INFO L225 Difference]: With dead ends: 53898 [2019-12-18 14:00:13,294 INFO L226 Difference]: Without dead ends: 53891 [2019-12-18 14:00:13,295 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 14:00:13,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53891 states. [2019-12-18 14:00:14,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53891 to 39721. [2019-12-18 14:00:14,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39721 states. [2019-12-18 14:00:14,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39721 states to 39721 states and 129036 transitions. [2019-12-18 14:00:14,442 INFO L78 Accepts]: Start accepts. Automaton has 39721 states and 129036 transitions. Word has length 22 [2019-12-18 14:00:14,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:00:14,443 INFO L462 AbstractCegarLoop]: Abstraction has 39721 states and 129036 transitions. [2019-12-18 14:00:14,443 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 14:00:14,443 INFO L276 IsEmpty]: Start isEmpty. Operand 39721 states and 129036 transitions. [2019-12-18 14:00:14,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 14:00:14,452 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:00:14,452 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:00:14,452 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:00:14,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:00:14,452 INFO L82 PathProgramCache]: Analyzing trace with hash -1734556852, now seen corresponding path program 1 times [2019-12-18 14:00:14,453 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:00:14,453 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900016212] [2019-12-18 14:00:14,453 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:00:14,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:00:14,531 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:00:14,531 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900016212] [2019-12-18 14:00:14,532 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:00:14,532 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 14:00:14,532 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234271130] [2019-12-18 14:00:14,533 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 14:00:14,533 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:00:14,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 14:00:14,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:00:14,533 INFO L87 Difference]: Start difference. First operand 39721 states and 129036 transitions. Second operand 5 states. [2019-12-18 14:00:15,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:00:15,155 INFO L93 Difference]: Finished difference Result 56181 states and 177938 transitions. [2019-12-18 14:00:15,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 14:00:15,156 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-18 14:00:15,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:00:15,250 INFO L225 Difference]: With dead ends: 56181 [2019-12-18 14:00:15,250 INFO L226 Difference]: Without dead ends: 56174 [2019-12-18 14:00:15,250 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 14:00:15,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56174 states. [2019-12-18 14:00:15,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56174 to 38054. [2019-12-18 14:00:15,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38054 states. [2019-12-18 14:00:16,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38054 states to 38054 states and 123745 transitions. [2019-12-18 14:00:16,002 INFO L78 Accepts]: Start accepts. Automaton has 38054 states and 123745 transitions. Word has length 22 [2019-12-18 14:00:16,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:00:16,002 INFO L462 AbstractCegarLoop]: Abstraction has 38054 states and 123745 transitions. [2019-12-18 14:00:16,002 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 14:00:16,002 INFO L276 IsEmpty]: Start isEmpty. Operand 38054 states and 123745 transitions. [2019-12-18 14:00:16,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 14:00:16,013 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:00:16,013 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:00:16,013 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:00:16,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:00:16,014 INFO L82 PathProgramCache]: Analyzing trace with hash -779030427, now seen corresponding path program 1 times [2019-12-18 14:00:16,014 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:00:16,014 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868257973] [2019-12-18 14:00:16,014 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:00:16,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:00:16,056 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:00:16,056 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868257973] [2019-12-18 14:00:16,057 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:00:16,057 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 14:00:16,057 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380117110] [2019-12-18 14:00:16,057 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 14:00:16,058 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:00:16,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 14:00:16,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 14:00:16,058 INFO L87 Difference]: Start difference. First operand 38054 states and 123745 transitions. Second operand 4 states. [2019-12-18 14:00:16,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:00:16,145 INFO L93 Difference]: Finished difference Result 15260 states and 46817 transitions. [2019-12-18 14:00:16,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 14:00:16,145 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-18 14:00:16,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:00:16,180 INFO L225 Difference]: With dead ends: 15260 [2019-12-18 14:00:16,180 INFO L226 Difference]: Without dead ends: 15260 [2019-12-18 14:00:16,181 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:00:16,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15260 states. [2019-12-18 14:00:16,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15260 to 14988. [2019-12-18 14:00:16,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14988 states. [2019-12-18 14:00:16,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14988 states to 14988 states and 46041 transitions. [2019-12-18 14:00:16,803 INFO L78 Accepts]: Start accepts. Automaton has 14988 states and 46041 transitions. Word has length 25 [2019-12-18 14:00:16,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:00:16,804 INFO L462 AbstractCegarLoop]: Abstraction has 14988 states and 46041 transitions. [2019-12-18 14:00:16,804 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 14:00:16,804 INFO L276 IsEmpty]: Start isEmpty. Operand 14988 states and 46041 transitions. [2019-12-18 14:00:16,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 14:00:16,816 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:00:16,816 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:00:16,816 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:00:16,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:00:16,817 INFO L82 PathProgramCache]: Analyzing trace with hash -1740727520, now seen corresponding path program 1 times [2019-12-18 14:00:16,817 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:00:16,817 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094149343] [2019-12-18 14:00:16,817 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:00:16,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:00:16,901 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:00:16,902 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094149343] [2019-12-18 14:00:16,902 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:00:16,902 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 14:00:16,903 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195541562] [2019-12-18 14:00:16,903 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 14:00:16,903 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:00:16,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 14:00:16,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:00:16,904 INFO L87 Difference]: Start difference. First operand 14988 states and 46041 transitions. Second operand 5 states. [2019-12-18 14:00:17,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:00:17,305 INFO L93 Difference]: Finished difference Result 19496 states and 58771 transitions. [2019-12-18 14:00:17,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 14:00:17,306 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-18 14:00:17,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:00:17,350 INFO L225 Difference]: With dead ends: 19496 [2019-12-18 14:00:17,350 INFO L226 Difference]: Without dead ends: 19496 [2019-12-18 14:00:17,351 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 14:00:17,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19496 states. [2019-12-18 14:00:17,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19496 to 18230. [2019-12-18 14:00:17,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18230 states. [2019-12-18 14:00:17,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18230 states to 18230 states and 55601 transitions. [2019-12-18 14:00:17,756 INFO L78 Accepts]: Start accepts. Automaton has 18230 states and 55601 transitions. Word has length 27 [2019-12-18 14:00:17,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:00:17,757 INFO L462 AbstractCegarLoop]: Abstraction has 18230 states and 55601 transitions. [2019-12-18 14:00:17,757 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 14:00:17,757 INFO L276 IsEmpty]: Start isEmpty. Operand 18230 states and 55601 transitions. [2019-12-18 14:00:17,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-18 14:00:17,770 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:00:17,770 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] [2019-12-18 14:00:17,770 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:00:17,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:00:17,770 INFO L82 PathProgramCache]: Analyzing trace with hash -1978987791, now seen corresponding path program 1 times [2019-12-18 14:00:17,771 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:00:17,771 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132024946] [2019-12-18 14:00:17,771 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:00:17,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:00:17,828 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:00:17,829 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132024946] [2019-12-18 14:00:17,829 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:00:17,829 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 14:00:17,829 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49335508] [2019-12-18 14:00:17,830 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 14:00:17,830 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:00:17,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 14:00:17,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:00:17,831 INFO L87 Difference]: Start difference. First operand 18230 states and 55601 transitions. Second operand 5 states. [2019-12-18 14:00:18,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:00:18,221 INFO L93 Difference]: Finished difference Result 21384 states and 64177 transitions. [2019-12-18 14:00:18,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 14:00:18,222 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-18 14:00:18,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:00:18,254 INFO L225 Difference]: With dead ends: 21384 [2019-12-18 14:00:18,255 INFO L226 Difference]: Without dead ends: 21384 [2019-12-18 14:00:18,255 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 14:00:18,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21384 states. [2019-12-18 14:00:18,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21384 to 17323. [2019-12-18 14:00:18,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17323 states. [2019-12-18 14:00:18,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17323 states to 17323 states and 52883 transitions. [2019-12-18 14:00:18,538 INFO L78 Accepts]: Start accepts. Automaton has 17323 states and 52883 transitions. Word has length 28 [2019-12-18 14:00:18,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:00:18,539 INFO L462 AbstractCegarLoop]: Abstraction has 17323 states and 52883 transitions. [2019-12-18 14:00:18,539 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 14:00:18,539 INFO L276 IsEmpty]: Start isEmpty. Operand 17323 states and 52883 transitions. [2019-12-18 14:00:18,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-18 14:00:18,556 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:00:18,556 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:00:18,556 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:00:18,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:00:18,557 INFO L82 PathProgramCache]: Analyzing trace with hash 1850577991, now seen corresponding path program 1 times [2019-12-18 14:00:18,557 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:00:18,557 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996240856] [2019-12-18 14:00:18,557 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:00:18,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:00:18,621 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:00:18,622 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996240856] [2019-12-18 14:00:18,622 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:00:18,622 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 14:00:18,622 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558757353] [2019-12-18 14:00:18,623 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 14:00:18,623 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:00:18,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 14:00:18,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 14:00:18,623 INFO L87 Difference]: Start difference. First operand 17323 states and 52883 transitions. Second operand 6 states. [2019-12-18 14:00:19,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:00:19,246 INFO L93 Difference]: Finished difference Result 24527 states and 73018 transitions. [2019-12-18 14:00:19,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 14:00:19,247 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2019-12-18 14:00:19,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:00:19,280 INFO L225 Difference]: With dead ends: 24527 [2019-12-18 14:00:19,280 INFO L226 Difference]: Without dead ends: 24527 [2019-12-18 14:00:19,281 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-12-18 14:00:19,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24527 states. [2019-12-18 14:00:19,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24527 to 18692. [2019-12-18 14:00:19,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18692 states. [2019-12-18 14:00:19,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18692 states to 18692 states and 56821 transitions. [2019-12-18 14:00:19,730 INFO L78 Accepts]: Start accepts. Automaton has 18692 states and 56821 transitions. Word has length 33 [2019-12-18 14:00:19,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:00:19,730 INFO L462 AbstractCegarLoop]: Abstraction has 18692 states and 56821 transitions. [2019-12-18 14:00:19,730 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 14:00:19,731 INFO L276 IsEmpty]: Start isEmpty. Operand 18692 states and 56821 transitions. [2019-12-18 14:00:19,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-18 14:00:19,750 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:00:19,750 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:00:19,750 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:00:19,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:00:19,751 INFO L82 PathProgramCache]: Analyzing trace with hash 1933444630, now seen corresponding path program 1 times [2019-12-18 14:00:19,751 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:00:19,751 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517998439] [2019-12-18 14:00:19,751 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:00:19,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:00:19,819 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:00:19,819 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517998439] [2019-12-18 14:00:19,819 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:00:19,819 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 14:00:19,820 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520059179] [2019-12-18 14:00:19,820 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 14:00:19,820 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:00:19,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 14:00:19,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 14:00:19,821 INFO L87 Difference]: Start difference. First operand 18692 states and 56821 transitions. Second operand 6 states. [2019-12-18 14:00:20,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:00:20,481 INFO L93 Difference]: Finished difference Result 23844 states and 71231 transitions. [2019-12-18 14:00:20,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 14:00:20,481 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2019-12-18 14:00:20,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:00:20,525 INFO L225 Difference]: With dead ends: 23844 [2019-12-18 14:00:20,525 INFO L226 Difference]: Without dead ends: 23844 [2019-12-18 14:00:20,526 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-12-18 14:00:20,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23844 states. [2019-12-18 14:00:20,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23844 to 15691. [2019-12-18 14:00:20,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15691 states. [2019-12-18 14:00:20,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15691 states to 15691 states and 48077 transitions. [2019-12-18 14:00:20,817 INFO L78 Accepts]: Start accepts. Automaton has 15691 states and 48077 transitions. Word has length 34 [2019-12-18 14:00:20,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:00:20,818 INFO L462 AbstractCegarLoop]: Abstraction has 15691 states and 48077 transitions. [2019-12-18 14:00:20,818 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 14:00:20,818 INFO L276 IsEmpty]: Start isEmpty. Operand 15691 states and 48077 transitions. [2019-12-18 14:00:20,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-18 14:00:20,837 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:00:20,837 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:00:20,838 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:00:20,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:00:20,838 INFO L82 PathProgramCache]: Analyzing trace with hash -390301387, now seen corresponding path program 1 times [2019-12-18 14:00:20,838 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:00:20,838 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011232225] [2019-12-18 14:00:20,839 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:00:20,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:00:20,889 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:00:20,889 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011232225] [2019-12-18 14:00:20,889 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:00:20,890 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:00:20,890 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118763252] [2019-12-18 14:00:20,890 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:00:20,890 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:00:20,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:00:20,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:00:20,891 INFO L87 Difference]: Start difference. First operand 15691 states and 48077 transitions. Second operand 3 states. [2019-12-18 14:00:21,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:00:21,006 INFO L93 Difference]: Finished difference Result 29593 states and 90773 transitions. [2019-12-18 14:00:21,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:00:21,007 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-18 14:00:21,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:00:21,043 INFO L225 Difference]: With dead ends: 29593 [2019-12-18 14:00:21,044 INFO L226 Difference]: Without dead ends: 16129 [2019-12-18 14:00:21,044 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:00:21,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16129 states. [2019-12-18 14:00:21,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16129 to 16073. [2019-12-18 14:00:21,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16073 states. [2019-12-18 14:00:21,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16073 states to 16073 states and 48010 transitions. [2019-12-18 14:00:21,443 INFO L78 Accepts]: Start accepts. Automaton has 16073 states and 48010 transitions. Word has length 39 [2019-12-18 14:00:21,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:00:21,444 INFO L462 AbstractCegarLoop]: Abstraction has 16073 states and 48010 transitions. [2019-12-18 14:00:21,444 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:00:21,444 INFO L276 IsEmpty]: Start isEmpty. Operand 16073 states and 48010 transitions. [2019-12-18 14:00:21,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 14:00:21,466 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:00:21,466 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:00:21,466 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:00:21,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:00:21,467 INFO L82 PathProgramCache]: Analyzing trace with hash -1543157030, now seen corresponding path program 1 times [2019-12-18 14:00:21,467 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:00:21,467 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405201936] [2019-12-18 14:00:21,467 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:00:21,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:00:21,537 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:00:21,537 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405201936] [2019-12-18 14:00:21,538 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:00:21,538 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 14:00:21,538 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405197671] [2019-12-18 14:00:21,538 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 14:00:21,538 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:00:21,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 14:00:21,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:00:21,539 INFO L87 Difference]: Start difference. First operand 16073 states and 48010 transitions. Second operand 5 states. [2019-12-18 14:00:22,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:00:22,157 INFO L93 Difference]: Finished difference Result 23632 states and 69938 transitions. [2019-12-18 14:00:22,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 14:00:22,158 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-18 14:00:22,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:00:22,200 INFO L225 Difference]: With dead ends: 23632 [2019-12-18 14:00:22,200 INFO L226 Difference]: Without dead ends: 23632 [2019-12-18 14:00:22,201 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 14:00:22,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23632 states. [2019-12-18 14:00:22,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23632 to 21777. [2019-12-18 14:00:22,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21777 states. [2019-12-18 14:00:22,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21777 states to 21777 states and 64983 transitions. [2019-12-18 14:00:22,668 INFO L78 Accepts]: Start accepts. Automaton has 21777 states and 64983 transitions. Word has length 40 [2019-12-18 14:00:22,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:00:22,668 INFO L462 AbstractCegarLoop]: Abstraction has 21777 states and 64983 transitions. [2019-12-18 14:00:22,669 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 14:00:22,669 INFO L276 IsEmpty]: Start isEmpty. Operand 21777 states and 64983 transitions. [2019-12-18 14:00:22,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 14:00:22,690 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:00:22,691 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:00:22,691 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:00:22,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:00:22,691 INFO L82 PathProgramCache]: Analyzing trace with hash 838743556, now seen corresponding path program 2 times [2019-12-18 14:00:22,691 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:00:22,692 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932226919] [2019-12-18 14:00:22,692 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:00:22,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:00:22,764 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:00:22,764 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932226919] [2019-12-18 14:00:22,764 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:00:22,767 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 14:00:22,768 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027989477] [2019-12-18 14:00:22,768 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 14:00:22,768 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:00:22,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 14:00:22,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:00:22,769 INFO L87 Difference]: Start difference. First operand 21777 states and 64983 transitions. Second operand 5 states. [2019-12-18 14:00:22,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:00:22,868 INFO L93 Difference]: Finished difference Result 20526 states and 62067 transitions. [2019-12-18 14:00:22,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 14:00:22,868 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-18 14:00:22,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:00:22,903 INFO L225 Difference]: With dead ends: 20526 [2019-12-18 14:00:22,903 INFO L226 Difference]: Without dead ends: 18967 [2019-12-18 14:00:22,903 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:00:22,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18967 states. [2019-12-18 14:00:23,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18967 to 18092. [2019-12-18 14:00:23,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18092 states. [2019-12-18 14:00:23,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18092 states to 18092 states and 56295 transitions. [2019-12-18 14:00:23,212 INFO L78 Accepts]: Start accepts. Automaton has 18092 states and 56295 transitions. Word has length 40 [2019-12-18 14:00:23,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:00:23,212 INFO L462 AbstractCegarLoop]: Abstraction has 18092 states and 56295 transitions. [2019-12-18 14:00:23,212 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 14:00:23,212 INFO L276 IsEmpty]: Start isEmpty. Operand 18092 states and 56295 transitions. [2019-12-18 14:00:23,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 14:00:23,242 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:00:23,242 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:00:23,243 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:00:23,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:00:23,243 INFO L82 PathProgramCache]: Analyzing trace with hash 1449191354, now seen corresponding path program 1 times [2019-12-18 14:00:23,243 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:00:23,244 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778241203] [2019-12-18 14:00:23,244 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:00:23,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:00:23,327 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:00:23,327 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778241203] [2019-12-18 14:00:23,327 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:00:23,327 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 14:00:23,328 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722708310] [2019-12-18 14:00:23,329 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:00:23,329 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:00:23,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:00:23,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:00:23,330 INFO L87 Difference]: Start difference. First operand 18092 states and 56295 transitions. Second operand 3 states. [2019-12-18 14:00:23,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:00:23,453 INFO L93 Difference]: Finished difference Result 24294 states and 73055 transitions. [2019-12-18 14:00:23,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:00:23,454 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-18 14:00:23,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:00:23,495 INFO L225 Difference]: With dead ends: 24294 [2019-12-18 14:00:23,495 INFO L226 Difference]: Without dead ends: 24294 [2019-12-18 14:00:23,497 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:00:23,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24294 states. [2019-12-18 14:00:23,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24294 to 18274. [2019-12-18 14:00:23,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18274 states. [2019-12-18 14:00:24,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18274 states to 18274 states and 55190 transitions. [2019-12-18 14:00:24,004 INFO L78 Accepts]: Start accepts. Automaton has 18274 states and 55190 transitions. Word has length 64 [2019-12-18 14:00:24,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:00:24,004 INFO L462 AbstractCegarLoop]: Abstraction has 18274 states and 55190 transitions. [2019-12-18 14:00:24,004 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:00:24,005 INFO L276 IsEmpty]: Start isEmpty. Operand 18274 states and 55190 transitions. [2019-12-18 14:00:24,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 14:00:24,038 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:00:24,038 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:00:24,038 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:00:24,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:00:24,038 INFO L82 PathProgramCache]: Analyzing trace with hash -237391966, now seen corresponding path program 1 times [2019-12-18 14:00:24,039 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:00:24,039 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722300128] [2019-12-18 14:00:24,039 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:00:24,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:00:24,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:00:24,185 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722300128] [2019-12-18 14:00:24,186 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:00:24,189 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 14:00:24,189 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814241509] [2019-12-18 14:00:24,190 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 14:00:24,190 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:00:24,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 14:00:24,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-18 14:00:24,190 INFO L87 Difference]: Start difference. First operand 18274 states and 55190 transitions. Second operand 8 states. [2019-12-18 14:00:25,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:00:25,653 INFO L93 Difference]: Finished difference Result 80145 states and 240194 transitions. [2019-12-18 14:00:25,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 14:00:25,653 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 64 [2019-12-18 14:00:25,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:00:25,725 INFO L225 Difference]: With dead ends: 80145 [2019-12-18 14:00:25,726 INFO L226 Difference]: Without dead ends: 58918 [2019-12-18 14:00:25,726 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=145, Invalid=455, Unknown=0, NotChecked=0, Total=600 [2019-12-18 14:00:25,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58918 states. [2019-12-18 14:00:26,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58918 to 21155. [2019-12-18 14:00:26,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21155 states. [2019-12-18 14:00:26,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21155 states to 21155 states and 64148 transitions. [2019-12-18 14:00:26,281 INFO L78 Accepts]: Start accepts. Automaton has 21155 states and 64148 transitions. Word has length 64 [2019-12-18 14:00:26,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:00:26,281 INFO L462 AbstractCegarLoop]: Abstraction has 21155 states and 64148 transitions. [2019-12-18 14:00:26,281 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 14:00:26,281 INFO L276 IsEmpty]: Start isEmpty. Operand 21155 states and 64148 transitions. [2019-12-18 14:00:26,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 14:00:26,311 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:00:26,311 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:00:26,311 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:00:26,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:00:26,311 INFO L82 PathProgramCache]: Analyzing trace with hash -1797634292, now seen corresponding path program 2 times [2019-12-18 14:00:26,311 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:00:26,312 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834425256] [2019-12-18 14:00:26,312 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:00:26,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:00:26,395 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:00:26,395 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834425256] [2019-12-18 14:00:26,395 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:00:26,395 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 14:00:26,396 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400756291] [2019-12-18 14:00:26,396 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 14:00:26,396 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:00:26,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 14:00:26,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 14:00:26,397 INFO L87 Difference]: Start difference. First operand 21155 states and 64148 transitions. Second operand 7 states. [2019-12-18 14:00:26,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:00:26,881 INFO L93 Difference]: Finished difference Result 60723 states and 180590 transitions. [2019-12-18 14:00:26,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 14:00:26,882 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-18 14:00:26,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:00:26,936 INFO L225 Difference]: With dead ends: 60723 [2019-12-18 14:00:26,937 INFO L226 Difference]: Without dead ends: 42175 [2019-12-18 14:00:26,937 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:00:27,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42175 states. [2019-12-18 14:00:27,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42175 to 24456. [2019-12-18 14:00:27,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24456 states. [2019-12-18 14:00:27,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24456 states to 24456 states and 73578 transitions. [2019-12-18 14:00:27,437 INFO L78 Accepts]: Start accepts. Automaton has 24456 states and 73578 transitions. Word has length 64 [2019-12-18 14:00:27,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:00:27,437 INFO L462 AbstractCegarLoop]: Abstraction has 24456 states and 73578 transitions. [2019-12-18 14:00:27,437 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 14:00:27,437 INFO L276 IsEmpty]: Start isEmpty. Operand 24456 states and 73578 transitions. [2019-12-18 14:00:27,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 14:00:27,460 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:00:27,460 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:00:27,461 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:00:27,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:00:27,461 INFO L82 PathProgramCache]: Analyzing trace with hash 1864819808, now seen corresponding path program 3 times [2019-12-18 14:00:27,461 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:00:27,461 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497067629] [2019-12-18 14:00:27,461 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:00:27,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:00:27,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:00:27,571 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497067629] [2019-12-18 14:00:27,571 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:00:27,571 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 14:00:27,571 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599276275] [2019-12-18 14:00:27,571 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 14:00:27,572 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:00:27,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 14:00:27,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 14:00:27,572 INFO L87 Difference]: Start difference. First operand 24456 states and 73578 transitions. Second operand 9 states. [2019-12-18 14:00:29,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:00:29,079 INFO L93 Difference]: Finished difference Result 82000 states and 242893 transitions. [2019-12-18 14:00:29,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-18 14:00:29,080 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2019-12-18 14:00:29,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:00:29,191 INFO L225 Difference]: With dead ends: 82000 [2019-12-18 14:00:29,191 INFO L226 Difference]: Without dead ends: 78263 [2019-12-18 14:00:29,191 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=163, Invalid=539, Unknown=0, NotChecked=0, Total=702 [2019-12-18 14:00:29,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78263 states. [2019-12-18 14:00:29,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78263 to 24486. [2019-12-18 14:00:29,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24486 states. [2019-12-18 14:00:29,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24486 states to 24486 states and 73706 transitions. [2019-12-18 14:00:29,968 INFO L78 Accepts]: Start accepts. Automaton has 24486 states and 73706 transitions. Word has length 64 [2019-12-18 14:00:29,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:00:29,968 INFO L462 AbstractCegarLoop]: Abstraction has 24486 states and 73706 transitions. [2019-12-18 14:00:29,968 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 14:00:29,968 INFO L276 IsEmpty]: Start isEmpty. Operand 24486 states and 73706 transitions. [2019-12-18 14:00:29,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 14:00:29,991 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:00:29,991 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:00:29,992 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:00:29,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:00:29,992 INFO L82 PathProgramCache]: Analyzing trace with hash 1743895244, now seen corresponding path program 4 times [2019-12-18 14:00:29,992 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:00:29,992 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268248773] [2019-12-18 14:00:29,992 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:00:30,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:00:30,096 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:00:30,097 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268248773] [2019-12-18 14:00:30,097 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:00:30,098 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 14:00:30,098 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594480248] [2019-12-18 14:00:30,099 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 14:00:30,100 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:00:30,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 14:00:30,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 14:00:30,101 INFO L87 Difference]: Start difference. First operand 24486 states and 73706 transitions. Second operand 9 states. [2019-12-18 14:00:31,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:00:31,428 INFO L93 Difference]: Finished difference Result 98855 states and 292935 transitions. [2019-12-18 14:00:31,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 14:00:31,429 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2019-12-18 14:00:31,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:00:31,859 INFO L225 Difference]: With dead ends: 98855 [2019-12-18 14:00:31,860 INFO L226 Difference]: Without dead ends: 95231 [2019-12-18 14:00:31,860 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=154, Invalid=496, Unknown=0, NotChecked=0, Total=650 [2019-12-18 14:00:32,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95231 states. [2019-12-18 14:00:32,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95231 to 24523. [2019-12-18 14:00:32,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24523 states. [2019-12-18 14:00:32,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24523 states to 24523 states and 73910 transitions. [2019-12-18 14:00:32,650 INFO L78 Accepts]: Start accepts. Automaton has 24523 states and 73910 transitions. Word has length 64 [2019-12-18 14:00:32,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:00:32,650 INFO L462 AbstractCegarLoop]: Abstraction has 24523 states and 73910 transitions. [2019-12-18 14:00:32,650 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 14:00:32,650 INFO L276 IsEmpty]: Start isEmpty. Operand 24523 states and 73910 transitions. [2019-12-18 14:00:32,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 14:00:32,678 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:00:32,678 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:00:32,678 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:00:32,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:00:32,678 INFO L82 PathProgramCache]: Analyzing trace with hash -1299608434, now seen corresponding path program 5 times [2019-12-18 14:00:32,678 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:00:32,678 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228643291] [2019-12-18 14:00:32,679 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:00:32,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:00:32,751 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:00:32,752 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228643291] [2019-12-18 14:00:32,753 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:00:32,753 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 14:00:32,753 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275101598] [2019-12-18 14:00:32,754 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 14:00:32,756 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:00:32,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 14:00:32,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 14:00:32,757 INFO L87 Difference]: Start difference. First operand 24523 states and 73910 transitions. Second operand 7 states. [2019-12-18 14:00:33,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:00:33,319 INFO L93 Difference]: Finished difference Result 51563 states and 153345 transitions. [2019-12-18 14:00:33,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 14:00:33,320 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-18 14:00:33,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:00:33,424 INFO L225 Difference]: With dead ends: 51563 [2019-12-18 14:00:33,424 INFO L226 Difference]: Without dead ends: 44912 [2019-12-18 14:00:33,425 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-18 14:00:33,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44912 states. [2019-12-18 14:00:34,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44912 to 24831. [2019-12-18 14:00:34,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24831 states. [2019-12-18 14:00:34,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24831 states to 24831 states and 74861 transitions. [2019-12-18 14:00:34,179 INFO L78 Accepts]: Start accepts. Automaton has 24831 states and 74861 transitions. Word has length 64 [2019-12-18 14:00:34,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:00:34,179 INFO L462 AbstractCegarLoop]: Abstraction has 24831 states and 74861 transitions. [2019-12-18 14:00:34,179 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 14:00:34,179 INFO L276 IsEmpty]: Start isEmpty. Operand 24831 states and 74861 transitions. [2019-12-18 14:00:34,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 14:00:34,204 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:00:34,204 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:00:34,205 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:00:34,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:00:34,205 INFO L82 PathProgramCache]: Analyzing trace with hash 2138548684, now seen corresponding path program 6 times [2019-12-18 14:00:34,205 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:00:34,205 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667070221] [2019-12-18 14:00:34,205 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:00:34,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:00:34,281 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:00:34,283 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667070221] [2019-12-18 14:00:34,284 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:00:34,284 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 14:00:34,284 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003625843] [2019-12-18 14:00:34,284 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 14:00:34,284 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:00:34,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 14:00:34,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 14:00:34,286 INFO L87 Difference]: Start difference. First operand 24831 states and 74861 transitions. Second operand 6 states. [2019-12-18 14:00:34,492 WARN L192 SmtUtils]: Spent 182.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2019-12-18 14:00:35,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:00:35,212 INFO L93 Difference]: Finished difference Result 40171 states and 119168 transitions. [2019-12-18 14:00:35,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 14:00:35,213 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 64 [2019-12-18 14:00:35,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:00:35,267 INFO L225 Difference]: With dead ends: 40171 [2019-12-18 14:00:35,268 INFO L226 Difference]: Without dead ends: 39968 [2019-12-18 14:00:35,268 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-18 14:00:35,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39968 states. [2019-12-18 14:00:35,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39968 to 26499. [2019-12-18 14:00:35,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26499 states. [2019-12-18 14:00:35,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26499 states to 26499 states and 80093 transitions. [2019-12-18 14:00:35,805 INFO L78 Accepts]: Start accepts. Automaton has 26499 states and 80093 transitions. Word has length 64 [2019-12-18 14:00:35,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:00:35,805 INFO L462 AbstractCegarLoop]: Abstraction has 26499 states and 80093 transitions. [2019-12-18 14:00:35,805 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 14:00:35,806 INFO L276 IsEmpty]: Start isEmpty. Operand 26499 states and 80093 transitions. [2019-12-18 14:00:35,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 14:00:35,837 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:00:35,837 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:00:35,837 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:00:35,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:00:35,837 INFO L82 PathProgramCache]: Analyzing trace with hash -203791434, now seen corresponding path program 7 times [2019-12-18 14:00:35,838 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:00:35,838 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053878707] [2019-12-18 14:00:35,838 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:00:35,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:00:35,904 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:00:35,904 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053878707] [2019-12-18 14:00:35,904 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:00:35,904 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 14:00:35,905 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593185881] [2019-12-18 14:00:35,905 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 14:00:35,905 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:00:35,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 14:00:35,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:00:35,906 INFO L87 Difference]: Start difference. First operand 26499 states and 80093 transitions. Second operand 5 states. [2019-12-18 14:00:36,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:00:36,261 INFO L93 Difference]: Finished difference Result 28511 states and 85751 transitions. [2019-12-18 14:00:36,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 14:00:36,261 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 64 [2019-12-18 14:00:36,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:00:36,299 INFO L225 Difference]: With dead ends: 28511 [2019-12-18 14:00:36,299 INFO L226 Difference]: Without dead ends: 28511 [2019-12-18 14:00:36,300 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 14:00:36,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28511 states. [2019-12-18 14:00:36,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28511 to 26924. [2019-12-18 14:00:36,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26924 states. [2019-12-18 14:00:36,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26924 states to 26924 states and 81409 transitions. [2019-12-18 14:00:36,742 INFO L78 Accepts]: Start accepts. Automaton has 26924 states and 81409 transitions. Word has length 64 [2019-12-18 14:00:36,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:00:36,742 INFO L462 AbstractCegarLoop]: Abstraction has 26924 states and 81409 transitions. [2019-12-18 14:00:36,742 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 14:00:36,742 INFO L276 IsEmpty]: Start isEmpty. Operand 26924 states and 81409 transitions. [2019-12-18 14:00:36,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 14:00:36,772 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:00:36,773 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:00:36,773 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:00:36,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:00:36,773 INFO L82 PathProgramCache]: Analyzing trace with hash -1288865556, now seen corresponding path program 8 times [2019-12-18 14:00:36,773 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:00:36,774 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225091856] [2019-12-18 14:00:36,774 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:00:36,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:00:36,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:00:36,825 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225091856] [2019-12-18 14:00:36,825 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:00:36,825 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:00:36,825 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540509665] [2019-12-18 14:00:36,826 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:00:36,826 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:00:36,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:00:36,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:00:36,826 INFO L87 Difference]: Start difference. First operand 26924 states and 81409 transitions. Second operand 3 states. [2019-12-18 14:00:36,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:00:36,935 INFO L93 Difference]: Finished difference Result 26924 states and 81408 transitions. [2019-12-18 14:00:36,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:00:36,936 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-18 14:00:36,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:00:36,972 INFO L225 Difference]: With dead ends: 26924 [2019-12-18 14:00:36,973 INFO L226 Difference]: Without dead ends: 26924 [2019-12-18 14:00:36,973 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:00:37,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26924 states. [2019-12-18 14:00:37,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26924 to 24211. [2019-12-18 14:00:37,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24211 states. [2019-12-18 14:00:37,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24211 states to 24211 states and 73828 transitions. [2019-12-18 14:00:37,563 INFO L78 Accepts]: Start accepts. Automaton has 24211 states and 73828 transitions. Word has length 64 [2019-12-18 14:00:37,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:00:37,563 INFO L462 AbstractCegarLoop]: Abstraction has 24211 states and 73828 transitions. [2019-12-18 14:00:37,563 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:00:37,564 INFO L276 IsEmpty]: Start isEmpty. Operand 24211 states and 73828 transitions. [2019-12-18 14:00:37,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 14:00:37,590 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:00:37,590 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:00:37,591 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:00:37,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:00:37,591 INFO L82 PathProgramCache]: Analyzing trace with hash -610135581, now seen corresponding path program 1 times [2019-12-18 14:00:37,591 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:00:37,591 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541658900] [2019-12-18 14:00:37,592 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:00:37,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:00:37,681 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:00:37,681 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541658900] [2019-12-18 14:00:37,681 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:00:37,681 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 14:00:37,681 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608915418] [2019-12-18 14:00:37,682 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 14:00:37,682 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:00:37,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 14:00:37,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 14:00:37,683 INFO L87 Difference]: Start difference. First operand 24211 states and 73828 transitions. Second operand 7 states. [2019-12-18 14:00:39,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:00:39,226 INFO L93 Difference]: Finished difference Result 38943 states and 115522 transitions. [2019-12-18 14:00:39,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-18 14:00:39,227 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-18 14:00:39,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:00:39,280 INFO L225 Difference]: With dead ends: 38943 [2019-12-18 14:00:39,280 INFO L226 Difference]: Without dead ends: 38647 [2019-12-18 14:00:39,280 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2019-12-18 14:00:39,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38647 states. [2019-12-18 14:00:39,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38647 to 24688. [2019-12-18 14:00:39,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24688 states. [2019-12-18 14:00:39,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24688 states to 24688 states and 75241 transitions. [2019-12-18 14:00:39,762 INFO L78 Accepts]: Start accepts. Automaton has 24688 states and 75241 transitions. Word has length 65 [2019-12-18 14:00:39,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:00:39,762 INFO L462 AbstractCegarLoop]: Abstraction has 24688 states and 75241 transitions. [2019-12-18 14:00:39,762 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 14:00:39,762 INFO L276 IsEmpty]: Start isEmpty. Operand 24688 states and 75241 transitions. [2019-12-18 14:00:39,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 14:00:39,788 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:00:39,788 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:00:39,788 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:00:39,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:00:39,789 INFO L82 PathProgramCache]: Analyzing trace with hash 112305005, now seen corresponding path program 2 times [2019-12-18 14:00:39,789 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:00:39,789 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051167980] [2019-12-18 14:00:39,789 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:00:39,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:00:39,850 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:00:39,850 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051167980] [2019-12-18 14:00:39,850 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:00:39,851 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:00:39,851 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132788885] [2019-12-18 14:00:39,851 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:00:39,851 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:00:39,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:00:39,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:00:39,852 INFO L87 Difference]: Start difference. First operand 24688 states and 75241 transitions. Second operand 3 states. [2019-12-18 14:00:39,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:00:39,949 INFO L93 Difference]: Finished difference Result 20880 states and 62517 transitions. [2019-12-18 14:00:39,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:00:39,950 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-18 14:00:39,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:00:39,991 INFO L225 Difference]: With dead ends: 20880 [2019-12-18 14:00:39,992 INFO L226 Difference]: Without dead ends: 20880 [2019-12-18 14:00:39,992 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:00:40,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20880 states. [2019-12-18 14:00:40,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20880 to 19992. [2019-12-18 14:00:40,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19992 states. [2019-12-18 14:00:40,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19992 states to 19992 states and 59811 transitions. [2019-12-18 14:00:40,333 INFO L78 Accepts]: Start accepts. Automaton has 19992 states and 59811 transitions. Word has length 65 [2019-12-18 14:00:40,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:00:40,333 INFO L462 AbstractCegarLoop]: Abstraction has 19992 states and 59811 transitions. [2019-12-18 14:00:40,333 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:00:40,333 INFO L276 IsEmpty]: Start isEmpty. Operand 19992 states and 59811 transitions. [2019-12-18 14:00:40,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 14:00:40,352 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:00:40,352 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:00:40,352 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:00:40,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:00:40,352 INFO L82 PathProgramCache]: Analyzing trace with hash -424379593, now seen corresponding path program 1 times [2019-12-18 14:00:40,352 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:00:40,352 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144618450] [2019-12-18 14:00:40,353 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:00:40,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:00:40,438 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:00:40,439 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144618450] [2019-12-18 14:00:40,439 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:00:40,439 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 14:00:40,439 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407281212] [2019-12-18 14:00:40,440 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 14:00:40,440 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:00:40,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 14:00:40,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 14:00:40,440 INFO L87 Difference]: Start difference. First operand 19992 states and 59811 transitions. Second operand 7 states. [2019-12-18 14:00:42,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:00:42,108 INFO L93 Difference]: Finished difference Result 29025 states and 85817 transitions. [2019-12-18 14:00:42,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-18 14:00:42,109 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 66 [2019-12-18 14:00:42,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:00:42,146 INFO L225 Difference]: With dead ends: 29025 [2019-12-18 14:00:42,147 INFO L226 Difference]: Without dead ends: 29025 [2019-12-18 14:00:42,147 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=367, Unknown=0, NotChecked=0, Total=462 [2019-12-18 14:00:42,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29025 states. [2019-12-18 14:00:42,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29025 to 20733. [2019-12-18 14:00:42,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20733 states. [2019-12-18 14:00:42,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20733 states to 20733 states and 62164 transitions. [2019-12-18 14:00:42,512 INFO L78 Accepts]: Start accepts. Automaton has 20733 states and 62164 transitions. Word has length 66 [2019-12-18 14:00:42,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:00:42,513 INFO L462 AbstractCegarLoop]: Abstraction has 20733 states and 62164 transitions. [2019-12-18 14:00:42,513 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 14:00:42,513 INFO L276 IsEmpty]: Start isEmpty. Operand 20733 states and 62164 transitions. [2019-12-18 14:00:42,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 14:00:42,532 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:00:42,532 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:00:42,532 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:00:42,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:00:42,533 INFO L82 PathProgramCache]: Analyzing trace with hash 1525087521, now seen corresponding path program 2 times [2019-12-18 14:00:42,533 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:00:42,533 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456305511] [2019-12-18 14:00:42,533 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:00:42,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:00:43,012 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:00:43,013 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456305511] [2019-12-18 14:00:43,013 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:00:43,013 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 14:00:43,013 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385844283] [2019-12-18 14:00:43,013 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 14:00:43,014 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:00:43,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 14:00:43,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2019-12-18 14:00:43,014 INFO L87 Difference]: Start difference. First operand 20733 states and 62164 transitions. Second operand 16 states. [2019-12-18 14:00:48,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:00:48,299 INFO L93 Difference]: Finished difference Result 32902 states and 99465 transitions. [2019-12-18 14:00:48,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-12-18 14:00:48,299 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 66 [2019-12-18 14:00:48,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:00:48,341 INFO L225 Difference]: With dead ends: 32902 [2019-12-18 14:00:48,341 INFO L226 Difference]: Without dead ends: 30054 [2019-12-18 14:00:48,343 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1027 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=560, Invalid=3100, Unknown=0, NotChecked=0, Total=3660 [2019-12-18 14:00:48,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30054 states. [2019-12-18 14:00:48,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30054 to 22243. [2019-12-18 14:00:48,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22243 states. [2019-12-18 14:00:48,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22243 states to 22243 states and 66723 transitions. [2019-12-18 14:00:48,905 INFO L78 Accepts]: Start accepts. Automaton has 22243 states and 66723 transitions. Word has length 66 [2019-12-18 14:00:48,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:00:48,905 INFO L462 AbstractCegarLoop]: Abstraction has 22243 states and 66723 transitions. [2019-12-18 14:00:48,906 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 14:00:48,906 INFO L276 IsEmpty]: Start isEmpty. Operand 22243 states and 66723 transitions. [2019-12-18 14:00:48,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 14:00:48,929 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:00:48,929 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:00:48,929 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:00:48,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:00:48,929 INFO L82 PathProgramCache]: Analyzing trace with hash -1636332497, now seen corresponding path program 3 times [2019-12-18 14:00:48,930 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:00:48,930 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644960524] [2019-12-18 14:00:48,930 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:00:48,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:00:49,079 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:00:49,080 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644960524] [2019-12-18 14:00:49,080 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:00:49,080 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 14:00:49,080 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477629663] [2019-12-18 14:00:49,081 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 14:00:49,081 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:00:49,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 14:00:49,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 14:00:49,081 INFO L87 Difference]: Start difference. First operand 22243 states and 66723 transitions. Second operand 11 states. [2019-12-18 14:00:50,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:00:50,467 INFO L93 Difference]: Finished difference Result 48672 states and 145551 transitions. [2019-12-18 14:00:50,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-12-18 14:00:50,467 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2019-12-18 14:00:50,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:00:50,518 INFO L225 Difference]: With dead ends: 48672 [2019-12-18 14:00:50,518 INFO L226 Difference]: Without dead ends: 36486 [2019-12-18 14:00:50,519 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=203, Invalid=853, Unknown=0, NotChecked=0, Total=1056 [2019-12-18 14:00:50,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36486 states. [2019-12-18 14:00:50,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36486 to 20952. [2019-12-18 14:00:50,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20952 states. [2019-12-18 14:00:50,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20952 states to 20952 states and 62345 transitions. [2019-12-18 14:00:50,945 INFO L78 Accepts]: Start accepts. Automaton has 20952 states and 62345 transitions. Word has length 66 [2019-12-18 14:00:50,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:00:50,945 INFO L462 AbstractCegarLoop]: Abstraction has 20952 states and 62345 transitions. [2019-12-18 14:00:50,945 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 14:00:50,946 INFO L276 IsEmpty]: Start isEmpty. Operand 20952 states and 62345 transitions. [2019-12-18 14:00:50,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 14:00:50,968 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:00:50,968 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:00:50,968 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:00:50,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:00:50,968 INFO L82 PathProgramCache]: Analyzing trace with hash 991178411, now seen corresponding path program 4 times [2019-12-18 14:00:50,968 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:00:50,968 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267546558] [2019-12-18 14:00:50,969 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:00:50,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:00:51,070 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:00:51,071 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267546558] [2019-12-18 14:00:51,071 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:00:51,071 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 14:00:51,071 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502671216] [2019-12-18 14:00:51,071 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 14:00:51,072 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:00:51,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 14:00:51,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-18 14:00:51,072 INFO L87 Difference]: Start difference. First operand 20952 states and 62345 transitions. Second operand 9 states. [2019-12-18 14:00:52,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:00:52,396 INFO L93 Difference]: Finished difference Result 32761 states and 97040 transitions. [2019-12-18 14:00:52,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-18 14:00:52,396 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 66 [2019-12-18 14:00:52,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:00:52,440 INFO L225 Difference]: With dead ends: 32761 [2019-12-18 14:00:52,441 INFO L226 Difference]: Without dead ends: 31869 [2019-12-18 14:00:52,441 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2019-12-18 14:00:52,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31869 states. [2019-12-18 14:00:53,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31869 to 20544. [2019-12-18 14:00:53,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20544 states. [2019-12-18 14:00:53,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20544 states to 20544 states and 61168 transitions. [2019-12-18 14:00:53,048 INFO L78 Accepts]: Start accepts. Automaton has 20544 states and 61168 transitions. Word has length 66 [2019-12-18 14:00:53,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:00:53,048 INFO L462 AbstractCegarLoop]: Abstraction has 20544 states and 61168 transitions. [2019-12-18 14:00:53,048 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 14:00:53,048 INFO L276 IsEmpty]: Start isEmpty. Operand 20544 states and 61168 transitions. [2019-12-18 14:00:53,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 14:00:53,067 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:00:53,067 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:00:53,067 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:00:53,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:00:53,068 INFO L82 PathProgramCache]: Analyzing trace with hash 103775479, now seen corresponding path program 5 times [2019-12-18 14:00:53,068 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:00:53,068 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856366446] [2019-12-18 14:00:53,068 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:00:53,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:00:53,309 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:00:53,309 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856366446] [2019-12-18 14:00:53,310 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:00:53,310 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 14:00:53,310 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058292939] [2019-12-18 14:00:53,311 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 14:00:53,311 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:00:53,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 14:00:53,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-12-18 14:00:53,312 INFO L87 Difference]: Start difference. First operand 20544 states and 61168 transitions. Second operand 11 states. [2019-12-18 14:00:55,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:00:55,915 INFO L93 Difference]: Finished difference Result 33420 states and 97455 transitions. [2019-12-18 14:00:55,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-18 14:00:55,916 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2019-12-18 14:00:55,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:00:55,958 INFO L225 Difference]: With dead ends: 33420 [2019-12-18 14:00:55,958 INFO L226 Difference]: Without dead ends: 33420 [2019-12-18 14:00:55,959 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=126, Invalid=524, Unknown=0, NotChecked=0, Total=650 [2019-12-18 14:00:56,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33420 states. [2019-12-18 14:00:56,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33420 to 19534. [2019-12-18 14:00:56,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19534 states. [2019-12-18 14:00:56,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19534 states to 19534 states and 57758 transitions. [2019-12-18 14:00:56,339 INFO L78 Accepts]: Start accepts. Automaton has 19534 states and 57758 transitions. Word has length 66 [2019-12-18 14:00:56,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:00:56,339 INFO L462 AbstractCegarLoop]: Abstraction has 19534 states and 57758 transitions. [2019-12-18 14:00:56,339 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 14:00:56,339 INFO L276 IsEmpty]: Start isEmpty. Operand 19534 states and 57758 transitions. [2019-12-18 14:00:56,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 14:00:56,358 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:00:56,358 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:00:56,358 INFO L410 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:00:56,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:00:56,358 INFO L82 PathProgramCache]: Analyzing trace with hash 328971281, now seen corresponding path program 6 times [2019-12-18 14:00:56,359 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:00:56,359 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643359686] [2019-12-18 14:00:56,359 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:00:56,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:00:56,450 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:00:56,451 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643359686] [2019-12-18 14:00:56,451 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:00:56,451 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 14:00:56,452 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230721764] [2019-12-18 14:00:56,452 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 14:00:56,452 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:00:56,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 14:00:56,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 14:00:56,453 INFO L87 Difference]: Start difference. First operand 19534 states and 57758 transitions. Second operand 4 states. [2019-12-18 14:00:56,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:00:56,632 INFO L93 Difference]: Finished difference Result 22944 states and 67926 transitions. [2019-12-18 14:00:56,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:00:56,633 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-12-18 14:00:56,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:00:56,672 INFO L225 Difference]: With dead ends: 22944 [2019-12-18 14:00:56,672 INFO L226 Difference]: Without dead ends: 22944 [2019-12-18 14:00:56,672 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 2 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:00:56,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22944 states. [2019-12-18 14:00:57,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22944 to 17698. [2019-12-18 14:00:57,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17698 states. [2019-12-18 14:00:57,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17698 states to 17698 states and 52659 transitions. [2019-12-18 14:00:57,034 INFO L78 Accepts]: Start accepts. Automaton has 17698 states and 52659 transitions. Word has length 66 [2019-12-18 14:00:57,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:00:57,034 INFO L462 AbstractCegarLoop]: Abstraction has 17698 states and 52659 transitions. [2019-12-18 14:00:57,035 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 14:00:57,035 INFO L276 IsEmpty]: Start isEmpty. Operand 17698 states and 52659 transitions. [2019-12-18 14:00:57,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 14:00:57,052 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:00:57,052 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:00:57,052 INFO L410 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:00:57,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:00:57,052 INFO L82 PathProgramCache]: Analyzing trace with hash 1945562630, now seen corresponding path program 1 times [2019-12-18 14:00:57,052 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:00:57,053 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201530862] [2019-12-18 14:00:57,053 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:00:57,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:00:57,450 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:00:57,450 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201530862] [2019-12-18 14:00:57,451 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:00:57,451 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 14:00:57,451 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406072536] [2019-12-18 14:00:57,451 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 14:00:57,451 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:00:57,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 14:00:57,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2019-12-18 14:00:57,452 INFO L87 Difference]: Start difference. First operand 17698 states and 52659 transitions. Second operand 16 states. [2019-12-18 14:01:01,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:01:01,249 INFO L93 Difference]: Finished difference Result 33329 states and 98276 transitions. [2019-12-18 14:01:01,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-12-18 14:01:01,249 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 67 [2019-12-18 14:01:01,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:01:01,296 INFO L225 Difference]: With dead ends: 33329 [2019-12-18 14:01:01,296 INFO L226 Difference]: Without dead ends: 32780 [2019-12-18 14:01:01,297 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 668 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=426, Invalid=2226, Unknown=0, NotChecked=0, Total=2652 [2019-12-18 14:01:01,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32780 states. [2019-12-18 14:01:01,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32780 to 17444. [2019-12-18 14:01:01,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17444 states. [2019-12-18 14:01:01,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17444 states to 17444 states and 52015 transitions. [2019-12-18 14:01:01,697 INFO L78 Accepts]: Start accepts. Automaton has 17444 states and 52015 transitions. Word has length 67 [2019-12-18 14:01:01,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:01:01,698 INFO L462 AbstractCegarLoop]: Abstraction has 17444 states and 52015 transitions. [2019-12-18 14:01:01,698 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 14:01:01,698 INFO L276 IsEmpty]: Start isEmpty. Operand 17444 states and 52015 transitions. [2019-12-18 14:01:01,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 14:01:01,718 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:01:01,718 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:01:01,719 INFO L410 AbstractCegarLoop]: === Iteration 35 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:01:01,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:01:01,719 INFO L82 PathProgramCache]: Analyzing trace with hash 121505500, now seen corresponding path program 2 times [2019-12-18 14:01:01,719 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:01:01,719 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908349585] [2019-12-18 14:01:01,719 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:01:01,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:01:01,861 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:01:01,861 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908349585] [2019-12-18 14:01:01,862 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:01:01,862 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 14:01:01,862 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496568158] [2019-12-18 14:01:01,862 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 14:01:01,862 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:01:01,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 14:01:01,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 14:01:01,863 INFO L87 Difference]: Start difference. First operand 17444 states and 52015 transitions. Second operand 9 states. [2019-12-18 14:01:03,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:01:03,971 INFO L93 Difference]: Finished difference Result 28791 states and 84362 transitions. [2019-12-18 14:01:03,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-18 14:01:03,971 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 67 [2019-12-18 14:01:03,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:01:04,009 INFO L225 Difference]: With dead ends: 28791 [2019-12-18 14:01:04,009 INFO L226 Difference]: Without dead ends: 28791 [2019-12-18 14:01:04,010 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=112, Invalid=488, Unknown=0, NotChecked=0, Total=600 [2019-12-18 14:01:04,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28791 states. [2019-12-18 14:01:04,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28791 to 18906. [2019-12-18 14:01:04,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18906 states. [2019-12-18 14:01:04,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18906 states to 18906 states and 56261 transitions. [2019-12-18 14:01:04,354 INFO L78 Accepts]: Start accepts. Automaton has 18906 states and 56261 transitions. Word has length 67 [2019-12-18 14:01:04,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:01:04,355 INFO L462 AbstractCegarLoop]: Abstraction has 18906 states and 56261 transitions. [2019-12-18 14:01:04,355 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 14:01:04,355 INFO L276 IsEmpty]: Start isEmpty. Operand 18906 states and 56261 transitions. [2019-12-18 14:01:04,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 14:01:04,375 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:01:04,375 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:01:04,376 INFO L410 AbstractCegarLoop]: === Iteration 36 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:01:04,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:01:04,376 INFO L82 PathProgramCache]: Analyzing trace with hash 190726530, now seen corresponding path program 3 times [2019-12-18 14:01:04,376 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:01:04,376 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52504159] [2019-12-18 14:01:04,376 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:01:04,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:01:04,470 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:01:04,470 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52504159] [2019-12-18 14:01:04,470 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:01:04,470 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 14:01:04,471 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790915983] [2019-12-18 14:01:04,471 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 14:01:04,471 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:01:04,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 14:01:04,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:01:04,472 INFO L87 Difference]: Start difference. First operand 18906 states and 56261 transitions. Second operand 5 states. [2019-12-18 14:01:04,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:01:04,629 INFO L93 Difference]: Finished difference Result 18726 states and 55463 transitions. [2019-12-18 14:01:04,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 14:01:04,630 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2019-12-18 14:01:04,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:01:04,658 INFO L225 Difference]: With dead ends: 18726 [2019-12-18 14:01:04,658 INFO L226 Difference]: Without dead ends: 18726 [2019-12-18 14:01:04,658 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-18 14:01:04,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18726 states. [2019-12-18 14:01:05,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18726 to 16738. [2019-12-18 14:01:05,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16738 states. [2019-12-18 14:01:05,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16738 states to 16738 states and 49511 transitions. [2019-12-18 14:01:05,069 INFO L78 Accepts]: Start accepts. Automaton has 16738 states and 49511 transitions. Word has length 67 [2019-12-18 14:01:05,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:01:05,069 INFO L462 AbstractCegarLoop]: Abstraction has 16738 states and 49511 transitions. [2019-12-18 14:01:05,070 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 14:01:05,070 INFO L276 IsEmpty]: Start isEmpty. Operand 16738 states and 49511 transitions. [2019-12-18 14:01:05,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 14:01:05,089 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:01:05,089 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:01:05,089 INFO L410 AbstractCegarLoop]: === Iteration 37 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:01:05,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:01:05,090 INFO L82 PathProgramCache]: Analyzing trace with hash -778064925, now seen corresponding path program 1 times [2019-12-18 14:01:05,090 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:01:05,090 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751119992] [2019-12-18 14:01:05,090 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:01:05,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 14:01:05,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 14:01:05,230 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 14:01:05,232 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 14:01:05,237 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [891] [891] ULTIMATE.startENTRY-->L818: Formula: (let ((.cse0 (store |v_#valid_82| 0 0))) (and (= v_~z$r_buff0_thd0~0_144 0) (= v_~z$r_buff0_thd1~0_230 0) (= v_~z$w_buff0_used~0_947 0) (= v_~z$r_buff1_thd1~0_185 0) (= v_~z$read_delayed_var~0.offset_6 0) (= |v_#NULL.offset_7| 0) (= v_~z$w_buff1_used~0_563 0) (= v_~weak$$choice2~0_147 0) (= 0 v_~z$r_buff1_thd3~0_352) (= 0 v_~x~0_159) (< 0 |v_#StackHeapBarrier_17|) (= v_~z$read_delayed~0_6 0) (= v_~z$mem_tmp~0_24 0) (= |v_#valid_80| (store .cse0 |v_ULTIMATE.start_main_~#t1489~0.base_44| 1)) (= v_~z$r_buff0_thd2~0_126 0) (= 0 v_~__unbuffered_p2_EAX~0_47) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t1489~0.base_44| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t1489~0.base_44|) |v_ULTIMATE.start_main_~#t1489~0.offset_28| 0)) |v_#memory_int_19|) (= v_~z$read_delayed_var~0.base_6 0) (= v_~__unbuffered_cnt~0_155 0) (= |v_ULTIMATE.start_main_~#t1489~0.offset_28| 0) (= v_~z$r_buff1_thd2~0_201 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1489~0.base_44|)) (= 0 v_~z$r_buff0_thd3~0_371) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t1489~0.base_44|) (= v_~main$tmp_guard1~0_38 0) (= v_~z$r_buff1_thd0~0_199 0) (= (store |v_#length_22| |v_ULTIMATE.start_main_~#t1489~0.base_44| 4) |v_#length_21|) (= 0 |v_#NULL.base_7|) (= 0 v_~weak$$choice0~0_19) (= v_~z$w_buff1~0_328 0) (= v_~z~0_152 0) (= v_~z$w_buff0~0_540 0) (= v_~main$tmp_guard0~0_22 0) (= 0 v_~z$flush_delayed~0_35) (= v_~y~0_49 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_82|, #memory_int=|v_#memory_int_20|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_~#t1490~0.base=|v_ULTIMATE.start_main_~#t1490~0.base_44|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_201, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_59|, ~z$read_delayed~0=v_~z$read_delayed~0_6, ~z$w_buff1~0=v_~z$w_buff1~0_328, #NULL.offset=|v_#NULL.offset_7|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_37|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_38, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_99|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_31|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_75|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_144, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_31|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_199, #length=|v_#length_21|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_47, ~y~0=v_~y~0_49, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_126, ULTIMATE.start_main_~#t1491~0.base=|v_ULTIMATE.start_main_~#t1491~0.base_25|, ~z$mem_tmp~0=v_~z$mem_tmp~0_24, ULTIMATE.start_main_~#t1489~0.base=|v_ULTIMATE.start_main_~#t1489~0.base_44|, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_19|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_947, ~z$w_buff0~0=v_~z$w_buff0~0_540, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_7|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_352, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_8|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_563, ULTIMATE.start_main_~#t1491~0.offset=|v_ULTIMATE.start_main_~#t1491~0.offset_18|, ~z$flush_delayed~0=v_~z$flush_delayed~0_35, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_22, ULTIMATE.start_main_~#t1489~0.offset=|v_ULTIMATE.start_main_~#t1489~0.offset_28|, #NULL.base=|v_#NULL.base_7|, ~weak$$choice0~0=v_~weak$$choice0~0_19, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_26|, #valid=|v_#valid_80|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_185, #memory_int=|v_#memory_int_19|, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_6, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_371, ULTIMATE.start_main_~#t1490~0.offset=|v_ULTIMATE.start_main_~#t1490~0.offset_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_155, ~z~0=v_~z~0_152, ~weak$$choice2~0=v_~weak$$choice2~0_147, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_230, ~x~0=v_~x~0_159} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1490~0.base, ~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, ~z$read_delayed~0, ~z$w_buff1~0, #NULL.offset, ULTIMATE.start_main_#t~ite49, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ~z$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite51, ~z$r_buff1_thd0~0, #length, ~__unbuffered_p2_EAX~0, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_~#t1491~0.base, ~z$mem_tmp~0, ULTIMATE.start_main_~#t1489~0.base, ULTIMATE.start_main_#t~nondet46, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_#t~nondet44, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~nondet45, ~z$w_buff1_used~0, ULTIMATE.start_main_~#t1491~0.offset, ~z$flush_delayed~0, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t1489~0.offset, #NULL.base, ~weak$$choice0~0, ULTIMATE.start_main_#res, #valid, ~z$r_buff1_thd1~0, #memory_int, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ULTIMATE.start_main_~#t1490~0.offset, ~__unbuffered_cnt~0, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0, ~x~0] because there is no mapped edge [2019-12-18 14:01:05,238 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [857] [857] L818-1-->L820: Formula: (and (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t1490~0.base_13|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1490~0.base_13| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1490~0.base_13|) |v_ULTIMATE.start_main_~#t1490~0.offset_11| 1)) |v_#memory_int_13|) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t1490~0.base_13| 4) |v_#length_15|) (not (= |v_ULTIMATE.start_main_~#t1490~0.base_13| 0)) (= 0 (select |v_#valid_37| |v_ULTIMATE.start_main_~#t1490~0.base_13|)) (= (store |v_#valid_37| |v_ULTIMATE.start_main_~#t1490~0.base_13| 1) |v_#valid_36|) (= 0 |v_ULTIMATE.start_main_~#t1490~0.offset_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_~#t1490~0.base=|v_ULTIMATE.start_main_~#t1490~0.base_13|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_5|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t1490~0.offset=|v_ULTIMATE.start_main_~#t1490~0.offset_11|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1490~0.base, ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, ULTIMATE.start_main_~#t1490~0.offset, #length] because there is no mapped edge [2019-12-18 14:01:05,238 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [868] [868] L820-1-->L822: Formula: (and (= 0 (select |v_#valid_41| |v_ULTIMATE.start_main_~#t1491~0.base_13|)) (not (= 0 |v_ULTIMATE.start_main_~#t1491~0.base_13|)) (= |v_#valid_40| (store |v_#valid_41| |v_ULTIMATE.start_main_~#t1491~0.base_13| 1)) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1491~0.base_13| 4)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1491~0.base_13|) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1491~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1491~0.base_13|) |v_ULTIMATE.start_main_~#t1491~0.offset_11| 2)) |v_#memory_int_15|) (= 0 |v_ULTIMATE.start_main_~#t1491~0.offset_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_40|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_6|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~#t1491~0.offset=|v_ULTIMATE.start_main_~#t1491~0.offset_11|, #length=|v_#length_17|, ULTIMATE.start_main_~#t1491~0.base=|v_ULTIMATE.start_main_~#t1491~0.base_13|} AuxVars[] AssignedVars[#valid, ULTIMATE.start_main_#t~nondet45, #memory_int, ULTIMATE.start_main_~#t1491~0.offset, #length, ULTIMATE.start_main_~#t1491~0.base] because there is no mapped edge [2019-12-18 14:01:05,239 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [779] [779] P0ENTRY-->L4-3: Formula: (and (= v_~z$w_buff0_used~0_163 v_~z$w_buff1_used~0_112) (= 1 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_14|) (= v_~z$w_buff0~0_38 v_~z$w_buff1~0_37) (= v_P0Thread1of1ForFork0_~arg.base_14 |v_P0Thread1of1ForFork0_#in~arg.base_14|) (= v_~z$w_buff0_used~0_162 1) (= 1 v_~z$w_buff0~0_37) (= v_P0Thread1of1ForFork0_~arg.offset_14 |v_P0Thread1of1ForFork0_#in~arg.offset_14|) (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_16 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_14|) (= (mod v_~z$w_buff1_used~0_112 256) 0)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_14|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_163, ~z$w_buff0~0=v_~z$w_buff0~0_38, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_14|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_14|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_162, ~z$w_buff0~0=v_~z$w_buff0~0_37, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_16, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_112, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_14|, ~z$w_buff1~0=v_~z$w_buff1~0_37, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_14, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_14|, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_14} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$w_buff0~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression, ~z$w_buff1_used~0, ~z$w_buff1~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-18 14:01:05,244 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [873] [873] L784-->L784-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1051686668 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork2_#t~ite20_In1051686668| |P2Thread1of1ForFork2_#t~ite20_Out1051686668|) (= ~z$w_buff0~0_In1051686668 |P2Thread1of1ForFork2_#t~ite21_Out1051686668|)) (and (= |P2Thread1of1ForFork2_#t~ite20_Out1051686668| ~z$w_buff0~0_In1051686668) (= |P2Thread1of1ForFork2_#t~ite20_Out1051686668| |P2Thread1of1ForFork2_#t~ite21_Out1051686668|) (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In1051686668 256) 0))) (or (and (= (mod ~z$w_buff1_used~0_In1051686668 256) 0) .cse1) (and .cse1 (= (mod ~z$r_buff1_thd3~0_In1051686668 256) 0)) (= (mod ~z$w_buff0_used~0_In1051686668 256) 0))) .cse0))) InVars {~z$w_buff0~0=~z$w_buff0~0_In1051686668, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1051686668, P2Thread1of1ForFork2_#t~ite20=|P2Thread1of1ForFork2_#t~ite20_In1051686668|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1051686668, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1051686668, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1051686668, ~weak$$choice2~0=~weak$$choice2~0_In1051686668} OutVars{~z$w_buff0~0=~z$w_buff0~0_In1051686668, P2Thread1of1ForFork2_#t~ite20=|P2Thread1of1ForFork2_#t~ite20_Out1051686668|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1051686668, P2Thread1of1ForFork2_#t~ite21=|P2Thread1of1ForFork2_#t~ite21_Out1051686668|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1051686668, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1051686668, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1051686668, ~weak$$choice2~0=~weak$$choice2~0_In1051686668} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite20, P2Thread1of1ForFork2_#t~ite21] because there is no mapped edge [2019-12-18 14:01:05,247 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L762-2-->L762-5: Formula: (let ((.cse2 (= (mod ~z$w_buff1_used~0_In-1716952169 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd2~0_In-1716952169 256))) (.cse0 (= |P1Thread1of1ForFork1_#t~ite9_Out-1716952169| |P1Thread1of1ForFork1_#t~ite10_Out-1716952169|))) (or (and (= |P1Thread1of1ForFork1_#t~ite9_Out-1716952169| ~z~0_In-1716952169) .cse0 (or .cse1 .cse2)) (and (not .cse2) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite9_Out-1716952169| ~z$w_buff1~0_In-1716952169) .cse0))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1716952169, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1716952169, ~z$w_buff1~0=~z$w_buff1~0_In-1716952169, ~z~0=~z~0_In-1716952169} OutVars{P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out-1716952169|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1716952169, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1716952169, P1Thread1of1ForFork1_#t~ite10=|P1Thread1of1ForFork1_#t~ite10_Out-1716952169|, ~z$w_buff1~0=~z$w_buff1~0_In-1716952169, ~z~0=~z~0_In-1716952169} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite10] because there is no mapped edge [2019-12-18 14:01:05,248 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L743-->L743-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd1~0_In-1095456644 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In-1095456644 256) 0))) (or (and (not .cse0) (= 0 |P0Thread1of1ForFork0_#t~ite5_Out-1095456644|) (not .cse1)) (and (or .cse1 .cse0) (= ~z$w_buff0_used~0_In-1095456644 |P0Thread1of1ForFork0_#t~ite5_Out-1095456644|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1095456644, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1095456644} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-1095456644|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1095456644, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1095456644} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-18 14:01:05,249 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [839] [839] L744-->L744-2: Formula: (let ((.cse1 (= (mod ~z$r_buff1_thd1~0_In642099836 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In642099836 256))) (.cse3 (= (mod ~z$w_buff0_used~0_In642099836 256) 0)) (.cse2 (= (mod ~z$r_buff0_thd1~0_In642099836 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite6_Out642099836| 0)) (and (or .cse1 .cse0) (= |P0Thread1of1ForFork0_#t~ite6_Out642099836| ~z$w_buff1_used~0_In642099836) (or .cse3 .cse2)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In642099836, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In642099836, ~z$w_buff1_used~0=~z$w_buff1_used~0_In642099836, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In642099836} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out642099836|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In642099836, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In642099836, ~z$w_buff1_used~0=~z$w_buff1_used~0_In642099836, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In642099836} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-18 14:01:05,250 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L745-->L746: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In546318595 256))) (.cse0 (= (mod ~z$r_buff0_thd1~0_In546318595 256) 0))) (or (and (not .cse0) (not .cse1) (= ~z$r_buff0_thd1~0_Out546318595 0)) (and (= ~z$r_buff0_thd1~0_Out546318595 ~z$r_buff0_thd1~0_In546318595) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In546318595, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In546318595} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In546318595, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out546318595|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out546318595} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 14:01:05,251 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [822] [822] L763-->L763-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In915145033 256))) (.cse0 (= (mod ~z$r_buff0_thd2~0_In915145033 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite11_Out915145033| ~z$w_buff0_used~0_In915145033) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite11_Out915145033| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In915145033, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In915145033} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In915145033, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out915145033|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In915145033} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-18 14:01:05,252 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L764-->L764-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff1_thd2~0_In1482256415 256))) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In1482256415 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In1482256415 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In1482256415 256)))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite12_Out1482256415|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse1 .cse0) (= ~z$w_buff1_used~0_In1482256415 |P1Thread1of1ForFork1_#t~ite12_Out1482256415|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1482256415, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1482256415, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1482256415, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1482256415} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1482256415, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1482256415, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1482256415, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out1482256415|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1482256415} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-18 14:01:05,252 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [819] [819] L765-->L765-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd2~0_In1658193905 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In1658193905 256)))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite13_Out1658193905| 0) (not .cse1)) (and (= ~z$r_buff0_thd2~0_In1658193905 |P1Thread1of1ForFork1_#t~ite13_Out1658193905|) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1658193905, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1658193905} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1658193905, P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out1658193905|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1658193905} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13] because there is no mapped edge [2019-12-18 14:01:05,253 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [824] [824] L766-->L766-2: Formula: (let ((.cse3 (= (mod ~z$r_buff0_thd2~0_In-2140932678 256) 0)) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In-2140932678 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In-2140932678 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd2~0_In-2140932678 256)))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite14_Out-2140932678|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse0 .cse1) (= ~z$r_buff1_thd2~0_In-2140932678 |P1Thread1of1ForFork1_#t~ite14_Out-2140932678|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-2140932678, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-2140932678, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2140932678, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-2140932678} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-2140932678, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-2140932678, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2140932678, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out-2140932678|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-2140932678} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-18 14:01:05,253 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [854] [854] L766-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= |v_P1Thread1of1ForFork1_#t~ite14_30| v_~z$r_buff1_thd2~0_92) (= v_~__unbuffered_cnt~0_57 (+ v_~__unbuffered_cnt~0_58 1)) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_58, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_30|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_92, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_57, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_29|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-18 14:01:05,254 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [810] [810] L788-->L789: Formula: (and (= v_~z$r_buff0_thd3~0_137 v_~z$r_buff0_thd3~0_136) (not (= (mod v_~weak$$choice2~0_34 256) 0))) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_137, ~weak$$choice2~0=v_~weak$$choice2~0_34} OutVars{P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_12|, P2Thread1of1ForFork2_#t~ite33=|v_P2Thread1of1ForFork2_#t~ite33_9|, P2Thread1of1ForFork2_#t~ite32=|v_P2Thread1of1ForFork2_#t~ite32_11|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_136, ~weak$$choice2~0=v_~weak$$choice2~0_34} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite31, P2Thread1of1ForFork2_#t~ite33, P2Thread1of1ForFork2_#t~ite32, ~z$r_buff0_thd3~0] because there is no mapped edge [2019-12-18 14:01:05,254 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [871] [871] L789-->L789-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1116303200 256) 0))) (or (and (= |P2Thread1of1ForFork2_#t~ite35_Out1116303200| |P2Thread1of1ForFork2_#t~ite36_Out1116303200|) (= |P2Thread1of1ForFork2_#t~ite35_Out1116303200| ~z$r_buff1_thd3~0_In1116303200) .cse0 (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In1116303200 256)))) (or (and (= 0 (mod ~z$w_buff1_used~0_In1116303200 256)) .cse1) (= (mod ~z$w_buff0_used~0_In1116303200 256) 0) (and (= 0 (mod ~z$r_buff1_thd3~0_In1116303200 256)) .cse1)))) (and (= ~z$r_buff1_thd3~0_In1116303200 |P2Thread1of1ForFork2_#t~ite36_Out1116303200|) (not .cse0) (= |P2Thread1of1ForFork2_#t~ite35_In1116303200| |P2Thread1of1ForFork2_#t~ite35_Out1116303200|)))) InVars {P2Thread1of1ForFork2_#t~ite35=|P2Thread1of1ForFork2_#t~ite35_In1116303200|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1116303200, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1116303200, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1116303200, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1116303200, ~weak$$choice2~0=~weak$$choice2~0_In1116303200} OutVars{P2Thread1of1ForFork2_#t~ite35=|P2Thread1of1ForFork2_#t~ite35_Out1116303200|, P2Thread1of1ForFork2_#t~ite36=|P2Thread1of1ForFork2_#t~ite36_Out1116303200|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1116303200, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1116303200, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1116303200, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1116303200, ~weak$$choice2~0=~weak$$choice2~0_In1116303200} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite35, P2Thread1of1ForFork2_#t~ite36] because there is no mapped edge [2019-12-18 14:01:05,255 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [813] [813] L791-->L795: Formula: (and (not (= 0 (mod v_~z$flush_delayed~0_10 256))) (= 0 v_~z$flush_delayed~0_9) (= v_~z~0_62 v_~z$mem_tmp~0_7)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_7, ~z$flush_delayed~0=v_~z$flush_delayed~0_10} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_7, P2Thread1of1ForFork2_#t~ite37=|v_P2Thread1of1ForFork2_#t~ite37_7|, ~z$flush_delayed~0=v_~z$flush_delayed~0_9, ~z~0=v_~z~0_62} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite37, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-18 14:01:05,256 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L795-2-->L795-5: Formula: (let ((.cse2 (= (mod ~z$w_buff1_used~0_In-1993310073 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd3~0_In-1993310073 256))) (.cse0 (= |P2Thread1of1ForFork2_#t~ite39_Out-1993310073| |P2Thread1of1ForFork2_#t~ite38_Out-1993310073|))) (or (and (= |P2Thread1of1ForFork2_#t~ite38_Out-1993310073| ~z~0_In-1993310073) .cse0 (or .cse1 .cse2)) (and (not .cse2) (not .cse1) .cse0 (= |P2Thread1of1ForFork2_#t~ite38_Out-1993310073| ~z$w_buff1~0_In-1993310073)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1993310073, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1993310073, ~z$w_buff1~0=~z$w_buff1~0_In-1993310073, ~z~0=~z~0_In-1993310073} OutVars{~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1993310073, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1993310073, ~z$w_buff1~0=~z$w_buff1~0_In-1993310073, ~z~0=~z~0_In-1993310073, P2Thread1of1ForFork2_#t~ite39=|P2Thread1of1ForFork2_#t~ite39_Out-1993310073|, P2Thread1of1ForFork2_#t~ite38=|P2Thread1of1ForFork2_#t~ite38_Out-1993310073|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite39, P2Thread1of1ForFork2_#t~ite38] because there is no mapped edge [2019-12-18 14:01:05,256 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [835] [835] L796-->L796-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In351802758 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd3~0_In351802758 256) 0))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In351802758 |P2Thread1of1ForFork2_#t~ite40_Out351802758|)) (and (= 0 |P2Thread1of1ForFork2_#t~ite40_Out351802758|) (not .cse1) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In351802758, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In351802758} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In351802758, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In351802758, P2Thread1of1ForFork2_#t~ite40=|P2Thread1of1ForFork2_#t~ite40_Out351802758|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite40] because there is no mapped edge [2019-12-18 14:01:05,257 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L797-->L797-2: Formula: (let ((.cse3 (= (mod ~z$r_buff1_thd3~0_In-1409482869 256) 0)) (.cse2 (= (mod ~z$w_buff1_used~0_In-1409482869 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In-1409482869 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-1409482869 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite41_Out-1409482869| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= |P2Thread1of1ForFork2_#t~ite41_Out-1409482869| ~z$w_buff1_used~0_In-1409482869) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1409482869, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1409482869, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1409482869, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1409482869} OutVars{P2Thread1of1ForFork2_#t~ite41=|P2Thread1of1ForFork2_#t~ite41_Out-1409482869|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1409482869, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1409482869, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1409482869, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1409482869} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite41] because there is no mapped edge [2019-12-18 14:01:05,258 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L798-->L798-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-1829808608 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd3~0_In-1829808608 256) 0))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite42_Out-1829808608| ~z$r_buff0_thd3~0_In-1829808608)) (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork2_#t~ite42_Out-1829808608| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1829808608, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1829808608} OutVars{P2Thread1of1ForFork2_#t~ite42=|P2Thread1of1ForFork2_#t~ite42_Out-1829808608|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1829808608, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1829808608} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite42] because there is no mapped edge [2019-12-18 14:01:05,258 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [818] [818] L799-->L799-2: Formula: (let ((.cse3 (= 0 (mod ~z$w_buff0_used~0_In677552315 256))) (.cse2 (= 0 (mod ~z$r_buff0_thd3~0_In677552315 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd3~0_In677552315 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In677552315 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite43_Out677552315| ~z$r_buff1_thd3~0_In677552315) (or .cse2 .cse3)) (and (= |P2Thread1of1ForFork2_#t~ite43_Out677552315| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In677552315, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In677552315, ~z$w_buff1_used~0=~z$w_buff1_used~0_In677552315, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In677552315} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In677552315, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In677552315, P2Thread1of1ForFork2_#t~ite43=|P2Thread1of1ForFork2_#t~ite43_Out677552315|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In677552315, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In677552315} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite43] because there is no mapped edge [2019-12-18 14:01:05,258 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [851] [851] L799-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_52 1) v_~__unbuffered_cnt~0_51) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0) (= v_~z$r_buff1_thd3~0_167 |v_P2Thread1of1ForFork2_#t~ite43_40|)) InVars {P2Thread1of1ForFork2_#t~ite43=|v_P2Thread1of1ForFork2_#t~ite43_40|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_52} OutVars{~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_167, P2Thread1of1ForFork2_#t~ite43=|v_P2Thread1of1ForFork2_#t~ite43_39|, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_51, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|} AuxVars[] AssignedVars[~z$r_buff1_thd3~0, P2Thread1of1ForFork2_#t~ite43, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-18 14:01:05,259 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L746-->L746-2: Formula: (let ((.cse2 (= (mod ~z$w_buff1_used~0_In1017931796 256) 0)) (.cse3 (= (mod ~z$r_buff1_thd1~0_In1017931796 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd1~0_In1017931796 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In1017931796 256)))) (or (and (= ~z$r_buff1_thd1~0_In1017931796 |P0Thread1of1ForFork0_#t~ite8_Out1017931796|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= |P0Thread1of1ForFork0_#t~ite8_Out1017931796| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1017931796, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1017931796, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1017931796, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1017931796} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1017931796, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out1017931796|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1017931796, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1017931796, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1017931796} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-18 14:01:05,259 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [870] [870] L746-2-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= v_~z$r_buff1_thd1~0_159 |v_P0Thread1of1ForFork0_#t~ite8_44|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= v_~__unbuffered_cnt~0_90 (+ v_~__unbuffered_cnt~0_91 1))) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_44|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_91} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_43|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_159, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_90} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, ~z$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-18 14:01:05,259 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L822-1-->L828: Formula: (and (= 3 v_~__unbuffered_cnt~0_14) (= v_~main$tmp_guard0~0_6 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 14:01:05,260 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L828-2-->L828-5: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In10688317 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In10688317 256) 0)) (.cse2 (= |ULTIMATE.start_main_#t~ite48_Out10688317| |ULTIMATE.start_main_#t~ite47_Out10688317|))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite47_Out10688317| ~z~0_In10688317) .cse2) (and (not .cse1) (not .cse0) .cse2 (= |ULTIMATE.start_main_#t~ite47_Out10688317| ~z$w_buff1~0_In10688317)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In10688317, ~z$w_buff1_used~0=~z$w_buff1_used~0_In10688317, ~z$w_buff1~0=~z$w_buff1~0_In10688317, ~z~0=~z~0_In10688317} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In10688317, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out10688317|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In10688317, ~z$w_buff1~0=~z$w_buff1~0_In10688317, ULTIMATE.start_main_#t~ite48=|ULTIMATE.start_main_#t~ite48_Out10688317|, ~z~0=~z~0_In10688317} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-18 14:01:05,260 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [823] [823] L829-->L829-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-1682923523 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd0~0_In-1682923523 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite49_Out-1682923523| 0) (not .cse1)) (and (= ~z$w_buff0_used~0_In-1682923523 |ULTIMATE.start_main_#t~ite49_Out-1682923523|) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1682923523, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1682923523} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1682923523, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1682923523, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out-1682923523|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-18 14:01:05,261 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [842] [842] L830-->L830-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff0_thd0~0_In2129620615 256))) (.cse3 (= (mod ~z$w_buff0_used~0_In2129620615 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In2129620615 256))) (.cse1 (= (mod ~z$r_buff1_thd0~0_In2129620615 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite50_Out2129620615| 0)) (and (or .cse2 .cse3) (= ~z$w_buff1_used~0_In2129620615 |ULTIMATE.start_main_#t~ite50_Out2129620615|) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2129620615, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2129620615, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In2129620615, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2129620615} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out2129620615|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2129620615, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2129620615, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In2129620615, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2129620615} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-18 14:01:05,262 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L831-->L831-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In1570777548 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In1570777548 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite51_Out1570777548| 0) (not .cse1)) (and (or .cse0 .cse1) (= ~z$r_buff0_thd0~0_In1570777548 |ULTIMATE.start_main_#t~ite51_Out1570777548|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1570777548, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1570777548} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1570777548, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out1570777548|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1570777548} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-18 14:01:05,262 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [817] [817] L832-->L832-2: Formula: (let ((.cse1 (= (mod ~z$r_buff1_thd0~0_In787533039 256) 0)) (.cse0 (= (mod ~z$w_buff1_used~0_In787533039 256) 0)) (.cse3 (= (mod ~z$r_buff0_thd0~0_In787533039 256) 0)) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In787533039 256)))) (or (and (or .cse0 .cse1) (= ~z$r_buff1_thd0~0_In787533039 |ULTIMATE.start_main_#t~ite52_Out787533039|) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite52_Out787533039| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In787533039, ~z$w_buff0_used~0=~z$w_buff0_used~0_In787533039, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In787533039, ~z$w_buff1_used~0=~z$w_buff1_used~0_In787533039} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out787533039|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In787533039, ~z$w_buff0_used~0=~z$w_buff0_used~0_In787533039, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In787533039, ~z$w_buff1_used~0=~z$w_buff1_used~0_In787533039} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-18 14:01:05,263 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [877] [877] L832-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_17 0) (= 2 v_~x~0_130) (= 0 v_~__unbuffered_p2_EAX~0_21) (= v_~z$r_buff1_thd0~0_167 |v_ULTIMATE.start_main_#t~ite52_35|) (= (mod v_~main$tmp_guard1~0_17 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 0) (= v_~y~0_23 2)) InVars {ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_35|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_21, ~y~0=v_~y~0_23, ~x~0=v_~x~0_130} OutVars{ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_34|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_167, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_21, ~y~0=v_~y~0_23, ~x~0=v_~x~0_130, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 14:01:05,386 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 02:01:05 BasicIcfg [2019-12-18 14:01:05,387 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 14:01:05,388 INFO L168 Benchmark]: Toolchain (without parser) took 113365.92 ms. Allocated memory was 139.5 MB in the beginning and 3.2 GB in the end (delta: 3.1 GB). Free memory was 101.3 MB in the beginning and 2.0 GB in the end (delta: -1.9 GB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. [2019-12-18 14:01:05,389 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 139.5 MB. Free memory was 121.4 MB in the beginning and 121.2 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-18 14:01:05,389 INFO L168 Benchmark]: CACSL2BoogieTranslator took 741.68 ms. Allocated memory was 139.5 MB in the beginning and 204.5 MB in the end (delta: 65.0 MB). Free memory was 100.9 MB in the beginning and 158.0 MB in the end (delta: -57.1 MB). Peak memory consumption was 24.5 MB. Max. memory is 7.1 GB. [2019-12-18 14:01:05,389 INFO L168 Benchmark]: Boogie Procedure Inliner took 75.90 ms. Allocated memory is still 204.5 MB. Free memory was 158.0 MB in the beginning and 155.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-18 14:01:05,390 INFO L168 Benchmark]: Boogie Preprocessor took 40.31 ms. Allocated memory is still 204.5 MB. Free memory was 155.3 MB in the beginning and 152.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-18 14:01:05,390 INFO L168 Benchmark]: RCFGBuilder took 926.26 ms. Allocated memory is still 204.5 MB. Free memory was 152.7 MB in the beginning and 103.2 MB in the end (delta: 49.5 MB). Peak memory consumption was 49.5 MB. Max. memory is 7.1 GB. [2019-12-18 14:01:05,390 INFO L168 Benchmark]: TraceAbstraction took 111576.38 ms. Allocated memory was 204.5 MB in the beginning and 3.2 GB in the end (delta: 3.0 GB). Free memory was 102.6 MB in the beginning and 2.0 GB in the end (delta: -1.9 GB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2019-12-18 14:01:05,392 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 139.5 MB. Free memory was 121.4 MB in the beginning and 121.2 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 741.68 ms. Allocated memory was 139.5 MB in the beginning and 204.5 MB in the end (delta: 65.0 MB). Free memory was 100.9 MB in the beginning and 158.0 MB in the end (delta: -57.1 MB). Peak memory consumption was 24.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 75.90 ms. Allocated memory is still 204.5 MB. Free memory was 158.0 MB in the beginning and 155.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 40.31 ms. Allocated memory is still 204.5 MB. Free memory was 155.3 MB in the beginning and 152.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 926.26 ms. Allocated memory is still 204.5 MB. Free memory was 152.7 MB in the beginning and 103.2 MB in the end (delta: 49.5 MB). Peak memory consumption was 49.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 111576.38 ms. Allocated memory was 204.5 MB in the beginning and 3.2 GB in the end (delta: 3.0 GB). Free memory was 102.6 MB in the beginning and 2.0 GB in the end (delta: -1.9 GB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.2s, 174 ProgramPointsBefore, 92 ProgramPointsAfterwards, 211 TransitionsBefore, 102 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 7 FixpointIterations, 31 TrivialSequentialCompositions, 48 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 35 ConcurrentYvCompositions, 31 ChoiceCompositions, 6843 VarBasedMoverChecksPositive, 273 VarBasedMoverChecksNegative, 91 SemBasedMoverChecksPositive, 240 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.9s, 0 MoverChecksTotal, 77200 CheckedPairsTotal, 114 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L818] FCALL, FORK 0 pthread_create(&t1489, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L820] FCALL, FORK 0 pthread_create(&t1490, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L822] FCALL, FORK 0 pthread_create(&t1491, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L732] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L733] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L734] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L735] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L736] 1 z$r_buff0_thd1 = (_Bool)1 [L739] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L742] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L756] 2 x = 2 [L759] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L776] 3 y = 2 [L779] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L780] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L781] 3 z$flush_delayed = weak$$choice2 [L782] 3 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L783] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L783] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L784] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L785] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1))=0, x=2, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L785] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L786] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used))=1, x=2, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L786] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L762] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L742] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L743] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L744] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L762] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L763] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L764] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L765] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L787] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=2, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L787] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L789] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L790] 3 __unbuffered_p2_EAX = z VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L795] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L795] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L796] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L797] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L798] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L828] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L828] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L829] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L830] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L831] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 165 locations, 2 error locations. Result: UNSAFE, OverallTime: 111.2s, OverallIterations: 37, TraceHistogramMax: 1, AutomataDifference: 43.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 9420 SDtfs, 11783 SDslu, 30512 SDs, 0 SdLazy, 21998 SolverSat, 501 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 19.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 566 GetRequests, 123 SyntacticMatches, 24 SemanticMatches, 419 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2830 ImplicationChecksByTransitivity, 6.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=138429occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 42.3s AutomataMinimizationTime, 36 MinimizatonAttempts, 419292 StatesRemovedByMinimization, 34 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 1755 NumberOfCodeBlocks, 1755 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 1652 ConstructedInterpolants, 0 QuantifiedInterpolants, 364026 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 36 InterpolantComputations, 36 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...