/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/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix031_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 11:04:16,886 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 11:04:16,889 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 11:04:16,902 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 11:04:16,904 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 11:04:16,905 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 11:04:16,907 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 11:04:16,916 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 11:04:16,918 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 11:04:16,919 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 11:04:16,920 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 11:04:16,921 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 11:04:16,921 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 11:04:16,922 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 11:04:16,923 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 11:04:16,924 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 11:04:16,924 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 11:04:16,925 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 11:04:16,927 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 11:04:16,928 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 11:04:16,930 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 11:04:16,931 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 11:04:16,932 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 11:04:16,932 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 11:04:16,934 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 11:04:16,935 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 11:04:16,935 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 11:04:16,935 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 11:04:16,936 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 11:04:16,937 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 11:04:16,937 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 11:04:16,938 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 11:04:16,938 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 11:04:16,939 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 11:04:16,940 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 11:04:16,940 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 11:04:16,941 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 11:04:16,941 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 11:04:16,941 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 11:04:16,942 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 11:04:16,943 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 11:04:16,944 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf [2019-12-27 11:04:16,957 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 11:04:16,957 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 11:04:16,959 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 11:04:16,959 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 11:04:16,959 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 11:04:16,959 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 11:04:16,960 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 11:04:16,960 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 11:04:16,960 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 11:04:16,960 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 11:04:16,961 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 11:04:16,961 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 11:04:16,961 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 11:04:16,961 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 11:04:16,961 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 11:04:16,961 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 11:04:16,962 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 11:04:16,962 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 11:04:16,962 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 11:04:16,962 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 11:04:16,963 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 11:04:16,963 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 11:04:16,963 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 11:04:16,963 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 11:04:16,963 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 11:04:16,964 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 11:04:16,964 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 11:04:16,964 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2019-12-27 11:04:16,964 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 11:04:16,964 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 11:04:17,219 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 11:04:17,240 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 11:04:17,243 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 11:04:17,244 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 11:04:17,245 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 11:04:17,246 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix031_power.oepc.i [2019-12-27 11:04:17,316 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f8e48305/d4a649eee4e946a68bb0797a8fd41715/FLAG2783ec21b [2019-12-27 11:04:17,899 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 11:04:17,900 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix031_power.oepc.i [2019-12-27 11:04:17,923 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f8e48305/d4a649eee4e946a68bb0797a8fd41715/FLAG2783ec21b [2019-12-27 11:04:18,149 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f8e48305/d4a649eee4e946a68bb0797a8fd41715 [2019-12-27 11:04:18,159 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 11:04:18,161 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 11:04:18,162 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 11:04:18,162 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 11:04:18,166 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 11:04:18,167 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 11:04:18" (1/1) ... [2019-12-27 11:04:18,169 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@327fbd29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:04:18, skipping insertion in model container [2019-12-27 11:04:18,170 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 11:04:18" (1/1) ... [2019-12-27 11:04:18,178 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 11:04:18,232 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 11:04:18,749 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 11:04:18,769 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 11:04:18,825 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 11:04:18,903 INFO L208 MainTranslator]: Completed translation [2019-12-27 11:04:18,903 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:04:18 WrapperNode [2019-12-27 11:04:18,903 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 11:04:18,904 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 11:04:18,904 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 11:04:18,904 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 11:04:18,913 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:04:18" (1/1) ... [2019-12-27 11:04:18,934 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:04:18" (1/1) ... [2019-12-27 11:04:18,978 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 11:04:18,979 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 11:04:18,979 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 11:04:18,979 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 11:04:18,987 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:04:18" (1/1) ... [2019-12-27 11:04:18,988 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:04:18" (1/1) ... [2019-12-27 11:04:18,992 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:04:18" (1/1) ... [2019-12-27 11:04:18,992 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:04:18" (1/1) ... [2019-12-27 11:04:19,002 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:04:18" (1/1) ... [2019-12-27 11:04:19,006 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:04:18" (1/1) ... [2019-12-27 11:04:19,009 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:04:18" (1/1) ... [2019-12-27 11:04:19,014 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 11:04:19,015 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 11:04:19,015 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 11:04:19,015 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 11:04:19,016 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:04:18" (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-27 11:04:19,098 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 11:04:19,098 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 11:04:19,099 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 11:04:19,099 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 11:04:19,099 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 11:04:19,099 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 11:04:19,099 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 11:04:19,100 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 11:04:19,100 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 11:04:19,100 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 11:04:19,100 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 11:04:19,102 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 11:04:19,803 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 11:04:19,803 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 11:04:19,805 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 11:04:19 BoogieIcfgContainer [2019-12-27 11:04:19,805 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 11:04:19,807 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 11:04:19,808 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 11:04:19,812 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 11:04:19,813 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 11:04:18" (1/3) ... [2019-12-27 11:04:19,814 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56f9db59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 11:04:19, skipping insertion in model container [2019-12-27 11:04:19,814 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:04:18" (2/3) ... [2019-12-27 11:04:19,816 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56f9db59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 11:04:19, skipping insertion in model container [2019-12-27 11:04:19,817 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 11:04:19" (3/3) ... [2019-12-27 11:04:19,821 INFO L109 eAbstractionObserver]: Analyzing ICFG mix031_power.oepc.i [2019-12-27 11:04:19,834 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 11:04:19,834 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 11:04:19,849 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 11:04:19,850 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 11:04:19,914 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:04:19,915 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:04:19,915 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:04:19,916 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:04:19,916 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:04:19,916 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:04:19,917 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:04:19,917 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:04:19,917 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:04:19,918 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:04:19,918 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:04:19,918 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:04:19,918 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:04:19,919 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:04:19,919 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:04:19,919 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:04:19,920 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:04:19,920 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:04:19,920 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:04:19,920 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:04:19,921 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:04:19,921 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:04:19,921 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:04:19,922 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:04:19,922 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:04:19,923 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:04:19,924 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:04:19,924 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:04:19,925 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:04:19,925 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:04:19,925 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:04:19,925 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:04:19,926 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:04:19,926 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:04:19,929 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:04:19,930 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:04:19,930 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:04:19,930 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:04:19,931 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:04:19,932 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:04:19,932 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:04:19,933 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:04:19,934 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:04:19,934 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:04:19,935 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:04:19,935 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:04:19,935 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:04:19,936 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:04:19,936 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:04:19,936 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:04:19,936 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:04:19,937 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:04:19,937 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:04:19,937 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:04:19,937 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:04:19,937 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:04:19,939 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:04:19,939 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:04:19,939 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:04:19,940 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:04:19,940 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:04:19,940 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:04:19,940 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:04:19,941 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:04:19,941 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:04:19,941 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:04:19,941 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:04:19,942 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:04:19,942 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:04:19,943 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:04:19,943 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:04:19,943 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:04:19,946 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:04:19,946 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:04:19,947 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:04:19,947 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:04:19,947 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:04:19,947 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:04:19,948 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:04:19,948 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:04:19,948 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:04:19,949 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:04:19,950 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:04:19,950 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:04:19,950 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:04:19,951 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:04:19,952 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:04:19,952 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:04:19,953 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:04:19,953 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:04:19,953 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:04:19,953 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:04:19,954 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:04:19,954 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:04:19,954 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:04:19,954 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:04:19,955 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:04:19,955 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:04:19,955 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:04:19,955 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:04:19,956 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:04:19,956 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:04:19,957 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:04:19,957 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:04:19,961 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:04:19,963 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:04:19,963 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:04:19,964 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:04:19,972 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:04:19,972 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:04:19,973 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:04:19,974 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:04:19,974 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:04:19,974 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:04:19,975 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:04:19,975 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:04:19,975 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:04:19,975 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:04:19,976 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:04:19,976 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:04:19,976 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:04:19,976 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:04:19,977 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:04:19,977 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:04:19,977 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:04:19,977 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:04:19,978 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:04:19,978 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:04:19,978 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:04:19,978 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:04:19,979 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:04:19,979 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:04:19,979 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:04:19,979 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:04:19,980 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:04:19,980 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:04:19,980 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:04:19,980 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:04:19,981 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:04:19,981 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:04:19,981 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:04:19,981 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:04:19,981 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:04:19,982 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:04:20,000 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:04:20,001 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:04:20,001 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:04:20,001 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:04:20,002 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:04:20,002 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:04:20,002 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:04:20,002 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:04:20,008 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:04:20,008 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:04:20,009 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:04:20,009 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:04:20,009 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:04:20,009 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:04:20,009 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:04:20,009 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:04:20,010 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:04:20,010 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:04:20,010 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:04:20,010 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:04:20,013 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:04:20,014 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:04:20,014 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:04:20,014 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:04:20,014 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:04:20,015 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:04:20,015 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:04:20,015 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:04:20,015 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:04:20,015 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:04:20,016 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:04:20,016 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:04:20,016 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:04:20,016 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:04:20,016 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:04:20,016 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:04:20,017 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:04:20,017 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:04:20,017 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:04:20,017 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:04:20,017 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:04:20,018 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:04:20,018 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:04:20,018 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:04:20,018 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:04:20,018 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:04:20,019 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:04:20,019 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:04:20,019 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:04:20,019 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:04:20,019 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:04:20,019 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:04:20,020 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:04:20,036 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 11:04:20,059 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 11:04:20,059 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 11:04:20,060 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 11:04:20,060 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 11:04:20,060 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 11:04:20,060 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 11:04:20,060 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 11:04:20,060 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 11:04:20,080 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 151 places, 185 transitions [2019-12-27 11:04:22,012 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 32595 states. [2019-12-27 11:04:22,014 INFO L276 IsEmpty]: Start isEmpty. Operand 32595 states. [2019-12-27 11:04:22,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-12-27 11:04:22,022 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 11:04:22,023 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 11:04:22,024 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 11:04:22,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 11:04:22,032 INFO L82 PathProgramCache]: Analyzing trace with hash 1631155360, now seen corresponding path program 1 times [2019-12-27 11:04:22,040 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 11:04:22,040 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285138857] [2019-12-27 11:04:22,041 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 11:04:22,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 11:04:22,345 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-27 11:04:22,347 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285138857] [2019-12-27 11:04:22,348 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 11:04:22,348 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 11:04:22,349 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766100588] [2019-12-27 11:04:22,355 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 11:04:22,356 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 11:04:22,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 11:04:22,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 11:04:22,374 INFO L87 Difference]: Start difference. First operand 32595 states. Second operand 4 states. [2019-12-27 11:04:24,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 11:04:24,157 INFO L93 Difference]: Finished difference Result 33595 states and 129572 transitions. [2019-12-27 11:04:24,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 11:04:24,159 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 38 [2019-12-27 11:04:24,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 11:04:24,480 INFO L225 Difference]: With dead ends: 33595 [2019-12-27 11:04:24,480 INFO L226 Difference]: Without dead ends: 25707 [2019-12-27 11:04:24,486 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 11:04:24,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25707 states. [2019-12-27 11:04:25,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25707 to 25707. [2019-12-27 11:04:25,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25707 states. [2019-12-27 11:04:26,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25707 states to 25707 states and 99588 transitions. [2019-12-27 11:04:26,145 INFO L78 Accepts]: Start accepts. Automaton has 25707 states and 99588 transitions. Word has length 38 [2019-12-27 11:04:26,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 11:04:26,147 INFO L462 AbstractCegarLoop]: Abstraction has 25707 states and 99588 transitions. [2019-12-27 11:04:26,147 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 11:04:26,147 INFO L276 IsEmpty]: Start isEmpty. Operand 25707 states and 99588 transitions. [2019-12-27 11:04:26,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-27 11:04:26,166 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 11:04:26,166 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] [2019-12-27 11:04:26,167 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 11:04:26,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 11:04:26,167 INFO L82 PathProgramCache]: Analyzing trace with hash 475633161, now seen corresponding path program 1 times [2019-12-27 11:04:26,168 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 11:04:26,168 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600857566] [2019-12-27 11:04:26,168 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 11:04:26,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 11:04:26,393 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-27 11:04:26,394 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600857566] [2019-12-27 11:04:26,394 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 11:04:26,395 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 11:04:26,395 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757203198] [2019-12-27 11:04:26,398 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 11:04:26,399 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 11:04:26,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 11:04:26,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 11:04:26,399 INFO L87 Difference]: Start difference. First operand 25707 states and 99588 transitions. Second operand 5 states. [2019-12-27 11:04:27,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 11:04:27,426 INFO L93 Difference]: Finished difference Result 41085 states and 150435 transitions. [2019-12-27 11:04:27,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 11:04:27,427 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 50 [2019-12-27 11:04:27,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 11:04:27,627 INFO L225 Difference]: With dead ends: 41085 [2019-12-27 11:04:27,627 INFO L226 Difference]: Without dead ends: 40549 [2019-12-27 11:04:27,628 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-27 11:04:29,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40549 states. [2019-12-27 11:04:30,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40549 to 38929. [2019-12-27 11:04:30,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38929 states. [2019-12-27 11:04:30,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38929 states to 38929 states and 143585 transitions. [2019-12-27 11:04:30,315 INFO L78 Accepts]: Start accepts. Automaton has 38929 states and 143585 transitions. Word has length 50 [2019-12-27 11:04:30,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 11:04:30,316 INFO L462 AbstractCegarLoop]: Abstraction has 38929 states and 143585 transitions. [2019-12-27 11:04:30,317 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 11:04:30,317 INFO L276 IsEmpty]: Start isEmpty. Operand 38929 states and 143585 transitions. [2019-12-27 11:04:30,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-27 11:04:30,323 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 11:04:30,323 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] [2019-12-27 11:04:30,323 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 11:04:30,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 11:04:30,324 INFO L82 PathProgramCache]: Analyzing trace with hash -1647317549, now seen corresponding path program 1 times [2019-12-27 11:04:30,324 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 11:04:30,324 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790862372] [2019-12-27 11:04:30,325 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 11:04:30,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 11:04:30,421 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-27 11:04:30,422 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790862372] [2019-12-27 11:04:30,422 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 11:04:30,422 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 11:04:30,423 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415364597] [2019-12-27 11:04:30,423 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 11:04:30,423 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 11:04:30,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 11:04:30,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 11:04:30,424 INFO L87 Difference]: Start difference. First operand 38929 states and 143585 transitions. Second operand 5 states. [2019-12-27 11:04:31,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 11:04:31,383 INFO L93 Difference]: Finished difference Result 49782 states and 180637 transitions. [2019-12-27 11:04:31,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 11:04:31,383 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 51 [2019-12-27 11:04:31,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 11:04:31,593 INFO L225 Difference]: With dead ends: 49782 [2019-12-27 11:04:31,593 INFO L226 Difference]: Without dead ends: 49278 [2019-12-27 11:04:31,593 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-27 11:04:31,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49278 states. [2019-12-27 11:04:34,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49278 to 42681. [2019-12-27 11:04:34,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42681 states. [2019-12-27 11:04:34,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42681 states to 42681 states and 156596 transitions. [2019-12-27 11:04:34,524 INFO L78 Accepts]: Start accepts. Automaton has 42681 states and 156596 transitions. Word has length 51 [2019-12-27 11:04:34,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 11:04:34,524 INFO L462 AbstractCegarLoop]: Abstraction has 42681 states and 156596 transitions. [2019-12-27 11:04:34,525 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 11:04:34,525 INFO L276 IsEmpty]: Start isEmpty. Operand 42681 states and 156596 transitions. [2019-12-27 11:04:34,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 11:04:34,534 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 11:04:34,534 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 11:04:34,534 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 11:04:34,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 11:04:34,535 INFO L82 PathProgramCache]: Analyzing trace with hash -1552968967, now seen corresponding path program 1 times [2019-12-27 11:04:34,535 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 11:04:34,535 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196785015] [2019-12-27 11:04:34,535 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 11:04:34,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 11:04:34,599 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-27 11:04:34,599 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196785015] [2019-12-27 11:04:34,599 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 11:04:34,600 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 11:04:34,601 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145265587] [2019-12-27 11:04:34,601 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 11:04:34,601 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 11:04:34,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 11:04:34,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 11:04:34,602 INFO L87 Difference]: Start difference. First operand 42681 states and 156596 transitions. Second operand 3 states. [2019-12-27 11:04:35,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 11:04:35,232 INFO L93 Difference]: Finished difference Result 61091 states and 221434 transitions. [2019-12-27 11:04:35,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 11:04:35,232 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-12-27 11:04:35,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 11:04:35,409 INFO L225 Difference]: With dead ends: 61091 [2019-12-27 11:04:35,409 INFO L226 Difference]: Without dead ends: 61091 [2019-12-27 11:04:35,410 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-27 11:04:35,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61091 states. [2019-12-27 11:04:38,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61091 to 48020. [2019-12-27 11:04:38,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48020 states. [2019-12-27 11:04:38,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48020 states to 48020 states and 174183 transitions. [2019-12-27 11:04:38,376 INFO L78 Accepts]: Start accepts. Automaton has 48020 states and 174183 transitions. Word has length 53 [2019-12-27 11:04:38,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 11:04:38,376 INFO L462 AbstractCegarLoop]: Abstraction has 48020 states and 174183 transitions. [2019-12-27 11:04:38,376 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 11:04:38,376 INFO L276 IsEmpty]: Start isEmpty. Operand 48020 states and 174183 transitions. [2019-12-27 11:04:38,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 11:04:38,392 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 11:04:38,393 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 11:04:38,393 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 11:04:38,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 11:04:38,393 INFO L82 PathProgramCache]: Analyzing trace with hash -1347337287, now seen corresponding path program 1 times [2019-12-27 11:04:38,394 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 11:04:38,394 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484920083] [2019-12-27 11:04:38,394 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 11:04:38,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 11:04:38,528 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-27 11:04:38,529 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484920083] [2019-12-27 11:04:38,529 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 11:04:38,529 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 11:04:38,529 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467880468] [2019-12-27 11:04:38,530 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 11:04:38,530 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 11:04:38,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 11:04:38,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 11:04:38,531 INFO L87 Difference]: Start difference. First operand 48020 states and 174183 transitions. Second operand 6 states. [2019-12-27 11:04:39,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 11:04:39,912 INFO L93 Difference]: Finished difference Result 63760 states and 229383 transitions. [2019-12-27 11:04:39,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 11:04:39,912 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 57 [2019-12-27 11:04:39,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 11:04:40,066 INFO L225 Difference]: With dead ends: 63760 [2019-12-27 11:04:40,066 INFO L226 Difference]: Without dead ends: 63760 [2019-12-27 11:04:40,067 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-27 11:04:40,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63760 states. [2019-12-27 11:04:43,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63760 to 59953. [2019-12-27 11:04:43,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59953 states. [2019-12-27 11:04:43,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59953 states to 59953 states and 215676 transitions. [2019-12-27 11:04:43,397 INFO L78 Accepts]: Start accepts. Automaton has 59953 states and 215676 transitions. Word has length 57 [2019-12-27 11:04:43,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 11:04:43,397 INFO L462 AbstractCegarLoop]: Abstraction has 59953 states and 215676 transitions. [2019-12-27 11:04:43,398 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 11:04:43,398 INFO L276 IsEmpty]: Start isEmpty. Operand 59953 states and 215676 transitions. [2019-12-27 11:04:43,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 11:04:43,414 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 11:04:43,414 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 11:04:43,415 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 11:04:43,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 11:04:43,415 INFO L82 PathProgramCache]: Analyzing trace with hash 1150678650, now seen corresponding path program 1 times [2019-12-27 11:04:43,415 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 11:04:43,415 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111891208] [2019-12-27 11:04:43,416 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 11:04:43,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 11:04:43,524 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-27 11:04:43,524 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111891208] [2019-12-27 11:04:43,525 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 11:04:43,525 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 11:04:43,525 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040366888] [2019-12-27 11:04:43,525 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 11:04:43,527 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 11:04:43,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 11:04:43,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-27 11:04:43,527 INFO L87 Difference]: Start difference. First operand 59953 states and 215676 transitions. Second operand 7 states. [2019-12-27 11:04:44,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 11:04:44,848 INFO L93 Difference]: Finished difference Result 83689 states and 290101 transitions. [2019-12-27 11:04:44,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 11:04:44,849 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 57 [2019-12-27 11:04:44,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 11:04:45,029 INFO L225 Difference]: With dead ends: 83689 [2019-12-27 11:04:45,029 INFO L226 Difference]: Without dead ends: 83689 [2019-12-27 11:04:45,030 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-27 11:04:45,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83689 states. [2019-12-27 11:04:46,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83689 to 71016. [2019-12-27 11:04:46,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71016 states. [2019-12-27 11:04:50,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71016 states to 71016 states and 249890 transitions. [2019-12-27 11:04:50,013 INFO L78 Accepts]: Start accepts. Automaton has 71016 states and 249890 transitions. Word has length 57 [2019-12-27 11:04:50,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 11:04:50,013 INFO L462 AbstractCegarLoop]: Abstraction has 71016 states and 249890 transitions. [2019-12-27 11:04:50,013 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 11:04:50,013 INFO L276 IsEmpty]: Start isEmpty. Operand 71016 states and 249890 transitions. [2019-12-27 11:04:50,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 11:04:50,027 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 11:04:50,027 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] [2019-12-27 11:04:50,027 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 11:04:50,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 11:04:50,027 INFO L82 PathProgramCache]: Analyzing trace with hash 2038182331, now seen corresponding path program 1 times [2019-12-27 11:04:50,027 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 11:04:50,028 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738825556] [2019-12-27 11:04:50,028 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 11:04:50,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 11:04:50,098 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-27 11:04:50,098 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738825556] [2019-12-27 11:04:50,098 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 11:04:50,098 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 11:04:50,099 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371366105] [2019-12-27 11:04:50,099 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 11:04:50,099 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 11:04:50,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 11:04:50,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 11:04:50,100 INFO L87 Difference]: Start difference. First operand 71016 states and 249890 transitions. Second operand 3 states. [2019-12-27 11:04:50,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 11:04:50,381 INFO L93 Difference]: Finished difference Result 54025 states and 188922 transitions. [2019-12-27 11:04:50,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 11:04:50,382 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2019-12-27 11:04:50,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 11:04:50,502 INFO L225 Difference]: With dead ends: 54025 [2019-12-27 11:04:50,502 INFO L226 Difference]: Without dead ends: 54025 [2019-12-27 11:04:50,502 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 11:04:50,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54025 states. [2019-12-27 11:04:51,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54025 to 53410. [2019-12-27 11:04:51,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53410 states. [2019-12-27 11:04:51,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53410 states to 53410 states and 187041 transitions. [2019-12-27 11:04:51,900 INFO L78 Accepts]: Start accepts. Automaton has 53410 states and 187041 transitions. Word has length 57 [2019-12-27 11:04:51,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 11:04:51,900 INFO L462 AbstractCegarLoop]: Abstraction has 53410 states and 187041 transitions. [2019-12-27 11:04:51,900 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 11:04:51,901 INFO L276 IsEmpty]: Start isEmpty. Operand 53410 states and 187041 transitions. [2019-12-27 11:04:51,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 11:04:51,909 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 11:04:51,909 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] [2019-12-27 11:04:51,909 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 11:04:51,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 11:04:51,910 INFO L82 PathProgramCache]: Analyzing trace with hash -565356220, now seen corresponding path program 1 times [2019-12-27 11:04:51,910 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 11:04:51,910 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323527860] [2019-12-27 11:04:51,910 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 11:04:51,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 11:04:51,982 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-27 11:04:51,983 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323527860] [2019-12-27 11:04:51,983 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 11:04:51,983 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 11:04:51,983 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974253870] [2019-12-27 11:04:51,984 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 11:04:51,984 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 11:04:51,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 11:04:51,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 11:04:51,984 INFO L87 Difference]: Start difference. First operand 53410 states and 187041 transitions. Second operand 6 states. [2019-12-27 11:04:52,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 11:04:52,784 INFO L93 Difference]: Finished difference Result 68650 states and 237305 transitions. [2019-12-27 11:04:52,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 11:04:52,784 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 57 [2019-12-27 11:04:52,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 11:04:52,930 INFO L225 Difference]: With dead ends: 68650 [2019-12-27 11:04:52,931 INFO L226 Difference]: Without dead ends: 68082 [2019-12-27 11:04:52,931 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2019-12-27 11:04:53,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68082 states. [2019-12-27 11:04:54,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68082 to 53494. [2019-12-27 11:04:54,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53494 states. [2019-12-27 11:04:54,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53494 states to 53494 states and 187738 transitions. [2019-12-27 11:04:54,612 INFO L78 Accepts]: Start accepts. Automaton has 53494 states and 187738 transitions. Word has length 57 [2019-12-27 11:04:54,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 11:04:54,612 INFO L462 AbstractCegarLoop]: Abstraction has 53494 states and 187738 transitions. [2019-12-27 11:04:54,612 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 11:04:54,612 INFO L276 IsEmpty]: Start isEmpty. Operand 53494 states and 187738 transitions. [2019-12-27 11:04:54,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-27 11:04:54,624 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 11:04:54,624 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] [2019-12-27 11:04:54,624 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 11:04:54,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 11:04:54,625 INFO L82 PathProgramCache]: Analyzing trace with hash -1699947683, now seen corresponding path program 1 times [2019-12-27 11:04:54,625 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 11:04:54,625 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685483267] [2019-12-27 11:04:54,625 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 11:04:54,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 11:04:54,723 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-27 11:04:54,723 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685483267] [2019-12-27 11:04:54,724 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 11:04:54,724 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 11:04:54,724 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843218483] [2019-12-27 11:04:54,724 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 11:04:54,725 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 11:04:54,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 11:04:54,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 11:04:54,725 INFO L87 Difference]: Start difference. First operand 53494 states and 187738 transitions. Second operand 6 states. [2019-12-27 11:04:55,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 11:04:55,622 INFO L93 Difference]: Finished difference Result 67853 states and 231364 transitions. [2019-12-27 11:04:55,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 11:04:55,623 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 58 [2019-12-27 11:04:55,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 11:04:55,768 INFO L225 Difference]: With dead ends: 67853 [2019-12-27 11:04:55,768 INFO L226 Difference]: Without dead ends: 67853 [2019-12-27 11:04:55,768 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-12-27 11:04:56,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67853 states. [2019-12-27 11:04:57,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67853 to 59085. [2019-12-27 11:04:57,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59085 states. [2019-12-27 11:04:57,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59085 states to 59085 states and 204134 transitions. [2019-12-27 11:04:57,416 INFO L78 Accepts]: Start accepts. Automaton has 59085 states and 204134 transitions. Word has length 58 [2019-12-27 11:04:57,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 11:04:57,416 INFO L462 AbstractCegarLoop]: Abstraction has 59085 states and 204134 transitions. [2019-12-27 11:04:57,416 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 11:04:57,416 INFO L276 IsEmpty]: Start isEmpty. Operand 59085 states and 204134 transitions. [2019-12-27 11:04:57,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-27 11:04:57,427 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 11:04:57,427 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] [2019-12-27 11:04:57,427 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 11:04:57,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 11:04:57,428 INFO L82 PathProgramCache]: Analyzing trace with hash -812444002, now seen corresponding path program 1 times [2019-12-27 11:04:57,428 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 11:04:57,428 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299141685] [2019-12-27 11:04:57,428 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 11:04:57,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 11:04:57,495 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-27 11:04:57,495 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299141685] [2019-12-27 11:04:57,496 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 11:04:57,496 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 11:04:57,496 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578622601] [2019-12-27 11:04:57,496 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 11:04:57,496 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 11:04:57,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 11:04:57,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 11:04:57,497 INFO L87 Difference]: Start difference. First operand 59085 states and 204134 transitions. Second operand 4 states. [2019-12-27 11:04:57,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 11:04:57,558 INFO L93 Difference]: Finished difference Result 10216 states and 31250 transitions. [2019-12-27 11:04:57,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 11:04:57,558 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2019-12-27 11:04:57,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 11:04:57,574 INFO L225 Difference]: With dead ends: 10216 [2019-12-27 11:04:57,575 INFO L226 Difference]: Without dead ends: 8511 [2019-12-27 11:04:57,575 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 11:04:57,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8511 states. [2019-12-27 11:04:57,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8511 to 8463. [2019-12-27 11:04:57,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8463 states. [2019-12-27 11:04:57,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8463 states to 8463 states and 25329 transitions. [2019-12-27 11:04:57,679 INFO L78 Accepts]: Start accepts. Automaton has 8463 states and 25329 transitions. Word has length 58 [2019-12-27 11:04:57,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 11:04:57,679 INFO L462 AbstractCegarLoop]: Abstraction has 8463 states and 25329 transitions. [2019-12-27 11:04:57,679 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 11:04:57,679 INFO L276 IsEmpty]: Start isEmpty. Operand 8463 states and 25329 transitions. [2019-12-27 11:04:57,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 11:04:57,683 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 11:04:57,684 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-27 11:04:57,684 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 11:04:57,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 11:04:57,684 INFO L82 PathProgramCache]: Analyzing trace with hash -1292079072, now seen corresponding path program 1 times [2019-12-27 11:04:57,684 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 11:04:57,685 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627093450] [2019-12-27 11:04:57,685 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 11:04:57,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 11:04:57,739 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-27 11:04:57,740 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627093450] [2019-12-27 11:04:57,740 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 11:04:57,740 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 11:04:57,741 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693681360] [2019-12-27 11:04:57,741 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 11:04:57,741 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 11:04:57,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 11:04:57,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 11:04:57,742 INFO L87 Difference]: Start difference. First operand 8463 states and 25329 transitions. Second operand 4 states. [2019-12-27 11:04:57,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 11:04:57,854 INFO L93 Difference]: Finished difference Result 9710 states and 29108 transitions. [2019-12-27 11:04:57,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 11:04:57,854 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-27 11:04:57,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 11:04:57,872 INFO L225 Difference]: With dead ends: 9710 [2019-12-27 11:04:57,872 INFO L226 Difference]: Without dead ends: 9710 [2019-12-27 11:04:57,872 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 11:04:57,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9710 states. [2019-12-27 11:04:58,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9710 to 8883. [2019-12-27 11:04:58,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8883 states. [2019-12-27 11:04:58,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8883 states to 8883 states and 26592 transitions. [2019-12-27 11:04:58,076 INFO L78 Accepts]: Start accepts. Automaton has 8883 states and 26592 transitions. Word has length 65 [2019-12-27 11:04:58,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 11:04:58,077 INFO L462 AbstractCegarLoop]: Abstraction has 8883 states and 26592 transitions. [2019-12-27 11:04:58,077 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 11:04:58,077 INFO L276 IsEmpty]: Start isEmpty. Operand 8883 states and 26592 transitions. [2019-12-27 11:04:58,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 11:04:58,081 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 11:04:58,081 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-27 11:04:58,082 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 11:04:58,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 11:04:58,082 INFO L82 PathProgramCache]: Analyzing trace with hash 450731263, now seen corresponding path program 1 times [2019-12-27 11:04:58,082 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 11:04:58,083 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486454970] [2019-12-27 11:04:58,083 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 11:04:58,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 11:04:58,190 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-27 11:04:58,191 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486454970] [2019-12-27 11:04:58,191 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 11:04:58,191 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 11:04:58,192 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647247215] [2019-12-27 11:04:58,192 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 11:04:58,192 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 11:04:58,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 11:04:58,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 11:04:58,193 INFO L87 Difference]: Start difference. First operand 8883 states and 26592 transitions. Second operand 6 states. [2019-12-27 11:04:58,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 11:04:58,579 INFO L93 Difference]: Finished difference Result 11199 states and 33079 transitions. [2019-12-27 11:04:58,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 11:04:58,579 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-12-27 11:04:58,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 11:04:58,599 INFO L225 Difference]: With dead ends: 11199 [2019-12-27 11:04:58,599 INFO L226 Difference]: Without dead ends: 11138 [2019-12-27 11:04:58,600 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-27 11:04:58,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11138 states. [2019-12-27 11:04:58,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11138 to 10414. [2019-12-27 11:04:58,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10414 states. [2019-12-27 11:04:58,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10414 states to 10414 states and 30946 transitions. [2019-12-27 11:04:58,856 INFO L78 Accepts]: Start accepts. Automaton has 10414 states and 30946 transitions. Word has length 65 [2019-12-27 11:04:58,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 11:04:58,856 INFO L462 AbstractCegarLoop]: Abstraction has 10414 states and 30946 transitions. [2019-12-27 11:04:58,856 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 11:04:58,856 INFO L276 IsEmpty]: Start isEmpty. Operand 10414 states and 30946 transitions. [2019-12-27 11:04:58,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-27 11:04:58,861 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 11:04:58,862 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, 1, 1, 1, 1] [2019-12-27 11:04:58,862 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 11:04:58,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 11:04:58,862 INFO L82 PathProgramCache]: Analyzing trace with hash -1715256149, now seen corresponding path program 1 times [2019-12-27 11:04:58,862 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 11:04:58,862 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030320686] [2019-12-27 11:04:58,862 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 11:04:58,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 11:04:58,916 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-27 11:04:58,917 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030320686] [2019-12-27 11:04:58,917 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 11:04:58,917 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 11:04:58,917 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134776451] [2019-12-27 11:04:58,918 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 11:04:58,918 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 11:04:58,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 11:04:58,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 11:04:58,919 INFO L87 Difference]: Start difference. First operand 10414 states and 30946 transitions. Second operand 4 states. [2019-12-27 11:04:59,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 11:04:59,215 INFO L93 Difference]: Finished difference Result 13387 states and 39337 transitions. [2019-12-27 11:04:59,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 11:04:59,216 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 71 [2019-12-27 11:04:59,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 11:04:59,233 INFO L225 Difference]: With dead ends: 13387 [2019-12-27 11:04:59,234 INFO L226 Difference]: Without dead ends: 13387 [2019-12-27 11:04:59,234 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 11:04:59,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13387 states. [2019-12-27 11:04:59,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13387 to 11728. [2019-12-27 11:04:59,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11728 states. [2019-12-27 11:04:59,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11728 states to 11728 states and 34581 transitions. [2019-12-27 11:04:59,391 INFO L78 Accepts]: Start accepts. Automaton has 11728 states and 34581 transitions. Word has length 71 [2019-12-27 11:04:59,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 11:04:59,391 INFO L462 AbstractCegarLoop]: Abstraction has 11728 states and 34581 transitions. [2019-12-27 11:04:59,391 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 11:04:59,391 INFO L276 IsEmpty]: Start isEmpty. Operand 11728 states and 34581 transitions. [2019-12-27 11:04:59,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-27 11:04:59,398 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 11:04:59,399 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, 1, 1, 1, 1] [2019-12-27 11:04:59,399 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 11:04:59,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 11:04:59,399 INFO L82 PathProgramCache]: Analyzing trace with hash -470491668, now seen corresponding path program 1 times [2019-12-27 11:04:59,399 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 11:04:59,399 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420358304] [2019-12-27 11:04:59,400 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 11:04:59,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 11:04:59,500 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-27 11:04:59,501 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420358304] [2019-12-27 11:04:59,501 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 11:04:59,501 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 11:04:59,501 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589663282] [2019-12-27 11:04:59,502 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 11:04:59,502 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 11:04:59,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 11:04:59,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 11:04:59,502 INFO L87 Difference]: Start difference. First operand 11728 states and 34581 transitions. Second operand 6 states. [2019-12-27 11:04:59,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 11:04:59,991 INFO L93 Difference]: Finished difference Result 12877 states and 37338 transitions. [2019-12-27 11:04:59,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 11:04:59,992 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 71 [2019-12-27 11:04:59,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 11:05:00,009 INFO L225 Difference]: With dead ends: 12877 [2019-12-27 11:05:00,009 INFO L226 Difference]: Without dead ends: 12877 [2019-12-27 11:05:00,010 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-27 11:05:00,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12877 states. [2019-12-27 11:05:00,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12877 to 12577. [2019-12-27 11:05:00,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12577 states. [2019-12-27 11:05:00,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12577 states to 12577 states and 36580 transitions. [2019-12-27 11:05:00,167 INFO L78 Accepts]: Start accepts. Automaton has 12577 states and 36580 transitions. Word has length 71 [2019-12-27 11:05:00,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 11:05:00,167 INFO L462 AbstractCegarLoop]: Abstraction has 12577 states and 36580 transitions. [2019-12-27 11:05:00,167 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 11:05:00,168 INFO L276 IsEmpty]: Start isEmpty. Operand 12577 states and 36580 transitions. [2019-12-27 11:05:00,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-27 11:05:00,175 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 11:05:00,175 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 11:05:00,175 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 11:05:00,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 11:05:00,176 INFO L82 PathProgramCache]: Analyzing trace with hash 1747266285, now seen corresponding path program 1 times [2019-12-27 11:05:00,176 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 11:05:00,176 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817619078] [2019-12-27 11:05:00,176 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 11:05:00,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 11:05:00,257 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-27 11:05:00,257 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817619078] [2019-12-27 11:05:00,258 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 11:05:00,258 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 11:05:00,258 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174606542] [2019-12-27 11:05:00,258 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 11:05:00,259 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 11:05:00,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 11:05:00,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 11:05:00,259 INFO L87 Difference]: Start difference. First operand 12577 states and 36580 transitions. Second operand 6 states. [2019-12-27 11:05:00,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 11:05:00,708 INFO L93 Difference]: Finished difference Result 14466 states and 40828 transitions. [2019-12-27 11:05:00,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 11:05:00,708 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 71 [2019-12-27 11:05:00,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 11:05:00,728 INFO L225 Difference]: With dead ends: 14466 [2019-12-27 11:05:00,729 INFO L226 Difference]: Without dead ends: 14466 [2019-12-27 11:05:00,729 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-12-27 11:05:00,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14466 states. [2019-12-27 11:05:00,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14466 to 13140. [2019-12-27 11:05:00,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13140 states. [2019-12-27 11:05:00,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13140 states to 13140 states and 37549 transitions. [2019-12-27 11:05:00,912 INFO L78 Accepts]: Start accepts. Automaton has 13140 states and 37549 transitions. Word has length 71 [2019-12-27 11:05:00,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 11:05:00,913 INFO L462 AbstractCegarLoop]: Abstraction has 13140 states and 37549 transitions. [2019-12-27 11:05:00,913 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 11:05:00,913 INFO L276 IsEmpty]: Start isEmpty. Operand 13140 states and 37549 transitions. [2019-12-27 11:05:00,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-27 11:05:00,921 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 11:05:00,921 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 11:05:00,922 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 11:05:00,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 11:05:00,922 INFO L82 PathProgramCache]: Analyzing trace with hash 1958617198, now seen corresponding path program 1 times [2019-12-27 11:05:00,922 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 11:05:00,922 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165794123] [2019-12-27 11:05:00,923 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 11:05:00,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 11:05:01,005 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-27 11:05:01,006 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165794123] [2019-12-27 11:05:01,006 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 11:05:01,006 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 11:05:01,006 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754394599] [2019-12-27 11:05:01,007 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 11:05:01,007 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 11:05:01,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 11:05:01,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 11:05:01,008 INFO L87 Difference]: Start difference. First operand 13140 states and 37549 transitions. Second operand 5 states. [2019-12-27 11:05:01,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 11:05:01,388 INFO L93 Difference]: Finished difference Result 16966 states and 48261 transitions. [2019-12-27 11:05:01,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 11:05:01,388 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 71 [2019-12-27 11:05:01,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 11:05:01,409 INFO L225 Difference]: With dead ends: 16966 [2019-12-27 11:05:01,409 INFO L226 Difference]: Without dead ends: 16966 [2019-12-27 11:05:01,410 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 11:05:01,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16966 states. [2019-12-27 11:05:01,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16966 to 15670. [2019-12-27 11:05:01,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15670 states. [2019-12-27 11:05:01,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15670 states to 15670 states and 44446 transitions. [2019-12-27 11:05:01,753 INFO L78 Accepts]: Start accepts. Automaton has 15670 states and 44446 transitions. Word has length 71 [2019-12-27 11:05:01,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 11:05:01,753 INFO L462 AbstractCegarLoop]: Abstraction has 15670 states and 44446 transitions. [2019-12-27 11:05:01,753 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 11:05:01,753 INFO L276 IsEmpty]: Start isEmpty. Operand 15670 states and 44446 transitions. [2019-12-27 11:05:01,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-27 11:05:01,760 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 11:05:01,761 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, 1, 1, 1, 1] [2019-12-27 11:05:01,761 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 11:05:01,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 11:05:01,761 INFO L82 PathProgramCache]: Analyzing trace with hash 1448083021, now seen corresponding path program 1 times [2019-12-27 11:05:01,761 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 11:05:01,761 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33572917] [2019-12-27 11:05:01,761 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 11:05:01,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 11:05:01,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 11:05:01,882 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33572917] [2019-12-27 11:05:01,882 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 11:05:01,882 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 11:05:01,883 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160615779] [2019-12-27 11:05:01,883 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 11:05:01,883 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 11:05:01,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 11:05:01,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-27 11:05:01,884 INFO L87 Difference]: Start difference. First operand 15670 states and 44446 transitions. Second operand 6 states. [2019-12-27 11:05:02,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 11:05:02,039 INFO L93 Difference]: Finished difference Result 16084 states and 44227 transitions. [2019-12-27 11:05:02,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 11:05:02,040 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 71 [2019-12-27 11:05:02,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 11:05:02,064 INFO L225 Difference]: With dead ends: 16084 [2019-12-27 11:05:02,064 INFO L226 Difference]: Without dead ends: 16084 [2019-12-27 11:05:02,065 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 11:05:02,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16084 states. [2019-12-27 11:05:02,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16084 to 14714. [2019-12-27 11:05:02,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14714 states. [2019-12-27 11:05:02,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14714 states to 14714 states and 40522 transitions. [2019-12-27 11:05:02,260 INFO L78 Accepts]: Start accepts. Automaton has 14714 states and 40522 transitions. Word has length 71 [2019-12-27 11:05:02,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 11:05:02,260 INFO L462 AbstractCegarLoop]: Abstraction has 14714 states and 40522 transitions. [2019-12-27 11:05:02,260 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 11:05:02,260 INFO L276 IsEmpty]: Start isEmpty. Operand 14714 states and 40522 transitions. [2019-12-27 11:05:02,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-27 11:05:02,267 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 11:05:02,267 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, 1, 1, 1, 1] [2019-12-27 11:05:02,267 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 11:05:02,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 11:05:02,267 INFO L82 PathProgramCache]: Analyzing trace with hash 538635343, now seen corresponding path program 1 times [2019-12-27 11:05:02,267 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 11:05:02,267 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758673731] [2019-12-27 11:05:02,268 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 11:05:02,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 11:05:02,330 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-27 11:05:02,330 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758673731] [2019-12-27 11:05:02,331 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 11:05:02,331 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 11:05:02,331 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25618996] [2019-12-27 11:05:02,331 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 11:05:02,331 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 11:05:02,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 11:05:02,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 11:05:02,332 INFO L87 Difference]: Start difference. First operand 14714 states and 40522 transitions. Second operand 5 states. [2019-12-27 11:05:02,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 11:05:02,385 INFO L93 Difference]: Finished difference Result 5315 states and 12566 transitions. [2019-12-27 11:05:02,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 11:05:02,385 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 71 [2019-12-27 11:05:02,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 11:05:02,392 INFO L225 Difference]: With dead ends: 5315 [2019-12-27 11:05:02,392 INFO L226 Difference]: Without dead ends: 4643 [2019-12-27 11:05:02,393 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 11:05:02,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4643 states. [2019-12-27 11:05:02,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4643 to 4541. [2019-12-27 11:05:02,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4541 states. [2019-12-27 11:05:02,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4541 states to 4541 states and 10384 transitions. [2019-12-27 11:05:02,457 INFO L78 Accepts]: Start accepts. Automaton has 4541 states and 10384 transitions. Word has length 71 [2019-12-27 11:05:02,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 11:05:02,457 INFO L462 AbstractCegarLoop]: Abstraction has 4541 states and 10384 transitions. [2019-12-27 11:05:02,457 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 11:05:02,457 INFO L276 IsEmpty]: Start isEmpty. Operand 4541 states and 10384 transitions. [2019-12-27 11:05:02,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-27 11:05:02,463 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 11:05:02,463 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, 1, 1, 1, 1] [2019-12-27 11:05:02,463 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 11:05:02,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 11:05:02,463 INFO L82 PathProgramCache]: Analyzing trace with hash -1679970640, now seen corresponding path program 1 times [2019-12-27 11:05:02,465 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 11:05:02,465 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83680363] [2019-12-27 11:05:02,465 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 11:05:02,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 11:05:02,495 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-27 11:05:02,496 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83680363] [2019-12-27 11:05:02,496 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 11:05:02,496 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 11:05:02,496 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092110082] [2019-12-27 11:05:02,497 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 11:05:02,497 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 11:05:02,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 11:05:02,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 11:05:02,497 INFO L87 Difference]: Start difference. First operand 4541 states and 10384 transitions. Second operand 3 states. [2019-12-27 11:05:02,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 11:05:02,535 INFO L93 Difference]: Finished difference Result 5482 states and 12309 transitions. [2019-12-27 11:05:02,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 11:05:02,536 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 71 [2019-12-27 11:05:02,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 11:05:02,543 INFO L225 Difference]: With dead ends: 5482 [2019-12-27 11:05:02,543 INFO L226 Difference]: Without dead ends: 5482 [2019-12-27 11:05:02,543 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-27 11:05:02,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5482 states. [2019-12-27 11:05:02,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5482 to 4476. [2019-12-27 11:05:02,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4476 states. [2019-12-27 11:05:02,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4476 states to 4476 states and 9946 transitions. [2019-12-27 11:05:02,598 INFO L78 Accepts]: Start accepts. Automaton has 4476 states and 9946 transitions. Word has length 71 [2019-12-27 11:05:02,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 11:05:02,598 INFO L462 AbstractCegarLoop]: Abstraction has 4476 states and 9946 transitions. [2019-12-27 11:05:02,598 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 11:05:02,599 INFO L276 IsEmpty]: Start isEmpty. Operand 4476 states and 9946 transitions. [2019-12-27 11:05:02,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-12-27 11:05:02,602 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 11:05:02,603 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 11:05:02,603 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 11:05:02,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 11:05:02,603 INFO L82 PathProgramCache]: Analyzing trace with hash -1543631293, now seen corresponding path program 1 times [2019-12-27 11:05:02,603 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 11:05:02,603 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616711726] [2019-12-27 11:05:02,603 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 11:05:02,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 11:05:02,666 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-27 11:05:02,666 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616711726] [2019-12-27 11:05:02,667 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 11:05:02,667 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 11:05:02,667 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107386944] [2019-12-27 11:05:02,668 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 11:05:02,668 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 11:05:02,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 11:05:02,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 11:05:02,668 INFO L87 Difference]: Start difference. First operand 4476 states and 9946 transitions. Second operand 5 states. [2019-12-27 11:05:02,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 11:05:02,846 INFO L93 Difference]: Finished difference Result 5533 states and 12363 transitions. [2019-12-27 11:05:02,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 11:05:02,847 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 77 [2019-12-27 11:05:02,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 11:05:02,853 INFO L225 Difference]: With dead ends: 5533 [2019-12-27 11:05:02,853 INFO L226 Difference]: Without dead ends: 5533 [2019-12-27 11:05:02,853 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 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-27 11:05:02,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5533 states. [2019-12-27 11:05:02,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5533 to 4896. [2019-12-27 11:05:02,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4896 states. [2019-12-27 11:05:02,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4896 states to 4896 states and 10904 transitions. [2019-12-27 11:05:02,903 INFO L78 Accepts]: Start accepts. Automaton has 4896 states and 10904 transitions. Word has length 77 [2019-12-27 11:05:02,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 11:05:02,904 INFO L462 AbstractCegarLoop]: Abstraction has 4896 states and 10904 transitions. [2019-12-27 11:05:02,904 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 11:05:02,904 INFO L276 IsEmpty]: Start isEmpty. Operand 4896 states and 10904 transitions. [2019-12-27 11:05:02,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-12-27 11:05:02,908 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 11:05:02,908 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 11:05:02,909 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 11:05:02,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 11:05:02,909 INFO L82 PathProgramCache]: Analyzing trace with hash 199179042, now seen corresponding path program 1 times [2019-12-27 11:05:02,909 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 11:05:02,909 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949896083] [2019-12-27 11:05:02,909 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 11:05:02,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 11:05:02,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 11:05:02,990 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949896083] [2019-12-27 11:05:02,990 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 11:05:02,990 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 11:05:02,991 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711057387] [2019-12-27 11:05:02,991 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 11:05:02,991 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 11:05:02,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 11:05:02,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 11:05:02,992 INFO L87 Difference]: Start difference. First operand 4896 states and 10904 transitions. Second operand 7 states. [2019-12-27 11:05:03,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 11:05:03,434 INFO L93 Difference]: Finished difference Result 5669 states and 12508 transitions. [2019-12-27 11:05:03,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 11:05:03,434 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 77 [2019-12-27 11:05:03,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 11:05:03,441 INFO L225 Difference]: With dead ends: 5669 [2019-12-27 11:05:03,441 INFO L226 Difference]: Without dead ends: 5616 [2019-12-27 11:05:03,442 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2019-12-27 11:05:03,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5616 states. [2019-12-27 11:05:03,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5616 to 4983. [2019-12-27 11:05:03,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4983 states. [2019-12-27 11:05:03,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4983 states to 4983 states and 10993 transitions. [2019-12-27 11:05:03,491 INFO L78 Accepts]: Start accepts. Automaton has 4983 states and 10993 transitions. Word has length 77 [2019-12-27 11:05:03,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 11:05:03,492 INFO L462 AbstractCegarLoop]: Abstraction has 4983 states and 10993 transitions. [2019-12-27 11:05:03,492 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 11:05:03,492 INFO L276 IsEmpty]: Start isEmpty. Operand 4983 states and 10993 transitions. [2019-12-27 11:05:03,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-27 11:05:03,497 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 11:05:03,497 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, 1, 1, 1, 1, 1, 1, 1, 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-27 11:05:03,497 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 11:05:03,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 11:05:03,497 INFO L82 PathProgramCache]: Analyzing trace with hash -283880815, now seen corresponding path program 1 times [2019-12-27 11:05:03,498 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 11:05:03,498 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724140474] [2019-12-27 11:05:03,498 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 11:05:03,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 11:05:03,564 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-27 11:05:03,565 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724140474] [2019-12-27 11:05:03,566 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 11:05:03,566 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 11:05:03,566 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734947518] [2019-12-27 11:05:03,566 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 11:05:03,567 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 11:05:03,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 11:05:03,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 11:05:03,567 INFO L87 Difference]: Start difference. First operand 4983 states and 10993 transitions. Second operand 5 states. [2019-12-27 11:05:03,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 11:05:03,883 INFO L93 Difference]: Finished difference Result 5858 states and 12866 transitions. [2019-12-27 11:05:03,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 11:05:03,884 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 98 [2019-12-27 11:05:03,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 11:05:03,892 INFO L225 Difference]: With dead ends: 5858 [2019-12-27 11:05:03,892 INFO L226 Difference]: Without dead ends: 5858 [2019-12-27 11:05:03,893 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-27 11:05:03,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5858 states. [2019-12-27 11:05:03,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5858 to 5105. [2019-12-27 11:05:03,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5105 states. [2019-12-27 11:05:03,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5105 states to 5105 states and 11259 transitions. [2019-12-27 11:05:03,978 INFO L78 Accepts]: Start accepts. Automaton has 5105 states and 11259 transitions. Word has length 98 [2019-12-27 11:05:03,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 11:05:03,978 INFO L462 AbstractCegarLoop]: Abstraction has 5105 states and 11259 transitions. [2019-12-27 11:05:03,978 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 11:05:03,978 INFO L276 IsEmpty]: Start isEmpty. Operand 5105 states and 11259 transitions. [2019-12-27 11:05:03,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-27 11:05:03,985 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 11:05:03,986 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 11:05:03,986 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 11:05:03,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 11:05:03,987 INFO L82 PathProgramCache]: Analyzing trace with hash 1087998493, now seen corresponding path program 2 times [2019-12-27 11:05:03,987 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 11:05:03,988 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350310292] [2019-12-27 11:05:03,988 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 11:05:04,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 11:05:04,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 11:05:04,163 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350310292] [2019-12-27 11:05:04,164 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 11:05:04,164 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 11:05:04,164 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415163281] [2019-12-27 11:05:04,165 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 11:05:04,167 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 11:05:04,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 11:05:04,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 11:05:04,168 INFO L87 Difference]: Start difference. First operand 5105 states and 11259 transitions. Second operand 7 states. [2019-12-27 11:05:05,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 11:05:05,135 INFO L93 Difference]: Finished difference Result 9237 states and 19996 transitions. [2019-12-27 11:05:05,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-27 11:05:05,136 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 98 [2019-12-27 11:05:05,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 11:05:05,147 INFO L225 Difference]: With dead ends: 9237 [2019-12-27 11:05:05,147 INFO L226 Difference]: Without dead ends: 9183 [2019-12-27 11:05:05,148 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2019-12-27 11:05:05,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9183 states. [2019-12-27 11:05:05,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9183 to 7575. [2019-12-27 11:05:05,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7575 states. [2019-12-27 11:05:05,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7575 states to 7575 states and 16492 transitions. [2019-12-27 11:05:05,236 INFO L78 Accepts]: Start accepts. Automaton has 7575 states and 16492 transitions. Word has length 98 [2019-12-27 11:05:05,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 11:05:05,236 INFO L462 AbstractCegarLoop]: Abstraction has 7575 states and 16492 transitions. [2019-12-27 11:05:05,236 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 11:05:05,236 INFO L276 IsEmpty]: Start isEmpty. Operand 7575 states and 16492 transitions. [2019-12-27 11:05:05,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-27 11:05:05,245 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 11:05:05,245 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 11:05:05,245 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 11:05:05,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 11:05:05,246 INFO L82 PathProgramCache]: Analyzing trace with hash 1119018300, now seen corresponding path program 1 times [2019-12-27 11:05:05,246 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 11:05:05,246 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485129978] [2019-12-27 11:05:05,246 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 11:05:05,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 11:05:05,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 11:05:05,348 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485129978] [2019-12-27 11:05:05,349 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 11:05:05,349 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 11:05:05,349 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508949514] [2019-12-27 11:05:05,349 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 11:05:05,349 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 11:05:05,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 11:05:05,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 11:05:05,353 INFO L87 Difference]: Start difference. First operand 7575 states and 16492 transitions. Second operand 7 states. [2019-12-27 11:05:06,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 11:05:06,336 INFO L93 Difference]: Finished difference Result 10520 states and 22647 transitions. [2019-12-27 11:05:06,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 11:05:06,336 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 98 [2019-12-27 11:05:06,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 11:05:06,347 INFO L225 Difference]: With dead ends: 10520 [2019-12-27 11:05:06,347 INFO L226 Difference]: Without dead ends: 10520 [2019-12-27 11:05:06,348 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=225, Unknown=0, NotChecked=0, Total=306 [2019-12-27 11:05:06,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10520 states. [2019-12-27 11:05:06,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10520 to 8308. [2019-12-27 11:05:06,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8308 states. [2019-12-27 11:05:06,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8308 states to 8308 states and 18105 transitions. [2019-12-27 11:05:06,440 INFO L78 Accepts]: Start accepts. Automaton has 8308 states and 18105 transitions. Word has length 98 [2019-12-27 11:05:06,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 11:05:06,441 INFO L462 AbstractCegarLoop]: Abstraction has 8308 states and 18105 transitions. [2019-12-27 11:05:06,441 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 11:05:06,441 INFO L276 IsEmpty]: Start isEmpty. Operand 8308 states and 18105 transitions. [2019-12-27 11:05:06,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-27 11:05:06,449 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 11:05:06,449 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, 1, 1, 1, 1, 1, 1, 1, 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-27 11:05:06,450 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 11:05:06,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 11:05:06,450 INFO L82 PathProgramCache]: Analyzing trace with hash -919037989, now seen corresponding path program 1 times [2019-12-27 11:05:06,450 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 11:05:06,450 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217657810] [2019-12-27 11:05:06,451 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 11:05:06,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 11:05:06,509 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-27 11:05:06,510 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217657810] [2019-12-27 11:05:06,510 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 11:05:06,510 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 11:05:06,510 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686974547] [2019-12-27 11:05:06,511 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 11:05:06,511 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 11:05:06,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 11:05:06,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 11:05:06,511 INFO L87 Difference]: Start difference. First operand 8308 states and 18105 transitions. Second operand 4 states. [2019-12-27 11:05:06,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 11:05:06,624 INFO L93 Difference]: Finished difference Result 8762 states and 18993 transitions. [2019-12-27 11:05:06,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 11:05:06,624 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-12-27 11:05:06,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 11:05:06,636 INFO L225 Difference]: With dead ends: 8762 [2019-12-27 11:05:06,636 INFO L226 Difference]: Without dead ends: 8680 [2019-12-27 11:05:06,637 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 11:05:06,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8680 states. [2019-12-27 11:05:06,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8680 to 7394. [2019-12-27 11:05:06,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7394 states. [2019-12-27 11:05:06,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7394 states to 7394 states and 16140 transitions. [2019-12-27 11:05:06,740 INFO L78 Accepts]: Start accepts. Automaton has 7394 states and 16140 transitions. Word has length 98 [2019-12-27 11:05:06,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 11:05:06,741 INFO L462 AbstractCegarLoop]: Abstraction has 7394 states and 16140 transitions. [2019-12-27 11:05:06,741 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 11:05:06,741 INFO L276 IsEmpty]: Start isEmpty. Operand 7394 states and 16140 transitions. [2019-12-27 11:05:06,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-12-27 11:05:06,748 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 11:05:06,748 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 11:05:06,748 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 11:05:06,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 11:05:06,749 INFO L82 PathProgramCache]: Analyzing trace with hash 663708553, now seen corresponding path program 1 times [2019-12-27 11:05:06,749 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 11:05:06,749 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821446601] [2019-12-27 11:05:06,749 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 11:05:06,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 11:05:06,844 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-27 11:05:06,844 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821446601] [2019-12-27 11:05:06,845 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 11:05:06,845 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 11:05:06,845 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584625931] [2019-12-27 11:05:06,845 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 11:05:06,845 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 11:05:06,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 11:05:06,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-27 11:05:06,846 INFO L87 Difference]: Start difference. First operand 7394 states and 16140 transitions. Second operand 6 states. [2019-12-27 11:05:07,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 11:05:07,170 INFO L93 Difference]: Finished difference Result 8034 states and 17448 transitions. [2019-12-27 11:05:07,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 11:05:07,170 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 100 [2019-12-27 11:05:07,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 11:05:07,183 INFO L225 Difference]: With dead ends: 8034 [2019-12-27 11:05:07,183 INFO L226 Difference]: Without dead ends: 8034 [2019-12-27 11:05:07,183 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-27 11:05:07,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8034 states. [2019-12-27 11:05:07,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8034 to 7266. [2019-12-27 11:05:07,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7266 states. [2019-12-27 11:05:07,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7266 states to 7266 states and 15909 transitions. [2019-12-27 11:05:07,315 INFO L78 Accepts]: Start accepts. Automaton has 7266 states and 15909 transitions. Word has length 100 [2019-12-27 11:05:07,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 11:05:07,316 INFO L462 AbstractCegarLoop]: Abstraction has 7266 states and 15909 transitions. [2019-12-27 11:05:07,316 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 11:05:07,316 INFO L276 IsEmpty]: Start isEmpty. Operand 7266 states and 15909 transitions. [2019-12-27 11:05:07,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-12-27 11:05:07,325 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 11:05:07,325 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 11:05:07,326 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 11:05:07,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 11:05:07,326 INFO L82 PathProgramCache]: Analyzing trace with hash -582643184, now seen corresponding path program 1 times [2019-12-27 11:05:07,326 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 11:05:07,326 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207886679] [2019-12-27 11:05:07,327 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 11:05:07,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 11:05:07,409 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-27 11:05:07,409 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207886679] [2019-12-27 11:05:07,409 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 11:05:07,409 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 11:05:07,410 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575490183] [2019-12-27 11:05:07,410 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 11:05:07,410 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 11:05:07,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 11:05:07,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 11:05:07,411 INFO L87 Difference]: Start difference. First operand 7266 states and 15909 transitions. Second operand 5 states. [2019-12-27 11:05:07,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 11:05:07,526 INFO L93 Difference]: Finished difference Result 7889 states and 17236 transitions. [2019-12-27 11:05:07,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 11:05:07,527 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 100 [2019-12-27 11:05:07,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 11:05:07,535 INFO L225 Difference]: With dead ends: 7889 [2019-12-27 11:05:07,535 INFO L226 Difference]: Without dead ends: 7889 [2019-12-27 11:05:07,535 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 11:05:07,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7889 states. [2019-12-27 11:05:07,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7889 to 6234. [2019-12-27 11:05:07,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6234 states. [2019-12-27 11:05:07,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6234 states to 6234 states and 13642 transitions. [2019-12-27 11:05:07,604 INFO L78 Accepts]: Start accepts. Automaton has 6234 states and 13642 transitions. Word has length 100 [2019-12-27 11:05:07,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 11:05:07,604 INFO L462 AbstractCegarLoop]: Abstraction has 6234 states and 13642 transitions. [2019-12-27 11:05:07,604 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 11:05:07,604 INFO L276 IsEmpty]: Start isEmpty. Operand 6234 states and 13642 transitions. [2019-12-27 11:05:07,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-12-27 11:05:07,610 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 11:05:07,610 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 11:05:07,611 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 11:05:07,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 11:05:07,612 INFO L82 PathProgramCache]: Analyzing trace with hash -231843247, now seen corresponding path program 1 times [2019-12-27 11:05:07,612 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 11:05:07,612 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560782603] [2019-12-27 11:05:07,612 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 11:05:07,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 11:05:07,676 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-27 11:05:07,677 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560782603] [2019-12-27 11:05:07,677 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 11:05:07,677 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 11:05:07,677 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672505249] [2019-12-27 11:05:07,678 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 11:05:07,678 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 11:05:07,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 11:05:07,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 11:05:07,678 INFO L87 Difference]: Start difference. First operand 6234 states and 13642 transitions. Second operand 4 states. [2019-12-27 11:05:07,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 11:05:07,936 INFO L93 Difference]: Finished difference Result 7306 states and 15945 transitions. [2019-12-27 11:05:07,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 11:05:07,936 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2019-12-27 11:05:07,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 11:05:07,946 INFO L225 Difference]: With dead ends: 7306 [2019-12-27 11:05:07,946 INFO L226 Difference]: Without dead ends: 7268 [2019-12-27 11:05:07,946 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 11:05:07,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7268 states. [2019-12-27 11:05:08,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7268 to 6191. [2019-12-27 11:05:08,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6191 states. [2019-12-27 11:05:08,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6191 states to 6191 states and 13665 transitions. [2019-12-27 11:05:08,069 INFO L78 Accepts]: Start accepts. Automaton has 6191 states and 13665 transitions. Word has length 100 [2019-12-27 11:05:08,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 11:05:08,069 INFO L462 AbstractCegarLoop]: Abstraction has 6191 states and 13665 transitions. [2019-12-27 11:05:08,070 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 11:05:08,070 INFO L276 IsEmpty]: Start isEmpty. Operand 6191 states and 13665 transitions. [2019-12-27 11:05:08,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-12-27 11:05:08,080 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 11:05:08,080 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 11:05:08,080 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 11:05:08,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 11:05:08,081 INFO L82 PathProgramCache]: Analyzing trace with hash -200823440, now seen corresponding path program 1 times [2019-12-27 11:05:08,081 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 11:05:08,082 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542780429] [2019-12-27 11:05:08,082 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 11:05:08,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 11:05:08,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 11:05:08,236 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542780429] [2019-12-27 11:05:08,236 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 11:05:08,236 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 11:05:08,236 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74773536] [2019-12-27 11:05:08,237 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 11:05:08,237 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 11:05:08,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 11:05:08,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-27 11:05:08,238 INFO L87 Difference]: Start difference. First operand 6191 states and 13665 transitions. Second operand 7 states. [2019-12-27 11:05:08,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 11:05:08,436 INFO L93 Difference]: Finished difference Result 6972 states and 15270 transitions. [2019-12-27 11:05:08,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 11:05:08,437 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 100 [2019-12-27 11:05:08,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 11:05:08,446 INFO L225 Difference]: With dead ends: 6972 [2019-12-27 11:05:08,447 INFO L226 Difference]: Without dead ends: 6972 [2019-12-27 11:05:08,447 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-12-27 11:05:08,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6972 states. [2019-12-27 11:05:08,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6972 to 5810. [2019-12-27 11:05:08,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5810 states. [2019-12-27 11:05:08,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5810 states to 5810 states and 12734 transitions. [2019-12-27 11:05:08,538 INFO L78 Accepts]: Start accepts. Automaton has 5810 states and 12734 transitions. Word has length 100 [2019-12-27 11:05:08,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 11:05:08,538 INFO L462 AbstractCegarLoop]: Abstraction has 5810 states and 12734 transitions. [2019-12-27 11:05:08,538 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 11:05:08,538 INFO L276 IsEmpty]: Start isEmpty. Operand 5810 states and 12734 transitions. [2019-12-27 11:05:08,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-12-27 11:05:08,546 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 11:05:08,546 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 11:05:08,546 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 11:05:08,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 11:05:08,547 INFO L82 PathProgramCache]: Analyzing trace with hash 2056087567, now seen corresponding path program 1 times [2019-12-27 11:05:08,547 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 11:05:08,547 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387070950] [2019-12-27 11:05:08,547 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 11:05:08,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 11:05:08,704 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-27 11:05:08,704 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387070950] [2019-12-27 11:05:08,704 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 11:05:08,704 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 11:05:08,705 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796426639] [2019-12-27 11:05:08,705 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 11:05:08,705 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 11:05:08,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 11:05:08,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-27 11:05:08,706 INFO L87 Difference]: Start difference. First operand 5810 states and 12734 transitions. Second operand 8 states. [2019-12-27 11:05:08,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 11:05:08,837 INFO L93 Difference]: Finished difference Result 9717 states and 21466 transitions. [2019-12-27 11:05:08,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 11:05:08,837 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 100 [2019-12-27 11:05:08,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 11:05:08,843 INFO L225 Difference]: With dead ends: 9717 [2019-12-27 11:05:08,844 INFO L226 Difference]: Without dead ends: 4100 [2019-12-27 11:05:08,844 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2019-12-27 11:05:08,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4100 states. [2019-12-27 11:05:08,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4100 to 4100. [2019-12-27 11:05:08,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4100 states. [2019-12-27 11:05:08,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4100 states to 4100 states and 9096 transitions. [2019-12-27 11:05:08,906 INFO L78 Accepts]: Start accepts. Automaton has 4100 states and 9096 transitions. Word has length 100 [2019-12-27 11:05:08,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 11:05:08,906 INFO L462 AbstractCegarLoop]: Abstraction has 4100 states and 9096 transitions. [2019-12-27 11:05:08,906 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 11:05:08,906 INFO L276 IsEmpty]: Start isEmpty. Operand 4100 states and 9096 transitions. [2019-12-27 11:05:08,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-12-27 11:05:08,911 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 11:05:08,912 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 11:05:08,912 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 11:05:08,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 11:05:08,912 INFO L82 PathProgramCache]: Analyzing trace with hash -752397989, now seen corresponding path program 2 times [2019-12-27 11:05:08,912 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 11:05:08,913 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129951482] [2019-12-27 11:05:08,913 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 11:05:08,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 11:05:09,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-27 11:05:09,070 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129951482] [2019-12-27 11:05:09,071 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 11:05:09,071 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 11:05:09,071 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325699281] [2019-12-27 11:05:09,071 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 11:05:09,071 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 11:05:09,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 11:05:09,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-12-27 11:05:09,072 INFO L87 Difference]: Start difference. First operand 4100 states and 9096 transitions. Second operand 10 states. [2019-12-27 11:05:09,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 11:05:09,567 INFO L93 Difference]: Finished difference Result 8981 states and 20031 transitions. [2019-12-27 11:05:09,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-27 11:05:09,568 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 100 [2019-12-27 11:05:09,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 11:05:09,575 INFO L225 Difference]: With dead ends: 8981 [2019-12-27 11:05:09,575 INFO L226 Difference]: Without dead ends: 5787 [2019-12-27 11:05:09,575 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=107, Invalid=445, Unknown=0, NotChecked=0, Total=552 [2019-12-27 11:05:09,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5787 states. [2019-12-27 11:05:09,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5787 to 4125. [2019-12-27 11:05:09,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4125 states. [2019-12-27 11:05:09,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4125 states to 4125 states and 9102 transitions. [2019-12-27 11:05:09,623 INFO L78 Accepts]: Start accepts. Automaton has 4125 states and 9102 transitions. Word has length 100 [2019-12-27 11:05:09,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 11:05:09,623 INFO L462 AbstractCegarLoop]: Abstraction has 4125 states and 9102 transitions. [2019-12-27 11:05:09,623 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 11:05:09,624 INFO L276 IsEmpty]: Start isEmpty. Operand 4125 states and 9102 transitions. [2019-12-27 11:05:09,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-12-27 11:05:09,661 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 11:05:09,661 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 11:05:09,661 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 11:05:09,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 11:05:09,662 INFO L82 PathProgramCache]: Analyzing trace with hash -998334121, now seen corresponding path program 1 times [2019-12-27 11:05:09,662 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 11:05:09,662 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883540814] [2019-12-27 11:05:09,662 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 11:05:09,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 11:05:09,785 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-27 11:05:09,785 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883540814] [2019-12-27 11:05:09,786 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 11:05:09,786 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 11:05:09,786 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185960050] [2019-12-27 11:05:09,786 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 11:05:09,786 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 11:05:09,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 11:05:09,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-27 11:05:09,788 INFO L87 Difference]: Start difference. First operand 4125 states and 9102 transitions. Second operand 6 states. [2019-12-27 11:05:09,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 11:05:09,999 INFO L93 Difference]: Finished difference Result 4585 states and 10046 transitions. [2019-12-27 11:05:10,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 11:05:10,000 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 100 [2019-12-27 11:05:10,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 11:05:10,008 INFO L225 Difference]: With dead ends: 4585 [2019-12-27 11:05:10,009 INFO L226 Difference]: Without dead ends: 4555 [2019-12-27 11:05:10,011 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-12-27 11:05:10,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4555 states. [2019-12-27 11:05:10,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4555 to 4058. [2019-12-27 11:05:10,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4058 states. [2019-12-27 11:05:10,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4058 states to 4058 states and 8905 transitions. [2019-12-27 11:05:10,098 INFO L78 Accepts]: Start accepts. Automaton has 4058 states and 8905 transitions. Word has length 100 [2019-12-27 11:05:10,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 11:05:10,098 INFO L462 AbstractCegarLoop]: Abstraction has 4058 states and 8905 transitions. [2019-12-27 11:05:10,098 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 11:05:10,099 INFO L276 IsEmpty]: Start isEmpty. Operand 4058 states and 8905 transitions. [2019-12-27 11:05:10,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-12-27 11:05:10,106 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 11:05:10,106 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 11:05:10,106 INFO L410 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 11:05:10,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 11:05:10,107 INFO L82 PathProgramCache]: Analyzing trace with hash 473181100, now seen corresponding path program 1 times [2019-12-27 11:05:10,107 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 11:05:10,107 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199872339] [2019-12-27 11:05:10,108 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 11:05:10,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 11:05:10,200 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-27 11:05:10,201 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199872339] [2019-12-27 11:05:10,201 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 11:05:10,201 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 11:05:10,201 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269776951] [2019-12-27 11:05:10,202 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 11:05:10,202 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 11:05:10,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 11:05:10,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 11:05:10,202 INFO L87 Difference]: Start difference. First operand 4058 states and 8905 transitions. Second operand 5 states. [2019-12-27 11:05:10,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 11:05:10,524 INFO L93 Difference]: Finished difference Result 4854 states and 10529 transitions. [2019-12-27 11:05:10,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 11:05:10,525 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 100 [2019-12-27 11:05:10,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 11:05:10,533 INFO L225 Difference]: With dead ends: 4854 [2019-12-27 11:05:10,533 INFO L226 Difference]: Without dead ends: 4782 [2019-12-27 11:05:10,534 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-27 11:05:10,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4782 states. [2019-12-27 11:05:10,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4782 to 4173. [2019-12-27 11:05:10,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4173 states. [2019-12-27 11:05:10,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4173 states to 4173 states and 9144 transitions. [2019-12-27 11:05:10,606 INFO L78 Accepts]: Start accepts. Automaton has 4173 states and 9144 transitions. Word has length 100 [2019-12-27 11:05:10,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 11:05:10,606 INFO L462 AbstractCegarLoop]: Abstraction has 4173 states and 9144 transitions. [2019-12-27 11:05:10,606 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 11:05:10,607 INFO L276 IsEmpty]: Start isEmpty. Operand 4173 states and 9144 transitions. [2019-12-27 11:05:10,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-12-27 11:05:10,612 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 11:05:10,612 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 11:05:10,613 INFO L410 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 11:05:10,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 11:05:10,613 INFO L82 PathProgramCache]: Analyzing trace with hash 243680910, now seen corresponding path program 1 times [2019-12-27 11:05:10,613 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 11:05:10,613 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977517708] [2019-12-27 11:05:10,613 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 11:05:10,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 11:05:10,728 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-27 11:05:10,729 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977517708] [2019-12-27 11:05:10,729 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 11:05:10,729 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 11:05:10,729 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116885055] [2019-12-27 11:05:10,730 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 11:05:10,730 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 11:05:10,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 11:05:10,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 11:05:10,730 INFO L87 Difference]: Start difference. First operand 4173 states and 9144 transitions. Second operand 6 states. [2019-12-27 11:05:10,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 11:05:10,918 INFO L93 Difference]: Finished difference Result 4365 states and 9533 transitions. [2019-12-27 11:05:10,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 11:05:10,918 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 100 [2019-12-27 11:05:10,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 11:05:10,926 INFO L225 Difference]: With dead ends: 4365 [2019-12-27 11:05:10,926 INFO L226 Difference]: Without dead ends: 4365 [2019-12-27 11:05:10,931 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-12-27 11:05:10,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4365 states. [2019-12-27 11:05:11,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4365 to 4106. [2019-12-27 11:05:11,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4106 states. [2019-12-27 11:05:11,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4106 states to 4106 states and 8999 transitions. [2019-12-27 11:05:11,013 INFO L78 Accepts]: Start accepts. Automaton has 4106 states and 8999 transitions. Word has length 100 [2019-12-27 11:05:11,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 11:05:11,014 INFO L462 AbstractCegarLoop]: Abstraction has 4106 states and 8999 transitions. [2019-12-27 11:05:11,014 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 11:05:11,014 INFO L276 IsEmpty]: Start isEmpty. Operand 4106 states and 8999 transitions. [2019-12-27 11:05:11,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-12-27 11:05:11,021 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 11:05:11,021 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 11:05:11,021 INFO L410 AbstractCegarLoop]: === Iteration 35 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 11:05:11,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 11:05:11,022 INFO L82 PathProgramCache]: Analyzing trace with hash -1921017704, now seen corresponding path program 1 times [2019-12-27 11:05:11,022 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 11:05:11,022 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160385381] [2019-12-27 11:05:11,023 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 11:05:11,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 11:05:11,205 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-27 11:05:11,206 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160385381] [2019-12-27 11:05:11,206 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 11:05:11,206 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 11:05:11,206 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137741227] [2019-12-27 11:05:11,207 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 11:05:11,207 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 11:05:11,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 11:05:11,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 11:05:11,208 INFO L87 Difference]: Start difference. First operand 4106 states and 8999 transitions. Second operand 7 states. [2019-12-27 11:05:11,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 11:05:11,511 INFO L93 Difference]: Finished difference Result 4359 states and 9507 transitions. [2019-12-27 11:05:11,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 11:05:11,512 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 100 [2019-12-27 11:05:11,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 11:05:11,518 INFO L225 Difference]: With dead ends: 4359 [2019-12-27 11:05:11,518 INFO L226 Difference]: Without dead ends: 4359 [2019-12-27 11:05:11,518 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2019-12-27 11:05:11,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4359 states. [2019-12-27 11:05:11,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4359 to 4098. [2019-12-27 11:05:11,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4098 states. [2019-12-27 11:05:11,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4098 states to 4098 states and 8963 transitions. [2019-12-27 11:05:11,557 INFO L78 Accepts]: Start accepts. Automaton has 4098 states and 8963 transitions. Word has length 100 [2019-12-27 11:05:11,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 11:05:11,557 INFO L462 AbstractCegarLoop]: Abstraction has 4098 states and 8963 transitions. [2019-12-27 11:05:11,557 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 11:05:11,557 INFO L276 IsEmpty]: Start isEmpty. Operand 4098 states and 8963 transitions. [2019-12-27 11:05:11,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-12-27 11:05:11,561 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 11:05:11,561 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 11:05:11,561 INFO L410 AbstractCegarLoop]: === Iteration 36 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 11:05:11,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 11:05:11,562 INFO L82 PathProgramCache]: Analyzing trace with hash 1451347705, now seen corresponding path program 3 times [2019-12-27 11:05:11,562 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 11:05:11,562 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630592047] [2019-12-27 11:05:11,562 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 11:05:11,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 11:05:11,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 11:05:11,691 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 11:05:11,691 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 11:05:11,944 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 11:05:11 BasicIcfg [2019-12-27 11:05:11,945 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 11:05:11,950 INFO L168 Benchmark]: Toolchain (without parser) took 53786.08 ms. Allocated memory was 138.4 MB in the beginning and 2.6 GB in the end (delta: 2.5 GB). Free memory was 101.6 MB in the beginning and 1.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. [2019-12-27 11:05:11,950 INFO L168 Benchmark]: CDTParser took 1.36 ms. Allocated memory is still 138.4 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-27 11:05:11,951 INFO L168 Benchmark]: CACSL2BoogieTranslator took 741.66 ms. Allocated memory was 138.4 MB in the beginning and 202.9 MB in the end (delta: 64.5 MB). Free memory was 101.4 MB in the beginning and 156.8 MB in the end (delta: -55.4 MB). Peak memory consumption was 25.9 MB. Max. memory is 7.1 GB. [2019-12-27 11:05:11,951 INFO L168 Benchmark]: Boogie Procedure Inliner took 74.72 ms. Allocated memory is still 202.9 MB. Free memory was 156.8 MB in the beginning and 154.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 11:05:11,951 INFO L168 Benchmark]: Boogie Preprocessor took 35.28 ms. Allocated memory is still 202.9 MB. Free memory was 154.1 MB in the beginning and 152.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 11:05:11,952 INFO L168 Benchmark]: RCFGBuilder took 790.83 ms. Allocated memory is still 202.9 MB. Free memory was 152.1 MB in the beginning and 107.5 MB in the end (delta: 44.7 MB). Peak memory consumption was 44.7 MB. Max. memory is 7.1 GB. [2019-12-27 11:05:11,952 INFO L168 Benchmark]: TraceAbstraction took 52138.16 ms. Allocated memory was 202.9 MB in the beginning and 2.6 GB in the end (delta: 2.4 GB). Free memory was 106.8 MB in the beginning and 1.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. [2019-12-27 11:05:11,954 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.36 ms. Allocated memory is still 138.4 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 741.66 ms. Allocated memory was 138.4 MB in the beginning and 202.9 MB in the end (delta: 64.5 MB). Free memory was 101.4 MB in the beginning and 156.8 MB in the end (delta: -55.4 MB). Peak memory consumption was 25.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 74.72 ms. Allocated memory is still 202.9 MB. Free memory was 156.8 MB in the beginning and 154.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 35.28 ms. Allocated memory is still 202.9 MB. Free memory was 154.1 MB in the beginning and 152.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 790.83 ms. Allocated memory is still 202.9 MB. Free memory was 152.1 MB in the beginning and 107.5 MB in the end (delta: 44.7 MB). Peak memory consumption was 44.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 52138.16 ms. Allocated memory was 202.9 MB in the beginning and 2.6 GB in the end (delta: 2.4 GB). Free memory was 106.8 MB in the beginning and 1.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L694] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L696] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L698] 0 int __unbuffered_p0_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0] [L700] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0] [L702] 0 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L704] 0 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0] [L705] 0 _Bool a$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0] [L706] 0 int a$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0] [L707] 0 _Bool a$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0] [L708] 0 _Bool a$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0] [L709] 0 _Bool a$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0] [L710] 0 _Bool a$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0] [L711] 0 _Bool a$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0] [L712] 0 _Bool a$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0] [L713] 0 _Bool a$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0] [L714] 0 int *a$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}] [L715] 0 int a$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0] [L716] 0 _Bool a$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0] [L717] 0 int a$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0] [L718] 0 _Bool a$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0] [L719] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0] [L720] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0] [L722] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L724] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L726] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0] [L727] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, z=0] [L728] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L813] 0 pthread_t t833; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L814] FCALL, FORK 0 pthread_create(&t833, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L815] 0 pthread_t t834; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L732] 1 a$w_buff1 = a$w_buff0 [L733] 1 a$w_buff0 = 1 [L734] 1 a$w_buff1_used = a$w_buff0_used [L735] 1 a$w_buff0_used = (_Bool)1 [L4] COND FALSE 1 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L816] FCALL, FORK 0 pthread_create(&t834, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L737] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L738] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L739] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L740] 1 a$r_buff0_thd1 = (_Bool)1 [L743] 1 x = 1 [L746] 1 __unbuffered_p0_EAX = x [L749] 1 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L766] 2 y = 1 [L769] 2 z = 1 [L772] 2 __unbuffered_p1_EAX = z [L775] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L776] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L777] 2 a$flush_delayed = weak$$choice2 [L778] 2 a$mem_tmp = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L779] EXPR 2 !a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff1) VAL [!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L779] 2 a = !a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff1) [L780] EXPR 2 weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff0))=1, x=1, y=1, z=1] [L780] 2 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff0)) [L752] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L781] EXPR 2 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff1 : a$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff1 : a$w_buff1))=0, x=1, y=1, z=1] [L781] 2 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff1 : a$w_buff1)) [L782] EXPR 2 weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used))=1, x=1, y=1, z=1] [L782] 2 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used)) [L783] EXPR 2 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=1] [L783] 2 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L784] EXPR 2 weak$$choice2 ? a$r_buff0_thd2 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$r_buff0_thd2 : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? a$r_buff0_thd2 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$r_buff0_thd2 : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2))=0, x=1, y=1, z=1] [L784] 2 a$r_buff0_thd2 = weak$$choice2 ? a$r_buff0_thd2 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$r_buff0_thd2 : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2)) [L785] EXPR 2 weak$$choice2 ? a$r_buff1_thd2 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$r_buff1_thd2 : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? a$r_buff1_thd2 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$r_buff1_thd2 : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=1] [L785] 2 a$r_buff1_thd2 = weak$$choice2 ? a$r_buff1_thd2 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$r_buff1_thd2 : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L786] 2 __unbuffered_p1_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L752] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L753] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L753] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L754] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L754] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L755] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L787] EXPR 2 a$flush_delayed ? a$mem_tmp : a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, a$flush_delayed=1, a$flush_delayed ? a$mem_tmp : a=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L787] 2 a = a$flush_delayed ? a$mem_tmp : a [L788] 2 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L791] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L791] EXPR 2 a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L791] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a)=0, a$w_buff1=0, a$w_buff1_used=0, a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L791] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L792] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L792] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L755] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L793] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L793] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L756] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L794] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L794] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L795] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L795] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 [L798] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L756] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 [L759] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L818] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L822] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L822] EXPR 0 a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L822] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L822] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L823] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L823] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L824] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L824] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L825] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L825] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L826] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L826] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 [L829] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L4] COND TRUE 0 !expression VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L4] 0 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 145 locations, 2 error locations. Result: UNSAFE, OverallTime: 51.6s, OverallIterations: 36, TraceHistogramMax: 1, AutomataDifference: 19.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 9561 SDtfs, 10567 SDslu, 21178 SDs, 0 SdLazy, 7836 SolverSat, 501 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 358 GetRequests, 100 SyntacticMatches, 23 SemanticMatches, 235 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 285 ImplicationChecksByTransitivity, 2.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=71016occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 26.2s AutomataMinimizationTime, 35 MinimizatonAttempts, 85476 StatesRemovedByMinimization, 33 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 2809 NumberOfCodeBlocks, 2809 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 2674 ConstructedInterpolants, 0 QuantifiedInterpolants, 598658 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 35 InterpolantComputations, 35 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...