/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-fae578e [2019-12-19 01:59:36,933 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-19 01:59:36,936 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-19 01:59:36,952 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-19 01:59:36,953 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-19 01:59:36,954 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-19 01:59:36,955 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-19 01:59:36,957 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-19 01:59:36,959 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-19 01:59:36,960 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-19 01:59:36,961 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-19 01:59:36,962 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-19 01:59:36,962 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-19 01:59:36,963 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-19 01:59:36,964 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-19 01:59:36,965 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-19 01:59:36,966 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-19 01:59:36,967 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-19 01:59:36,969 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-19 01:59:36,971 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-19 01:59:36,972 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-19 01:59:36,974 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-19 01:59:36,975 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-19 01:59:36,976 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-19 01:59:36,978 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-19 01:59:36,978 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-19 01:59:36,979 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-19 01:59:36,980 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-19 01:59:36,980 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-19 01:59:36,981 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-19 01:59:36,981 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-19 01:59:36,982 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-19 01:59:36,983 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-19 01:59:36,984 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-19 01:59:36,985 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-19 01:59:36,986 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-19 01:59:36,986 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-19 01:59:36,986 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-19 01:59:36,989 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-19 01:59:36,990 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-19 01:59:36,991 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-19 01:59:36,991 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-19 01:59:37,016 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-19 01:59:37,017 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-19 01:59:37,019 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-19 01:59:37,019 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-19 01:59:37,019 INFO L138 SettingsManager]: * Use SBE=true [2019-12-19 01:59:37,020 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-19 01:59:37,020 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-19 01:59:37,020 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-19 01:59:37,020 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-19 01:59:37,020 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-19 01:59:37,021 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-19 01:59:37,022 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-19 01:59:37,022 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-19 01:59:37,022 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-19 01:59:37,023 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-19 01:59:37,023 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-19 01:59:37,023 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-19 01:59:37,023 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-19 01:59:37,023 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-19 01:59:37,024 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-19 01:59:37,024 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-19 01:59:37,024 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-19 01:59:37,024 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-19 01:59:37,025 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-19 01:59:37,025 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-19 01:59:37,025 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-19 01:59:37,025 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-19 01:59:37,025 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2019-12-19 01:59:37,026 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-19 01:59:37,026 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-19 01:59:37,330 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-19 01:59:37,351 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-19 01:59:37,354 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-19 01:59:37,356 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-19 01:59:37,356 INFO L275 PluginConnector]: CDTParser initialized [2019-12-19 01:59:37,357 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-19 01:59:37,426 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bf5cf87d8/f34b14390fe74647b1b4a91df1984d0d/FLAG78af89cad [2019-12-19 01:59:37,978 INFO L306 CDTParser]: Found 1 translation units. [2019-12-19 01:59:37,979 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix031_power.oepc.i [2019-12-19 01:59:37,996 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bf5cf87d8/f34b14390fe74647b1b4a91df1984d0d/FLAG78af89cad [2019-12-19 01:59:38,247 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bf5cf87d8/f34b14390fe74647b1b4a91df1984d0d [2019-12-19 01:59:38,256 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-19 01:59:38,258 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-19 01:59:38,259 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-19 01:59:38,259 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-19 01:59:38,266 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-19 01:59:38,267 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 01:59:38" (1/1) ... [2019-12-19 01:59:38,270 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d7b20b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:59:38, skipping insertion in model container [2019-12-19 01:59:38,270 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 01:59:38" (1/1) ... [2019-12-19 01:59:38,278 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-19 01:59:38,341 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-19 01:59:38,902 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-19 01:59:38,921 INFO L203 MainTranslator]: Completed pre-run [2019-12-19 01:59:39,024 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-19 01:59:39,094 INFO L208 MainTranslator]: Completed translation [2019-12-19 01:59:39,095 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:59:39 WrapperNode [2019-12-19 01:59:39,095 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-19 01:59:39,096 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-19 01:59:39,096 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-19 01:59:39,096 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-19 01:59:39,106 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:59:39" (1/1) ... [2019-12-19 01:59:39,125 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:59:39" (1/1) ... [2019-12-19 01:59:39,160 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-19 01:59:39,161 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-19 01:59:39,161 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-19 01:59:39,161 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-19 01:59:39,171 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:59:39" (1/1) ... [2019-12-19 01:59:39,171 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:59:39" (1/1) ... [2019-12-19 01:59:39,175 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:59:39" (1/1) ... [2019-12-19 01:59:39,176 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:59:39" (1/1) ... [2019-12-19 01:59:39,185 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:59:39" (1/1) ... [2019-12-19 01:59:39,189 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:59:39" (1/1) ... [2019-12-19 01:59:39,193 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:59:39" (1/1) ... [2019-12-19 01:59:39,198 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-19 01:59:39,198 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-19 01:59:39,198 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-19 01:59:39,199 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-19 01:59:39,200 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:59:39" (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-19 01:59:39,264 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-19 01:59:39,264 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-19 01:59:39,264 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-19 01:59:39,265 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-19 01:59:39,265 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-19 01:59:39,265 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-19 01:59:39,265 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-19 01:59:39,266 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-19 01:59:39,266 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-19 01:59:39,267 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-19 01:59:39,267 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-19 01:59:39,270 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-19 01:59:40,021 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-19 01:59:40,021 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-19 01:59:40,022 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 01:59:40 BoogieIcfgContainer [2019-12-19 01:59:40,023 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-19 01:59:40,024 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-19 01:59:40,024 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-19 01:59:40,027 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-19 01:59:40,028 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.12 01:59:38" (1/3) ... [2019-12-19 01:59:40,029 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f96281e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 01:59:40, skipping insertion in model container [2019-12-19 01:59:40,029 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:59:39" (2/3) ... [2019-12-19 01:59:40,030 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f96281e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 01:59:40, skipping insertion in model container [2019-12-19 01:59:40,030 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 01:59:40" (3/3) ... [2019-12-19 01:59:40,032 INFO L109 eAbstractionObserver]: Analyzing ICFG mix031_power.oepc.i [2019-12-19 01:59:40,043 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-19 01:59:40,043 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-19 01:59:40,052 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-19 01:59:40,053 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-19 01:59:40,096 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:59:40,097 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:59:40,097 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:59:40,097 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:59:40,098 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:59:40,098 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:59:40,099 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:59:40,100 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:59:40,100 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:59:40,101 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:59:40,101 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:59:40,101 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:59:40,102 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:59:40,102 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:59:40,102 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:59:40,102 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:59:40,103 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:59:40,103 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:59:40,103 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:59:40,103 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:59:40,104 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:59:40,104 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:59:40,104 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:59:40,104 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:59:40,104 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:59:40,105 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:59:40,108 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:59:40,109 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:59:40,109 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:59:40,109 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:59:40,109 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:59:40,110 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:59:40,110 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:59:40,110 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:59:40,113 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:59:40,114 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:59:40,114 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:59:40,114 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:59:40,115 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:59:40,115 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:59:40,116 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:59:40,117 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:59:40,117 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:59:40,117 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:59:40,118 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:59:40,118 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:59:40,118 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:59:40,118 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:59:40,118 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:59:40,119 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:59:40,119 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:59:40,119 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:59:40,119 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:59:40,120 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:59:40,120 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:59:40,120 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:59:40,121 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:59:40,122 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:59:40,122 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:59:40,122 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:59:40,122 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:59:40,123 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:59:40,123 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:59:40,123 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:59:40,123 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:59:40,124 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:59:40,124 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:59:40,124 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:59:40,124 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:59:40,125 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:59:40,125 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:59:40,126 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:59:40,127 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:59:40,128 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:59:40,128 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:59:40,128 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:59:40,129 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:59:40,129 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:59:40,129 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:59:40,129 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:59:40,130 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:59:40,130 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:59:40,131 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:59:40,131 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:59:40,131 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:59:40,132 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:59:40,132 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:59:40,132 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:59:40,133 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:59:40,133 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:59:40,134 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:59:40,134 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:59:40,135 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:59:40,135 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:59:40,135 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:59:40,135 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:59:40,136 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:59:40,136 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:59:40,136 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:59:40,137 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:59:40,137 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:59:40,138 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:59:40,138 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:59:40,139 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:59:40,143 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:59:40,145 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:59:40,145 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:59:40,145 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:59:40,153 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:59:40,153 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:59:40,153 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:59:40,154 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:59:40,155 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:59:40,155 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:59:40,155 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:59:40,155 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:59:40,156 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:59:40,156 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:59:40,156 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:59:40,156 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:59:40,157 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:59:40,157 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:59:40,157 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:59:40,157 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:59:40,158 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:59:40,158 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:59:40,158 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:59:40,158 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:59:40,158 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:59:40,159 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:59:40,159 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:59:40,159 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:59:40,159 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:59:40,160 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:59:40,160 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:59:40,160 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:59:40,160 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:59:40,160 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:59:40,161 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:59:40,161 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:59:40,161 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:59:40,162 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:59:40,162 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:59:40,162 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:59:40,162 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:59:40,162 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:59:40,163 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:59:40,163 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:59:40,163 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:59:40,163 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:59:40,164 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:59:40,164 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:59:40,168 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:59:40,169 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:59:40,169 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:59:40,169 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:59:40,169 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:59:40,170 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:59:40,170 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:59:40,170 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:59:40,170 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:59:40,171 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:59:40,171 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:59:40,171 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:59:40,176 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:59:40,176 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:59:40,176 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:59:40,177 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:59:40,177 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:59:40,177 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:59:40,177 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:59:40,178 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:59:40,178 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:59:40,178 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:59:40,178 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:59:40,178 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:59:40,179 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:59:40,179 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:59:40,179 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:59:40,179 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:59:40,180 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:59:40,180 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:59:40,180 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:59:40,180 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:59:40,180 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:59:40,181 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:59:40,181 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:59:40,181 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:59:40,181 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:59:40,182 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:59:40,182 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:59:40,182 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:59:40,182 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:59:40,183 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:59:40,183 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:59:40,183 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:59:40,199 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:59:40,217 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-19 01:59:40,239 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-19 01:59:40,239 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-19 01:59:40,239 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-19 01:59:40,239 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-19 01:59:40,239 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-19 01:59:40,240 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-19 01:59:40,240 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-19 01:59:40,240 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-19 01:59:40,254 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 151 places, 185 transitions [2019-12-19 01:59:42,165 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 32595 states. [2019-12-19 01:59:42,167 INFO L276 IsEmpty]: Start isEmpty. Operand 32595 states. [2019-12-19 01:59:42,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-12-19 01:59:42,174 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 01:59:42,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] [2019-12-19 01:59:42,176 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 01:59:42,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 01:59:42,181 INFO L82 PathProgramCache]: Analyzing trace with hash 1631155360, now seen corresponding path program 1 times [2019-12-19 01:59:42,187 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 01:59:42,188 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965536464] [2019-12-19 01:59:42,188 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 01:59:42,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 01:59:42,516 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-19 01:59:42,517 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965536464] [2019-12-19 01:59:42,519 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 01:59:42,519 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 01:59:42,520 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107312486] [2019-12-19 01:59:42,527 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 01:59:42,527 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 01:59:42,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 01:59:42,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 01:59:42,547 INFO L87 Difference]: Start difference. First operand 32595 states. Second operand 4 states. [2019-12-19 01:59:43,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 01:59:43,459 INFO L93 Difference]: Finished difference Result 33595 states and 129572 transitions. [2019-12-19 01:59:43,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-19 01:59:43,461 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 38 [2019-12-19 01:59:43,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 01:59:43,755 INFO L225 Difference]: With dead ends: 33595 [2019-12-19 01:59:43,755 INFO L226 Difference]: Without dead ends: 25707 [2019-12-19 01:59:43,757 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-19 01:59:45,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25707 states. [2019-12-19 01:59:45,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25707 to 25707. [2019-12-19 01:59:45,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25707 states. [2019-12-19 01:59:46,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25707 states to 25707 states and 99588 transitions. [2019-12-19 01:59:46,142 INFO L78 Accepts]: Start accepts. Automaton has 25707 states and 99588 transitions. Word has length 38 [2019-12-19 01:59:46,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 01:59:46,143 INFO L462 AbstractCegarLoop]: Abstraction has 25707 states and 99588 transitions. [2019-12-19 01:59:46,143 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 01:59:46,143 INFO L276 IsEmpty]: Start isEmpty. Operand 25707 states and 99588 transitions. [2019-12-19 01:59:46,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-19 01:59:46,152 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 01:59:46,152 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-19 01:59:46,152 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 01:59:46,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 01:59:46,153 INFO L82 PathProgramCache]: Analyzing trace with hash 475633161, now seen corresponding path program 1 times [2019-12-19 01:59:46,153 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 01:59:46,154 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886654241] [2019-12-19 01:59:46,154 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 01:59:46,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 01:59:46,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 01:59:46,304 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886654241] [2019-12-19 01:59:46,305 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 01:59:46,305 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 01:59:46,305 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963805958] [2019-12-19 01:59:46,308 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 01:59:46,309 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 01:59:46,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 01:59:46,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 01:59:46,309 INFO L87 Difference]: Start difference. First operand 25707 states and 99588 transitions. Second operand 5 states. [2019-12-19 01:59:47,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 01:59:47,369 INFO L93 Difference]: Finished difference Result 41085 states and 150435 transitions. [2019-12-19 01:59:47,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 01:59:47,370 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 50 [2019-12-19 01:59:47,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 01:59:47,573 INFO L225 Difference]: With dead ends: 41085 [2019-12-19 01:59:47,573 INFO L226 Difference]: Without dead ends: 40549 [2019-12-19 01:59:47,574 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-19 01:59:47,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40549 states. [2019-12-19 01:59:50,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40549 to 38929. [2019-12-19 01:59:50,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38929 states. [2019-12-19 01:59:50,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38929 states to 38929 states and 143585 transitions. [2019-12-19 01:59:50,222 INFO L78 Accepts]: Start accepts. Automaton has 38929 states and 143585 transitions. Word has length 50 [2019-12-19 01:59:50,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 01:59:50,224 INFO L462 AbstractCegarLoop]: Abstraction has 38929 states and 143585 transitions. [2019-12-19 01:59:50,224 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 01:59:50,224 INFO L276 IsEmpty]: Start isEmpty. Operand 38929 states and 143585 transitions. [2019-12-19 01:59:50,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-19 01:59:50,230 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 01:59:50,230 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 01:59:50,230 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 01:59:50,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 01:59:50,231 INFO L82 PathProgramCache]: Analyzing trace with hash -1647317549, now seen corresponding path program 1 times [2019-12-19 01:59:50,231 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 01:59:50,231 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829215197] [2019-12-19 01:59:50,232 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 01:59:50,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 01:59:50,341 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-19 01:59:50,341 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829215197] [2019-12-19 01:59:50,341 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 01:59:50,341 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 01:59:50,342 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826057188] [2019-12-19 01:59:50,343 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 01:59:50,343 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 01:59:50,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 01:59:50,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 01:59:50,344 INFO L87 Difference]: Start difference. First operand 38929 states and 143585 transitions. Second operand 5 states. [2019-12-19 01:59:50,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 01:59:50,959 INFO L93 Difference]: Finished difference Result 49782 states and 180637 transitions. [2019-12-19 01:59:50,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 01:59:50,960 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 51 [2019-12-19 01:59:50,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 01:59:51,100 INFO L225 Difference]: With dead ends: 49782 [2019-12-19 01:59:51,101 INFO L226 Difference]: Without dead ends: 49278 [2019-12-19 01:59:51,101 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-19 01:59:53,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49278 states. [2019-12-19 01:59:53,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49278 to 42681. [2019-12-19 01:59:53,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42681 states. [2019-12-19 01:59:54,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42681 states to 42681 states and 156596 transitions. [2019-12-19 01:59:54,082 INFO L78 Accepts]: Start accepts. Automaton has 42681 states and 156596 transitions. Word has length 51 [2019-12-19 01:59:54,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 01:59:54,083 INFO L462 AbstractCegarLoop]: Abstraction has 42681 states and 156596 transitions. [2019-12-19 01:59:54,083 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 01:59:54,083 INFO L276 IsEmpty]: Start isEmpty. Operand 42681 states and 156596 transitions. [2019-12-19 01:59:54,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-19 01:59:54,092 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 01:59:54,092 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-19 01:59:54,092 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 01:59:54,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 01:59:54,093 INFO L82 PathProgramCache]: Analyzing trace with hash -1552968967, now seen corresponding path program 1 times [2019-12-19 01:59:54,093 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 01:59:54,093 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839517481] [2019-12-19 01:59:54,094 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 01:59:54,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 01:59:54,147 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-19 01:59:54,148 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839517481] [2019-12-19 01:59:54,148 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 01:59:54,148 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-19 01:59:54,149 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372714130] [2019-12-19 01:59:54,149 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-19 01:59:54,149 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 01:59:54,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-19 01:59:54,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-19 01:59:54,150 INFO L87 Difference]: Start difference. First operand 42681 states and 156596 transitions. Second operand 3 states. [2019-12-19 01:59:54,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 01:59:54,427 INFO L93 Difference]: Finished difference Result 61091 states and 221434 transitions. [2019-12-19 01:59:54,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-19 01:59:54,427 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-12-19 01:59:54,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 01:59:54,608 INFO L225 Difference]: With dead ends: 61091 [2019-12-19 01:59:54,608 INFO L226 Difference]: Without dead ends: 61091 [2019-12-19 01:59:54,608 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-19 01:59:56,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61091 states. [2019-12-19 01:59:57,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61091 to 48020. [2019-12-19 01:59:57,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48020 states. [2019-12-19 01:59:58,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48020 states to 48020 states and 174183 transitions. [2019-12-19 01:59:58,145 INFO L78 Accepts]: Start accepts. Automaton has 48020 states and 174183 transitions. Word has length 53 [2019-12-19 01:59:58,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 01:59:58,145 INFO L462 AbstractCegarLoop]: Abstraction has 48020 states and 174183 transitions. [2019-12-19 01:59:58,145 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-19 01:59:58,145 INFO L276 IsEmpty]: Start isEmpty. Operand 48020 states and 174183 transitions. [2019-12-19 01:59:58,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-19 01:59:58,160 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 01:59:58,160 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 01:59:58,161 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 01:59:58,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 01:59:58,161 INFO L82 PathProgramCache]: Analyzing trace with hash -1347337287, now seen corresponding path program 1 times [2019-12-19 01:59:58,161 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 01:59:58,162 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745729026] [2019-12-19 01:59:58,162 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 01:59:58,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 01:59:58,310 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-19 01:59:58,311 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745729026] [2019-12-19 01:59:58,311 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 01:59:58,311 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 01:59:58,311 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331832346] [2019-12-19 01:59:58,312 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 01:59:58,312 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 01:59:58,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 01:59:58,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-19 01:59:58,313 INFO L87 Difference]: Start difference. First operand 48020 states and 174183 transitions. Second operand 6 states. [2019-12-19 01:59:59,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 01:59:59,266 INFO L93 Difference]: Finished difference Result 63760 states and 229383 transitions. [2019-12-19 01:59:59,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 01:59:59,266 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 57 [2019-12-19 01:59:59,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 01:59:59,412 INFO L225 Difference]: With dead ends: 63760 [2019-12-19 01:59:59,412 INFO L226 Difference]: Without dead ends: 63760 [2019-12-19 01:59:59,412 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-19 01:59:59,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63760 states. [2019-12-19 02:00:00,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63760 to 59953. [2019-12-19 02:00:00,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59953 states. [2019-12-19 02:00:04,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59953 states to 59953 states and 215676 transitions. [2019-12-19 02:00:04,047 INFO L78 Accepts]: Start accepts. Automaton has 59953 states and 215676 transitions. Word has length 57 [2019-12-19 02:00:04,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:00:04,047 INFO L462 AbstractCegarLoop]: Abstraction has 59953 states and 215676 transitions. [2019-12-19 02:00:04,047 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 02:00:04,047 INFO L276 IsEmpty]: Start isEmpty. Operand 59953 states and 215676 transitions. [2019-12-19 02:00:04,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-19 02:00:04,066 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:00:04,067 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 02:00:04,067 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:00:04,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:00:04,068 INFO L82 PathProgramCache]: Analyzing trace with hash 1150678650, now seen corresponding path program 1 times [2019-12-19 02:00:04,068 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:00:04,068 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927010910] [2019-12-19 02:00:04,068 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:00:04,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:00:04,234 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-19 02:00:04,235 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927010910] [2019-12-19 02:00:04,236 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:00:04,236 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 02:00:04,236 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245286211] [2019-12-19 02:00:04,237 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 02:00:04,237 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:00:04,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 02:00:04,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-19 02:00:04,238 INFO L87 Difference]: Start difference. First operand 59953 states and 215676 transitions. Second operand 7 states. [2019-12-19 02:00:05,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:00:05,632 INFO L93 Difference]: Finished difference Result 83689 states and 290101 transitions. [2019-12-19 02:00:05,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-19 02:00:05,632 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 57 [2019-12-19 02:00:05,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:00:05,837 INFO L225 Difference]: With dead ends: 83689 [2019-12-19 02:00:05,837 INFO L226 Difference]: Without dead ends: 83689 [2019-12-19 02:00:05,837 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-19 02:00:06,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83689 states. [2019-12-19 02:00:07,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83689 to 71016. [2019-12-19 02:00:07,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71016 states. [2019-12-19 02:00:08,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71016 states to 71016 states and 249890 transitions. [2019-12-19 02:00:08,138 INFO L78 Accepts]: Start accepts. Automaton has 71016 states and 249890 transitions. Word has length 57 [2019-12-19 02:00:08,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:00:08,138 INFO L462 AbstractCegarLoop]: Abstraction has 71016 states and 249890 transitions. [2019-12-19 02:00:08,139 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 02:00:08,139 INFO L276 IsEmpty]: Start isEmpty. Operand 71016 states and 249890 transitions. [2019-12-19 02:00:08,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-19 02:00:08,152 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:00:08,152 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-19 02:00:08,153 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:00:08,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:00:08,153 INFO L82 PathProgramCache]: Analyzing trace with hash 2038182331, now seen corresponding path program 1 times [2019-12-19 02:00:08,153 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:00:08,153 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458392968] [2019-12-19 02:00:08,153 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:00:08,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:00:08,219 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-19 02:00:08,220 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458392968] [2019-12-19 02:00:08,220 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:00:08,220 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-19 02:00:08,220 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271209399] [2019-12-19 02:00:08,221 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-19 02:00:08,221 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:00:08,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-19 02:00:08,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-19 02:00:08,222 INFO L87 Difference]: Start difference. First operand 71016 states and 249890 transitions. Second operand 3 states. [2019-12-19 02:00:08,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:00:08,585 INFO L93 Difference]: Finished difference Result 54025 states and 188922 transitions. [2019-12-19 02:00:08,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-19 02:00:08,586 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2019-12-19 02:00:08,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:00:08,752 INFO L225 Difference]: With dead ends: 54025 [2019-12-19 02:00:08,753 INFO L226 Difference]: Without dead ends: 54025 [2019-12-19 02:00:08,753 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-19 02:00:09,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54025 states. [2019-12-19 02:00:12,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54025 to 53410. [2019-12-19 02:00:12,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53410 states. [2019-12-19 02:00:12,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53410 states to 53410 states and 187041 transitions. [2019-12-19 02:00:12,245 INFO L78 Accepts]: Start accepts. Automaton has 53410 states and 187041 transitions. Word has length 57 [2019-12-19 02:00:12,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:00:12,246 INFO L462 AbstractCegarLoop]: Abstraction has 53410 states and 187041 transitions. [2019-12-19 02:00:12,246 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-19 02:00:12,246 INFO L276 IsEmpty]: Start isEmpty. Operand 53410 states and 187041 transitions. [2019-12-19 02:00:12,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-19 02:00:12,255 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:00:12,255 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-19 02:00:12,255 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:00:12,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:00:12,256 INFO L82 PathProgramCache]: Analyzing trace with hash -565356220, now seen corresponding path program 1 times [2019-12-19 02:00:12,256 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:00:12,256 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345085069] [2019-12-19 02:00:12,256 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:00:12,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:00:12,372 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-19 02:00:12,372 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345085069] [2019-12-19 02:00:12,372 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:00:12,372 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 02:00:12,373 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056270816] [2019-12-19 02:00:12,373 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 02:00:12,373 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:00:12,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 02:00:12,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-19 02:00:12,374 INFO L87 Difference]: Start difference. First operand 53410 states and 187041 transitions. Second operand 6 states. [2019-12-19 02:00:13,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:00:13,124 INFO L93 Difference]: Finished difference Result 68650 states and 237305 transitions. [2019-12-19 02:00:13,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-19 02:00:13,124 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 57 [2019-12-19 02:00:13,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:00:13,280 INFO L225 Difference]: With dead ends: 68650 [2019-12-19 02:00:13,280 INFO L226 Difference]: Without dead ends: 68082 [2019-12-19 02:00:13,281 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2019-12-19 02:00:13,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68082 states. [2019-12-19 02:00:14,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68082 to 53494. [2019-12-19 02:00:14,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53494 states. [2019-12-19 02:00:14,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53494 states to 53494 states and 187738 transitions. [2019-12-19 02:00:14,781 INFO L78 Accepts]: Start accepts. Automaton has 53494 states and 187738 transitions. Word has length 57 [2019-12-19 02:00:14,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:00:14,782 INFO L462 AbstractCegarLoop]: Abstraction has 53494 states and 187738 transitions. [2019-12-19 02:00:14,782 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 02:00:14,782 INFO L276 IsEmpty]: Start isEmpty. Operand 53494 states and 187738 transitions. [2019-12-19 02:00:14,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-19 02:00:14,793 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:00:14,793 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-19 02:00:14,793 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:00:14,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:00:14,794 INFO L82 PathProgramCache]: Analyzing trace with hash -1699947683, now seen corresponding path program 1 times [2019-12-19 02:00:14,794 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:00:14,794 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243446135] [2019-12-19 02:00:14,794 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:00:14,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:00:14,914 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-19 02:00:14,915 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243446135] [2019-12-19 02:00:14,915 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:00:14,915 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 02:00:14,917 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933477288] [2019-12-19 02:00:14,918 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 02:00:14,918 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:00:14,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 02:00:14,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-19 02:00:14,919 INFO L87 Difference]: Start difference. First operand 53494 states and 187738 transitions. Second operand 6 states. [2019-12-19 02:00:15,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:00:15,790 INFO L93 Difference]: Finished difference Result 67853 states and 231364 transitions. [2019-12-19 02:00:15,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 02:00:15,790 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 58 [2019-12-19 02:00:15,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:00:16,514 INFO L225 Difference]: With dead ends: 67853 [2019-12-19 02:00:16,514 INFO L226 Difference]: Without dead ends: 67853 [2019-12-19 02:00:16,514 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-19 02:00:16,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67853 states. [2019-12-19 02:00:17,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67853 to 59085. [2019-12-19 02:00:17,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59085 states. [2019-12-19 02:00:17,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59085 states to 59085 states and 204134 transitions. [2019-12-19 02:00:17,629 INFO L78 Accepts]: Start accepts. Automaton has 59085 states and 204134 transitions. Word has length 58 [2019-12-19 02:00:17,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:00:17,629 INFO L462 AbstractCegarLoop]: Abstraction has 59085 states and 204134 transitions. [2019-12-19 02:00:17,629 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 02:00:17,629 INFO L276 IsEmpty]: Start isEmpty. Operand 59085 states and 204134 transitions. [2019-12-19 02:00:17,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-19 02:00:17,640 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:00:17,640 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-19 02:00:17,641 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:00:17,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:00:17,641 INFO L82 PathProgramCache]: Analyzing trace with hash -812444002, now seen corresponding path program 1 times [2019-12-19 02:00:17,641 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:00:17,641 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825478234] [2019-12-19 02:00:17,641 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:00:17,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:00:17,699 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-19 02:00:17,699 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825478234] [2019-12-19 02:00:17,699 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:00:17,700 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 02:00:17,700 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256300272] [2019-12-19 02:00:17,700 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 02:00:17,700 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:00:17,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 02:00:17,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 02:00:17,701 INFO L87 Difference]: Start difference. First operand 59085 states and 204134 transitions. Second operand 4 states. [2019-12-19 02:00:17,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:00:17,761 INFO L93 Difference]: Finished difference Result 10216 states and 31250 transitions. [2019-12-19 02:00:17,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-19 02:00:17,762 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2019-12-19 02:00:17,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:00:17,780 INFO L225 Difference]: With dead ends: 10216 [2019-12-19 02:00:17,780 INFO L226 Difference]: Without dead ends: 8511 [2019-12-19 02:00:17,781 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-19 02:00:17,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8511 states. [2019-12-19 02:00:18,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8511 to 8463. [2019-12-19 02:00:18,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8463 states. [2019-12-19 02:00:18,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8463 states to 8463 states and 25329 transitions. [2019-12-19 02:00:18,243 INFO L78 Accepts]: Start accepts. Automaton has 8463 states and 25329 transitions. Word has length 58 [2019-12-19 02:00:18,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:00:18,244 INFO L462 AbstractCegarLoop]: Abstraction has 8463 states and 25329 transitions. [2019-12-19 02:00:18,244 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 02:00:18,244 INFO L276 IsEmpty]: Start isEmpty. Operand 8463 states and 25329 transitions. [2019-12-19 02:00:18,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-19 02:00:18,248 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:00:18,248 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-19 02:00:18,248 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:00:18,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:00:18,249 INFO L82 PathProgramCache]: Analyzing trace with hash -1292079072, now seen corresponding path program 1 times [2019-12-19 02:00:18,249 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:00:18,249 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566249895] [2019-12-19 02:00:18,249 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:00:18,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:00:18,299 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-19 02:00:18,300 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566249895] [2019-12-19 02:00:18,300 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:00:18,300 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 02:00:18,300 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967957669] [2019-12-19 02:00:18,301 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 02:00:18,301 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:00:18,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 02:00:18,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 02:00:18,301 INFO L87 Difference]: Start difference. First operand 8463 states and 25329 transitions. Second operand 4 states. [2019-12-19 02:00:18,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:00:18,431 INFO L93 Difference]: Finished difference Result 9710 states and 29108 transitions. [2019-12-19 02:00:18,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-19 02:00:18,431 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-19 02:00:18,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:00:18,445 INFO L225 Difference]: With dead ends: 9710 [2019-12-19 02:00:18,445 INFO L226 Difference]: Without dead ends: 9710 [2019-12-19 02:00:18,445 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-19 02:00:18,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9710 states. [2019-12-19 02:00:18,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9710 to 8883. [2019-12-19 02:00:18,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8883 states. [2019-12-19 02:00:18,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8883 states to 8883 states and 26592 transitions. [2019-12-19 02:00:18,561 INFO L78 Accepts]: Start accepts. Automaton has 8883 states and 26592 transitions. Word has length 65 [2019-12-19 02:00:18,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:00:18,561 INFO L462 AbstractCegarLoop]: Abstraction has 8883 states and 26592 transitions. [2019-12-19 02:00:18,561 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 02:00:18,561 INFO L276 IsEmpty]: Start isEmpty. Operand 8883 states and 26592 transitions. [2019-12-19 02:00:18,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-19 02:00:18,564 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:00:18,565 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-19 02:00:18,565 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:00:18,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:00:18,565 INFO L82 PathProgramCache]: Analyzing trace with hash 450731263, now seen corresponding path program 1 times [2019-12-19 02:00:18,565 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:00:18,566 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626565292] [2019-12-19 02:00:18,566 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:00:18,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:00:18,627 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-19 02:00:18,628 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626565292] [2019-12-19 02:00:18,628 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:00:18,628 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 02:00:18,629 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088047724] [2019-12-19 02:00:18,629 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 02:00:18,629 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:00:18,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 02:00:18,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-19 02:00:18,630 INFO L87 Difference]: Start difference. First operand 8883 states and 26592 transitions. Second operand 6 states. [2019-12-19 02:00:19,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:00:19,023 INFO L93 Difference]: Finished difference Result 11199 states and 33079 transitions. [2019-12-19 02:00:19,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-19 02:00:19,024 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-12-19 02:00:19,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:00:19,040 INFO L225 Difference]: With dead ends: 11199 [2019-12-19 02:00:19,040 INFO L226 Difference]: Without dead ends: 11138 [2019-12-19 02:00:19,041 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-19 02:00:19,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11138 states. [2019-12-19 02:00:19,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11138 to 10414. [2019-12-19 02:00:19,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10414 states. [2019-12-19 02:00:19,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10414 states to 10414 states and 30946 transitions. [2019-12-19 02:00:19,176 INFO L78 Accepts]: Start accepts. Automaton has 10414 states and 30946 transitions. Word has length 65 [2019-12-19 02:00:19,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:00:19,176 INFO L462 AbstractCegarLoop]: Abstraction has 10414 states and 30946 transitions. [2019-12-19 02:00:19,176 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 02:00:19,176 INFO L276 IsEmpty]: Start isEmpty. Operand 10414 states and 30946 transitions. [2019-12-19 02:00:19,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-19 02:00:19,181 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:00:19,181 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-19 02:00:19,182 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:00:19,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:00:19,182 INFO L82 PathProgramCache]: Analyzing trace with hash -1715256149, now seen corresponding path program 1 times [2019-12-19 02:00:19,182 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:00:19,182 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657686349] [2019-12-19 02:00:19,182 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:00:19,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:00:19,239 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-19 02:00:19,240 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657686349] [2019-12-19 02:00:19,240 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:00:19,240 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 02:00:19,240 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729850565] [2019-12-19 02:00:19,241 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 02:00:19,241 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:00:19,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 02:00:19,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 02:00:19,241 INFO L87 Difference]: Start difference. First operand 10414 states and 30946 transitions. Second operand 4 states. [2019-12-19 02:00:19,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:00:19,504 INFO L93 Difference]: Finished difference Result 13387 states and 39337 transitions. [2019-12-19 02:00:19,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-19 02:00:19,504 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 71 [2019-12-19 02:00:19,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:00:19,529 INFO L225 Difference]: With dead ends: 13387 [2019-12-19 02:00:19,529 INFO L226 Difference]: Without dead ends: 13387 [2019-12-19 02:00:19,529 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-19 02:00:19,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13387 states. [2019-12-19 02:00:19,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13387 to 11728. [2019-12-19 02:00:19,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11728 states. [2019-12-19 02:00:19,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11728 states to 11728 states and 34581 transitions. [2019-12-19 02:00:19,774 INFO L78 Accepts]: Start accepts. Automaton has 11728 states and 34581 transitions. Word has length 71 [2019-12-19 02:00:19,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:00:19,775 INFO L462 AbstractCegarLoop]: Abstraction has 11728 states and 34581 transitions. [2019-12-19 02:00:19,775 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 02:00:19,775 INFO L276 IsEmpty]: Start isEmpty. Operand 11728 states and 34581 transitions. [2019-12-19 02:00:19,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-19 02:00:19,785 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:00:19,785 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-19 02:00:19,785 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:00:19,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:00:19,786 INFO L82 PathProgramCache]: Analyzing trace with hash -470491668, now seen corresponding path program 1 times [2019-12-19 02:00:19,786 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:00:19,792 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047942443] [2019-12-19 02:00:19,793 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:00:19,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:00:19,939 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-19 02:00:19,940 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047942443] [2019-12-19 02:00:19,940 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:00:19,941 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 02:00:19,941 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806426900] [2019-12-19 02:00:19,941 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 02:00:19,941 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:00:19,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 02:00:19,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-19 02:00:19,942 INFO L87 Difference]: Start difference. First operand 11728 states and 34581 transitions. Second operand 6 states. [2019-12-19 02:00:20,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:00:20,518 INFO L93 Difference]: Finished difference Result 12877 states and 37338 transitions. [2019-12-19 02:00:20,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 02:00:20,519 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 71 [2019-12-19 02:00:20,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:00:20,537 INFO L225 Difference]: With dead ends: 12877 [2019-12-19 02:00:20,538 INFO L226 Difference]: Without dead ends: 12877 [2019-12-19 02:00:20,538 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-19 02:00:20,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12877 states. [2019-12-19 02:00:20,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12877 to 12577. [2019-12-19 02:00:20,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12577 states. [2019-12-19 02:00:20,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12577 states to 12577 states and 36580 transitions. [2019-12-19 02:00:20,700 INFO L78 Accepts]: Start accepts. Automaton has 12577 states and 36580 transitions. Word has length 71 [2019-12-19 02:00:20,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:00:20,701 INFO L462 AbstractCegarLoop]: Abstraction has 12577 states and 36580 transitions. [2019-12-19 02:00:20,701 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 02:00:20,701 INFO L276 IsEmpty]: Start isEmpty. Operand 12577 states and 36580 transitions. [2019-12-19 02:00:20,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-19 02:00:20,708 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:00:20,708 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-19 02:00:20,708 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:00:20,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:00:20,709 INFO L82 PathProgramCache]: Analyzing trace with hash 1747266285, now seen corresponding path program 1 times [2019-12-19 02:00:20,709 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:00:20,709 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662436675] [2019-12-19 02:00:20,709 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:00:20,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:00:20,783 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-19 02:00:20,783 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662436675] [2019-12-19 02:00:20,783 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:00:20,783 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 02:00:20,784 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82684108] [2019-12-19 02:00:20,784 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 02:00:20,784 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:00:20,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 02:00:20,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-19 02:00:20,785 INFO L87 Difference]: Start difference. First operand 12577 states and 36580 transitions. Second operand 6 states. [2019-12-19 02:00:21,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:00:21,327 INFO L93 Difference]: Finished difference Result 14466 states and 40828 transitions. [2019-12-19 02:00:21,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-19 02:00:21,327 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 71 [2019-12-19 02:00:21,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:00:21,347 INFO L225 Difference]: With dead ends: 14466 [2019-12-19 02:00:21,347 INFO L226 Difference]: Without dead ends: 14466 [2019-12-19 02:00:21,347 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-19 02:00:21,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14466 states. [2019-12-19 02:00:21,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14466 to 13140. [2019-12-19 02:00:21,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13140 states. [2019-12-19 02:00:21,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13140 states to 13140 states and 37549 transitions. [2019-12-19 02:00:21,512 INFO L78 Accepts]: Start accepts. Automaton has 13140 states and 37549 transitions. Word has length 71 [2019-12-19 02:00:21,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:00:21,512 INFO L462 AbstractCegarLoop]: Abstraction has 13140 states and 37549 transitions. [2019-12-19 02:00:21,513 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 02:00:21,513 INFO L276 IsEmpty]: Start isEmpty. Operand 13140 states and 37549 transitions. [2019-12-19 02:00:21,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-19 02:00:21,521 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:00:21,521 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-19 02:00:21,521 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:00:21,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:00:21,521 INFO L82 PathProgramCache]: Analyzing trace with hash 1958617198, now seen corresponding path program 1 times [2019-12-19 02:00:21,521 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:00:21,522 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396005176] [2019-12-19 02:00:21,522 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:00:21,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:00:21,600 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-19 02:00:21,600 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396005176] [2019-12-19 02:00:21,602 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:00:21,602 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 02:00:21,602 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5814735] [2019-12-19 02:00:21,603 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 02:00:21,603 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:00:21,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 02:00:21,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 02:00:21,604 INFO L87 Difference]: Start difference. First operand 13140 states and 37549 transitions. Second operand 5 states. [2019-12-19 02:00:21,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:00:21,981 INFO L93 Difference]: Finished difference Result 16966 states and 48261 transitions. [2019-12-19 02:00:21,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-19 02:00:21,982 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 71 [2019-12-19 02:00:21,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:00:22,018 INFO L225 Difference]: With dead ends: 16966 [2019-12-19 02:00:22,018 INFO L226 Difference]: Without dead ends: 16966 [2019-12-19 02:00:22,019 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-19 02:00:22,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16966 states. [2019-12-19 02:00:22,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16966 to 15670. [2019-12-19 02:00:22,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15670 states. [2019-12-19 02:00:22,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15670 states to 15670 states and 44446 transitions. [2019-12-19 02:00:22,341 INFO L78 Accepts]: Start accepts. Automaton has 15670 states and 44446 transitions. Word has length 71 [2019-12-19 02:00:22,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:00:22,342 INFO L462 AbstractCegarLoop]: Abstraction has 15670 states and 44446 transitions. [2019-12-19 02:00:22,342 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 02:00:22,342 INFO L276 IsEmpty]: Start isEmpty. Operand 15670 states and 44446 transitions. [2019-12-19 02:00:22,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-19 02:00:22,353 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:00:22,353 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-19 02:00:22,353 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:00:22,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:00:22,353 INFO L82 PathProgramCache]: Analyzing trace with hash 1448083021, now seen corresponding path program 1 times [2019-12-19 02:00:22,354 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:00:22,354 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572926204] [2019-12-19 02:00:22,354 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:00:22,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:00:22,440 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-19 02:00:22,441 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572926204] [2019-12-19 02:00:22,441 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:00:22,441 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 02:00:22,441 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019003923] [2019-12-19 02:00:22,442 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 02:00:22,442 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:00:22,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 02:00:22,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-19 02:00:22,443 INFO L87 Difference]: Start difference. First operand 15670 states and 44446 transitions. Second operand 6 states. [2019-12-19 02:00:22,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:00:22,596 INFO L93 Difference]: Finished difference Result 16084 states and 44227 transitions. [2019-12-19 02:00:22,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-19 02:00:22,596 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 71 [2019-12-19 02:00:22,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:00:22,617 INFO L225 Difference]: With dead ends: 16084 [2019-12-19 02:00:22,617 INFO L226 Difference]: Without dead ends: 16084 [2019-12-19 02:00:22,618 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-19 02:00:22,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16084 states. [2019-12-19 02:00:22,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16084 to 14714. [2019-12-19 02:00:22,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14714 states. [2019-12-19 02:00:22,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14714 states to 14714 states and 40522 transitions. [2019-12-19 02:00:22,798 INFO L78 Accepts]: Start accepts. Automaton has 14714 states and 40522 transitions. Word has length 71 [2019-12-19 02:00:22,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:00:22,798 INFO L462 AbstractCegarLoop]: Abstraction has 14714 states and 40522 transitions. [2019-12-19 02:00:22,798 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 02:00:22,798 INFO L276 IsEmpty]: Start isEmpty. Operand 14714 states and 40522 transitions. [2019-12-19 02:00:22,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-19 02:00:22,805 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:00:22,805 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-19 02:00:22,806 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:00:22,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:00:22,806 INFO L82 PathProgramCache]: Analyzing trace with hash 538635343, now seen corresponding path program 1 times [2019-12-19 02:00:22,806 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:00:22,806 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362516107] [2019-12-19 02:00:22,807 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:00:22,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:00:22,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 02:00:22,885 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362516107] [2019-12-19 02:00:22,885 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:00:22,885 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 02:00:22,885 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037131624] [2019-12-19 02:00:22,886 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 02:00:22,886 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:00:22,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 02:00:22,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-19 02:00:22,886 INFO L87 Difference]: Start difference. First operand 14714 states and 40522 transitions. Second operand 5 states. [2019-12-19 02:00:22,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:00:22,938 INFO L93 Difference]: Finished difference Result 5315 states and 12566 transitions. [2019-12-19 02:00:22,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-19 02:00:22,939 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 71 [2019-12-19 02:00:22,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:00:22,944 INFO L225 Difference]: With dead ends: 5315 [2019-12-19 02:00:22,945 INFO L226 Difference]: Without dead ends: 4643 [2019-12-19 02:00:22,945 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-19 02:00:22,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4643 states. [2019-12-19 02:00:22,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4643 to 4541. [2019-12-19 02:00:22,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4541 states. [2019-12-19 02:00:22,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4541 states to 4541 states and 10384 transitions. [2019-12-19 02:00:22,987 INFO L78 Accepts]: Start accepts. Automaton has 4541 states and 10384 transitions. Word has length 71 [2019-12-19 02:00:22,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:00:22,987 INFO L462 AbstractCegarLoop]: Abstraction has 4541 states and 10384 transitions. [2019-12-19 02:00:22,987 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 02:00:22,988 INFO L276 IsEmpty]: Start isEmpty. Operand 4541 states and 10384 transitions. [2019-12-19 02:00:22,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-19 02:00:22,991 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:00:22,991 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 02:00:22,992 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:00:22,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:00:22,992 INFO L82 PathProgramCache]: Analyzing trace with hash -1679970640, now seen corresponding path program 1 times [2019-12-19 02:00:22,992 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:00:22,992 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967083214] [2019-12-19 02:00:22,992 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:00:23,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:00:23,018 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-19 02:00:23,019 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967083214] [2019-12-19 02:00:23,019 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:00:23,019 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-19 02:00:23,019 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775343547] [2019-12-19 02:00:23,020 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-19 02:00:23,020 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:00:23,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-19 02:00:23,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-19 02:00:23,020 INFO L87 Difference]: Start difference. First operand 4541 states and 10384 transitions. Second operand 3 states. [2019-12-19 02:00:23,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:00:23,053 INFO L93 Difference]: Finished difference Result 5482 states and 12309 transitions. [2019-12-19 02:00:23,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-19 02:00:23,054 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 71 [2019-12-19 02:00:23,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:00:23,061 INFO L225 Difference]: With dead ends: 5482 [2019-12-19 02:00:23,061 INFO L226 Difference]: Without dead ends: 5482 [2019-12-19 02:00:23,061 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-19 02:00:23,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5482 states. [2019-12-19 02:00:23,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5482 to 4476. [2019-12-19 02:00:23,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4476 states. [2019-12-19 02:00:23,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4476 states to 4476 states and 9946 transitions. [2019-12-19 02:00:23,129 INFO L78 Accepts]: Start accepts. Automaton has 4476 states and 9946 transitions. Word has length 71 [2019-12-19 02:00:23,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:00:23,130 INFO L462 AbstractCegarLoop]: Abstraction has 4476 states and 9946 transitions. [2019-12-19 02:00:23,130 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-19 02:00:23,130 INFO L276 IsEmpty]: Start isEmpty. Operand 4476 states and 9946 transitions. [2019-12-19 02:00:23,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-12-19 02:00:23,136 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:00:23,136 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-19 02:00:23,136 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:00:23,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:00:23,137 INFO L82 PathProgramCache]: Analyzing trace with hash -1543631293, now seen corresponding path program 1 times [2019-12-19 02:00:23,137 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:00:23,137 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489108491] [2019-12-19 02:00:23,137 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:00:23,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:00:23,193 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-19 02:00:23,194 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489108491] [2019-12-19 02:00:23,194 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:00:23,194 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 02:00:23,194 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122924379] [2019-12-19 02:00:23,195 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 02:00:23,195 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:00:23,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 02:00:23,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 02:00:23,196 INFO L87 Difference]: Start difference. First operand 4476 states and 9946 transitions. Second operand 5 states. [2019-12-19 02:00:23,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:00:23,378 INFO L93 Difference]: Finished difference Result 5533 states and 12363 transitions. [2019-12-19 02:00:23,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-19 02:00:23,378 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 77 [2019-12-19 02:00:23,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:00:23,385 INFO L225 Difference]: With dead ends: 5533 [2019-12-19 02:00:23,385 INFO L226 Difference]: Without dead ends: 5533 [2019-12-19 02:00:23,386 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-19 02:00:23,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5533 states. [2019-12-19 02:00:23,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5533 to 4896. [2019-12-19 02:00:23,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4896 states. [2019-12-19 02:00:23,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4896 states to 4896 states and 10904 transitions. [2019-12-19 02:00:23,435 INFO L78 Accepts]: Start accepts. Automaton has 4896 states and 10904 transitions. Word has length 77 [2019-12-19 02:00:23,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:00:23,435 INFO L462 AbstractCegarLoop]: Abstraction has 4896 states and 10904 transitions. [2019-12-19 02:00:23,435 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 02:00:23,435 INFO L276 IsEmpty]: Start isEmpty. Operand 4896 states and 10904 transitions. [2019-12-19 02:00:23,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-12-19 02:00:23,440 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:00:23,440 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-19 02:00:23,440 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:00:23,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:00:23,440 INFO L82 PathProgramCache]: Analyzing trace with hash 199179042, now seen corresponding path program 1 times [2019-12-19 02:00:23,440 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:00:23,440 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296560658] [2019-12-19 02:00:23,440 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:00:23,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:00:23,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 02:00:23,506 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296560658] [2019-12-19 02:00:23,507 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:00:23,507 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 02:00:23,507 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332047211] [2019-12-19 02:00:23,507 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 02:00:23,508 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:00:23,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 02:00:23,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-19 02:00:23,508 INFO L87 Difference]: Start difference. First operand 4896 states and 10904 transitions. Second operand 7 states. [2019-12-19 02:00:23,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:00:23,985 INFO L93 Difference]: Finished difference Result 5669 states and 12508 transitions. [2019-12-19 02:00:23,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-19 02:00:23,986 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 77 [2019-12-19 02:00:23,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:00:23,993 INFO L225 Difference]: With dead ends: 5669 [2019-12-19 02:00:23,993 INFO L226 Difference]: Without dead ends: 5616 [2019-12-19 02:00:23,994 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-19 02:00:24,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5616 states. [2019-12-19 02:00:24,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5616 to 4983. [2019-12-19 02:00:24,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4983 states. [2019-12-19 02:00:24,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4983 states to 4983 states and 10993 transitions. [2019-12-19 02:00:24,044 INFO L78 Accepts]: Start accepts. Automaton has 4983 states and 10993 transitions. Word has length 77 [2019-12-19 02:00:24,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:00:24,044 INFO L462 AbstractCegarLoop]: Abstraction has 4983 states and 10993 transitions. [2019-12-19 02:00:24,044 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 02:00:24,044 INFO L276 IsEmpty]: Start isEmpty. Operand 4983 states and 10993 transitions. [2019-12-19 02:00:24,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-19 02:00:24,049 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:00:24,049 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-19 02:00:24,050 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:00:24,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:00:24,050 INFO L82 PathProgramCache]: Analyzing trace with hash -283880815, now seen corresponding path program 1 times [2019-12-19 02:00:24,050 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:00:24,051 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318212064] [2019-12-19 02:00:24,051 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:00:24,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:00:24,108 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-19 02:00:24,108 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318212064] [2019-12-19 02:00:24,108 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:00:24,109 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 02:00:24,109 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145270036] [2019-12-19 02:00:24,109 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 02:00:24,109 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:00:24,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 02:00:24,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 02:00:24,110 INFO L87 Difference]: Start difference. First operand 4983 states and 10993 transitions. Second operand 5 states. [2019-12-19 02:00:24,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:00:24,413 INFO L93 Difference]: Finished difference Result 5858 states and 12866 transitions. [2019-12-19 02:00:24,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 02:00:24,413 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 98 [2019-12-19 02:00:24,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:00:24,421 INFO L225 Difference]: With dead ends: 5858 [2019-12-19 02:00:24,421 INFO L226 Difference]: Without dead ends: 5858 [2019-12-19 02:00:24,421 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-19 02:00:24,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5858 states. [2019-12-19 02:00:24,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5858 to 5105. [2019-12-19 02:00:24,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5105 states. [2019-12-19 02:00:24,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5105 states to 5105 states and 11259 transitions. [2019-12-19 02:00:24,474 INFO L78 Accepts]: Start accepts. Automaton has 5105 states and 11259 transitions. Word has length 98 [2019-12-19 02:00:24,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:00:24,476 INFO L462 AbstractCegarLoop]: Abstraction has 5105 states and 11259 transitions. [2019-12-19 02:00:24,476 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 02:00:24,476 INFO L276 IsEmpty]: Start isEmpty. Operand 5105 states and 11259 transitions. [2019-12-19 02:00:24,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-19 02:00:24,481 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:00:24,481 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-19 02:00:24,482 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:00:24,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:00:24,482 INFO L82 PathProgramCache]: Analyzing trace with hash 1087998493, now seen corresponding path program 2 times [2019-12-19 02:00:24,482 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:00:24,482 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737321519] [2019-12-19 02:00:24,482 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:00:24,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:00:24,616 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-19 02:00:24,620 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737321519] [2019-12-19 02:00:24,621 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:00:24,621 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 02:00:24,622 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041371218] [2019-12-19 02:00:24,622 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 02:00:24,624 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:00:24,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 02:00:24,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-19 02:00:24,625 INFO L87 Difference]: Start difference. First operand 5105 states and 11259 transitions. Second operand 7 states. [2019-12-19 02:00:25,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:00:25,597 INFO L93 Difference]: Finished difference Result 9237 states and 19996 transitions. [2019-12-19 02:00:25,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-19 02:00:25,598 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 98 [2019-12-19 02:00:25,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:00:25,609 INFO L225 Difference]: With dead ends: 9237 [2019-12-19 02:00:25,609 INFO L226 Difference]: Without dead ends: 9183 [2019-12-19 02:00:25,609 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-19 02:00:25,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9183 states. [2019-12-19 02:00:25,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9183 to 7575. [2019-12-19 02:00:25,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7575 states. [2019-12-19 02:00:25,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7575 states to 7575 states and 16492 transitions. [2019-12-19 02:00:25,694 INFO L78 Accepts]: Start accepts. Automaton has 7575 states and 16492 transitions. Word has length 98 [2019-12-19 02:00:25,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:00:25,695 INFO L462 AbstractCegarLoop]: Abstraction has 7575 states and 16492 transitions. [2019-12-19 02:00:25,695 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 02:00:25,695 INFO L276 IsEmpty]: Start isEmpty. Operand 7575 states and 16492 transitions. [2019-12-19 02:00:25,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-19 02:00:25,703 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:00:25,704 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-19 02:00:25,704 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:00:25,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:00:25,704 INFO L82 PathProgramCache]: Analyzing trace with hash 1119018300, now seen corresponding path program 1 times [2019-12-19 02:00:25,704 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:00:25,704 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535165623] [2019-12-19 02:00:25,705 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:00:25,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:00:25,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 02:00:25,786 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535165623] [2019-12-19 02:00:25,787 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:00:25,787 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 02:00:25,787 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8509183] [2019-12-19 02:00:25,787 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 02:00:25,787 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:00:25,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 02:00:25,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-19 02:00:25,788 INFO L87 Difference]: Start difference. First operand 7575 states and 16492 transitions. Second operand 7 states. [2019-12-19 02:00:26,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:00:26,751 INFO L93 Difference]: Finished difference Result 10520 states and 22647 transitions. [2019-12-19 02:00:26,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-19 02:00:26,752 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 98 [2019-12-19 02:00:26,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:00:26,766 INFO L225 Difference]: With dead ends: 10520 [2019-12-19 02:00:26,767 INFO L226 Difference]: Without dead ends: 10520 [2019-12-19 02:00:26,767 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-19 02:00:26,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10520 states. [2019-12-19 02:00:26,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10520 to 8308. [2019-12-19 02:00:26,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8308 states. [2019-12-19 02:00:26,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8308 states to 8308 states and 18105 transitions. [2019-12-19 02:00:26,866 INFO L78 Accepts]: Start accepts. Automaton has 8308 states and 18105 transitions. Word has length 98 [2019-12-19 02:00:26,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:00:26,866 INFO L462 AbstractCegarLoop]: Abstraction has 8308 states and 18105 transitions. [2019-12-19 02:00:26,866 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 02:00:26,866 INFO L276 IsEmpty]: Start isEmpty. Operand 8308 states and 18105 transitions. [2019-12-19 02:00:26,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-19 02:00:26,875 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:00:26,875 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-19 02:00:26,876 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:00:26,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:00:26,876 INFO L82 PathProgramCache]: Analyzing trace with hash -919037989, now seen corresponding path program 1 times [2019-12-19 02:00:26,876 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:00:26,876 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528759259] [2019-12-19 02:00:26,877 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:00:26,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:00:26,933 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-19 02:00:26,933 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528759259] [2019-12-19 02:00:26,934 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:00:26,934 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 02:00:26,934 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630892119] [2019-12-19 02:00:26,934 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 02:00:26,935 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:00:26,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 02:00:26,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 02:00:26,935 INFO L87 Difference]: Start difference. First operand 8308 states and 18105 transitions. Second operand 4 states. [2019-12-19 02:00:27,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:00:27,031 INFO L93 Difference]: Finished difference Result 8762 states and 18993 transitions. [2019-12-19 02:00:27,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-19 02:00:27,031 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-12-19 02:00:27,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:00:27,041 INFO L225 Difference]: With dead ends: 8762 [2019-12-19 02:00:27,041 INFO L226 Difference]: Without dead ends: 8680 [2019-12-19 02:00:27,041 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-19 02:00:27,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8680 states. [2019-12-19 02:00:27,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8680 to 7394. [2019-12-19 02:00:27,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7394 states. [2019-12-19 02:00:27,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7394 states to 7394 states and 16140 transitions. [2019-12-19 02:00:27,123 INFO L78 Accepts]: Start accepts. Automaton has 7394 states and 16140 transitions. Word has length 98 [2019-12-19 02:00:27,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:00:27,123 INFO L462 AbstractCegarLoop]: Abstraction has 7394 states and 16140 transitions. [2019-12-19 02:00:27,125 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 02:00:27,125 INFO L276 IsEmpty]: Start isEmpty. Operand 7394 states and 16140 transitions. [2019-12-19 02:00:27,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-12-19 02:00:27,134 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:00:27,135 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-19 02:00:27,135 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:00:27,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:00:27,135 INFO L82 PathProgramCache]: Analyzing trace with hash 663708553, now seen corresponding path program 1 times [2019-12-19 02:00:27,135 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:00:27,136 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044403000] [2019-12-19 02:00:27,136 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:00:27,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:00:27,259 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-19 02:00:27,259 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044403000] [2019-12-19 02:00:27,259 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:00:27,259 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 02:00:27,260 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702996305] [2019-12-19 02:00:27,260 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 02:00:27,260 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:00:27,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 02:00:27,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-19 02:00:27,261 INFO L87 Difference]: Start difference. First operand 7394 states and 16140 transitions. Second operand 6 states. [2019-12-19 02:00:27,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:00:27,575 INFO L93 Difference]: Finished difference Result 8034 states and 17448 transitions. [2019-12-19 02:00:27,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-19 02:00:27,575 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 100 [2019-12-19 02:00:27,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:00:27,590 INFO L225 Difference]: With dead ends: 8034 [2019-12-19 02:00:27,590 INFO L226 Difference]: Without dead ends: 8034 [2019-12-19 02:00:27,591 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-19 02:00:27,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8034 states. [2019-12-19 02:00:27,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8034 to 7266. [2019-12-19 02:00:27,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7266 states. [2019-12-19 02:00:27,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7266 states to 7266 states and 15909 transitions. [2019-12-19 02:00:27,735 INFO L78 Accepts]: Start accepts. Automaton has 7266 states and 15909 transitions. Word has length 100 [2019-12-19 02:00:27,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:00:27,735 INFO L462 AbstractCegarLoop]: Abstraction has 7266 states and 15909 transitions. [2019-12-19 02:00:27,736 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 02:00:27,736 INFO L276 IsEmpty]: Start isEmpty. Operand 7266 states and 15909 transitions. [2019-12-19 02:00:27,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-12-19 02:00:27,746 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:00:27,747 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-19 02:00:27,747 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:00:27,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:00:27,748 INFO L82 PathProgramCache]: Analyzing trace with hash -582643184, now seen corresponding path program 1 times [2019-12-19 02:00:27,748 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:00:27,748 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011068405] [2019-12-19 02:00:27,748 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:00:27,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:00:27,858 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-19 02:00:27,859 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011068405] [2019-12-19 02:00:27,859 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:00:27,860 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 02:00:27,860 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778595967] [2019-12-19 02:00:27,860 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 02:00:27,861 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:00:27,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 02:00:27,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 02:00:27,861 INFO L87 Difference]: Start difference. First operand 7266 states and 15909 transitions. Second operand 5 states. [2019-12-19 02:00:28,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:00:28,009 INFO L93 Difference]: Finished difference Result 7889 states and 17236 transitions. [2019-12-19 02:00:28,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-19 02:00:28,009 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 100 [2019-12-19 02:00:28,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:00:28,021 INFO L225 Difference]: With dead ends: 7889 [2019-12-19 02:00:28,021 INFO L226 Difference]: Without dead ends: 7889 [2019-12-19 02:00:28,021 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-19 02:00:28,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7889 states. [2019-12-19 02:00:28,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7889 to 6234. [2019-12-19 02:00:28,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6234 states. [2019-12-19 02:00:28,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6234 states to 6234 states and 13642 transitions. [2019-12-19 02:00:28,197 INFO L78 Accepts]: Start accepts. Automaton has 6234 states and 13642 transitions. Word has length 100 [2019-12-19 02:00:28,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:00:28,197 INFO L462 AbstractCegarLoop]: Abstraction has 6234 states and 13642 transitions. [2019-12-19 02:00:28,197 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 02:00:28,198 INFO L276 IsEmpty]: Start isEmpty. Operand 6234 states and 13642 transitions. [2019-12-19 02:00:28,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-12-19 02:00:28,206 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:00:28,206 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-19 02:00:28,207 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:00:28,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:00:28,208 INFO L82 PathProgramCache]: Analyzing trace with hash -231843247, now seen corresponding path program 1 times [2019-12-19 02:00:28,208 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:00:28,208 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021800231] [2019-12-19 02:00:28,208 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:00:28,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:00:28,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 02:00:28,270 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021800231] [2019-12-19 02:00:28,270 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:00:28,270 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 02:00:28,270 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094941946] [2019-12-19 02:00:28,271 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 02:00:28,271 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:00:28,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 02:00:28,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 02:00:28,271 INFO L87 Difference]: Start difference. First operand 6234 states and 13642 transitions. Second operand 4 states. [2019-12-19 02:00:28,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:00:28,540 INFO L93 Difference]: Finished difference Result 7306 states and 15945 transitions. [2019-12-19 02:00:28,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-19 02:00:28,540 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2019-12-19 02:00:28,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:00:28,550 INFO L225 Difference]: With dead ends: 7306 [2019-12-19 02:00:28,550 INFO L226 Difference]: Without dead ends: 7268 [2019-12-19 02:00:28,550 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-19 02:00:28,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7268 states. [2019-12-19 02:00:28,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7268 to 6191. [2019-12-19 02:00:28,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6191 states. [2019-12-19 02:00:28,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6191 states to 6191 states and 13665 transitions. [2019-12-19 02:00:28,647 INFO L78 Accepts]: Start accepts. Automaton has 6191 states and 13665 transitions. Word has length 100 [2019-12-19 02:00:28,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:00:28,648 INFO L462 AbstractCegarLoop]: Abstraction has 6191 states and 13665 transitions. [2019-12-19 02:00:28,648 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 02:00:28,648 INFO L276 IsEmpty]: Start isEmpty. Operand 6191 states and 13665 transitions. [2019-12-19 02:00:28,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-12-19 02:00:28,656 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:00:28,657 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-19 02:00:28,657 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:00:28,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:00:28,657 INFO L82 PathProgramCache]: Analyzing trace with hash -200823440, now seen corresponding path program 1 times [2019-12-19 02:00:28,657 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:00:28,658 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705275723] [2019-12-19 02:00:28,658 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:00:28,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:00:28,799 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-19 02:00:28,799 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705275723] [2019-12-19 02:00:28,799 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:00:28,799 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 02:00:28,800 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544529766] [2019-12-19 02:00:28,800 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 02:00:28,800 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:00:28,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 02:00:28,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-19 02:00:28,801 INFO L87 Difference]: Start difference. First operand 6191 states and 13665 transitions. Second operand 7 states. [2019-12-19 02:00:28,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:00:28,976 INFO L93 Difference]: Finished difference Result 6972 states and 15270 transitions. [2019-12-19 02:00:28,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-19 02:00:28,976 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 100 [2019-12-19 02:00:28,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:00:28,986 INFO L225 Difference]: With dead ends: 6972 [2019-12-19 02:00:28,986 INFO L226 Difference]: Without dead ends: 6972 [2019-12-19 02:00:28,987 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-12-19 02:00:28,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6972 states. [2019-12-19 02:00:29,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6972 to 5810. [2019-12-19 02:00:29,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5810 states. [2019-12-19 02:00:29,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5810 states to 5810 states and 12734 transitions. [2019-12-19 02:00:29,085 INFO L78 Accepts]: Start accepts. Automaton has 5810 states and 12734 transitions. Word has length 100 [2019-12-19 02:00:29,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:00:29,085 INFO L462 AbstractCegarLoop]: Abstraction has 5810 states and 12734 transitions. [2019-12-19 02:00:29,085 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 02:00:29,085 INFO L276 IsEmpty]: Start isEmpty. Operand 5810 states and 12734 transitions. [2019-12-19 02:00:29,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-12-19 02:00:29,094 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:00:29,094 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-19 02:00:29,094 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:00:29,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:00:29,095 INFO L82 PathProgramCache]: Analyzing trace with hash 2056087567, now seen corresponding path program 1 times [2019-12-19 02:00:29,095 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:00:29,096 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30251698] [2019-12-19 02:00:29,096 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:00:29,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:00:29,283 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-19 02:00:29,284 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30251698] [2019-12-19 02:00:29,284 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:00:29,284 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-19 02:00:29,284 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622192545] [2019-12-19 02:00:29,285 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-19 02:00:29,285 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:00:29,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-19 02:00:29,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-19 02:00:29,285 INFO L87 Difference]: Start difference. First operand 5810 states and 12734 transitions. Second operand 8 states. [2019-12-19 02:00:29,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:00:29,391 INFO L93 Difference]: Finished difference Result 9717 states and 21466 transitions. [2019-12-19 02:00:29,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 02:00:29,392 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 100 [2019-12-19 02:00:29,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:00:29,397 INFO L225 Difference]: With dead ends: 9717 [2019-12-19 02:00:29,397 INFO L226 Difference]: Without dead ends: 4100 [2019-12-19 02:00:29,398 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-19 02:00:29,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4100 states. [2019-12-19 02:00:29,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4100 to 4100. [2019-12-19 02:00:29,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4100 states. [2019-12-19 02:00:29,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4100 states to 4100 states and 9096 transitions. [2019-12-19 02:00:29,451 INFO L78 Accepts]: Start accepts. Automaton has 4100 states and 9096 transitions. Word has length 100 [2019-12-19 02:00:29,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:00:29,451 INFO L462 AbstractCegarLoop]: Abstraction has 4100 states and 9096 transitions. [2019-12-19 02:00:29,451 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-19 02:00:29,451 INFO L276 IsEmpty]: Start isEmpty. Operand 4100 states and 9096 transitions. [2019-12-19 02:00:29,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-12-19 02:00:29,456 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:00:29,456 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-19 02:00:29,457 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:00:29,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:00:29,457 INFO L82 PathProgramCache]: Analyzing trace with hash -752397989, now seen corresponding path program 2 times [2019-12-19 02:00:29,457 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:00:29,457 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819003540] [2019-12-19 02:00:29,458 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:00:29,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:00:29,625 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-19 02:00:29,625 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819003540] [2019-12-19 02:00:29,625 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:00:29,626 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-19 02:00:29,626 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200136373] [2019-12-19 02:00:29,626 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-19 02:00:29,626 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:00:29,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-19 02:00:29,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-12-19 02:00:29,627 INFO L87 Difference]: Start difference. First operand 4100 states and 9096 transitions. Second operand 10 states. [2019-12-19 02:00:30,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:00:30,135 INFO L93 Difference]: Finished difference Result 8981 states and 20031 transitions. [2019-12-19 02:00:30,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-19 02:00:30,135 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 100 [2019-12-19 02:00:30,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:00:30,143 INFO L225 Difference]: With dead ends: 8981 [2019-12-19 02:00:30,144 INFO L226 Difference]: Without dead ends: 5787 [2019-12-19 02:00:30,144 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-19 02:00:30,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5787 states. [2019-12-19 02:00:30,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5787 to 4125. [2019-12-19 02:00:30,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4125 states. [2019-12-19 02:00:30,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4125 states to 4125 states and 9102 transitions. [2019-12-19 02:00:30,217 INFO L78 Accepts]: Start accepts. Automaton has 4125 states and 9102 transitions. Word has length 100 [2019-12-19 02:00:30,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:00:30,217 INFO L462 AbstractCegarLoop]: Abstraction has 4125 states and 9102 transitions. [2019-12-19 02:00:30,217 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-19 02:00:30,217 INFO L276 IsEmpty]: Start isEmpty. Operand 4125 states and 9102 transitions. [2019-12-19 02:00:30,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-12-19 02:00:30,222 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:00:30,223 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-19 02:00:30,223 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:00:30,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:00:30,223 INFO L82 PathProgramCache]: Analyzing trace with hash -998334121, now seen corresponding path program 1 times [2019-12-19 02:00:30,223 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:00:30,224 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204450357] [2019-12-19 02:00:30,224 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:00:30,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:00:30,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-19 02:00:30,345 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204450357] [2019-12-19 02:00:30,345 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:00:30,345 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 02:00:30,345 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884737937] [2019-12-19 02:00:30,346 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 02:00:30,346 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:00:30,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 02:00:30,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-19 02:00:30,347 INFO L87 Difference]: Start difference. First operand 4125 states and 9102 transitions. Second operand 6 states. [2019-12-19 02:00:30,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:00:30,514 INFO L93 Difference]: Finished difference Result 4585 states and 10046 transitions. [2019-12-19 02:00:30,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-19 02:00:30,514 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 100 [2019-12-19 02:00:30,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:00:30,520 INFO L225 Difference]: With dead ends: 4585 [2019-12-19 02:00:30,520 INFO L226 Difference]: Without dead ends: 4555 [2019-12-19 02:00:30,521 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-19 02:00:30,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4555 states. [2019-12-19 02:00:30,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4555 to 4058. [2019-12-19 02:00:30,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4058 states. [2019-12-19 02:00:30,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4058 states to 4058 states and 8905 transitions. [2019-12-19 02:00:30,562 INFO L78 Accepts]: Start accepts. Automaton has 4058 states and 8905 transitions. Word has length 100 [2019-12-19 02:00:30,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:00:30,562 INFO L462 AbstractCegarLoop]: Abstraction has 4058 states and 8905 transitions. [2019-12-19 02:00:30,562 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 02:00:30,563 INFO L276 IsEmpty]: Start isEmpty. Operand 4058 states and 8905 transitions. [2019-12-19 02:00:30,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-12-19 02:00:30,566 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:00:30,566 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-19 02:00:30,566 INFO L410 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:00:30,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:00:30,566 INFO L82 PathProgramCache]: Analyzing trace with hash 473181100, now seen corresponding path program 1 times [2019-12-19 02:00:30,567 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:00:30,567 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014062397] [2019-12-19 02:00:30,567 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:00:30,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:00:30,629 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-19 02:00:30,629 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014062397] [2019-12-19 02:00:30,630 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:00:30,630 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 02:00:30,630 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587358418] [2019-12-19 02:00:30,630 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 02:00:30,630 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:00:30,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 02:00:30,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 02:00:30,631 INFO L87 Difference]: Start difference. First operand 4058 states and 8905 transitions. Second operand 5 states. [2019-12-19 02:00:30,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:00:30,863 INFO L93 Difference]: Finished difference Result 4854 states and 10529 transitions. [2019-12-19 02:00:30,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 02:00:30,864 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 100 [2019-12-19 02:00:30,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:00:30,871 INFO L225 Difference]: With dead ends: 4854 [2019-12-19 02:00:30,871 INFO L226 Difference]: Without dead ends: 4782 [2019-12-19 02:00:30,871 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-19 02:00:30,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4782 states. [2019-12-19 02:00:30,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4782 to 4173. [2019-12-19 02:00:30,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4173 states. [2019-12-19 02:00:30,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4173 states to 4173 states and 9144 transitions. [2019-12-19 02:00:30,915 INFO L78 Accepts]: Start accepts. Automaton has 4173 states and 9144 transitions. Word has length 100 [2019-12-19 02:00:30,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:00:30,916 INFO L462 AbstractCegarLoop]: Abstraction has 4173 states and 9144 transitions. [2019-12-19 02:00:30,916 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 02:00:30,916 INFO L276 IsEmpty]: Start isEmpty. Operand 4173 states and 9144 transitions. [2019-12-19 02:00:30,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-12-19 02:00:30,920 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:00:30,920 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-19 02:00:30,921 INFO L410 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:00:30,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:00:30,921 INFO L82 PathProgramCache]: Analyzing trace with hash 243680910, now seen corresponding path program 1 times [2019-12-19 02:00:30,921 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:00:30,921 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618341212] [2019-12-19 02:00:30,921 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:00:30,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:00:31,002 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-19 02:00:31,002 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618341212] [2019-12-19 02:00:31,002 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:00:31,002 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 02:00:31,003 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669637486] [2019-12-19 02:00:31,003 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 02:00:31,003 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:00:31,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 02:00:31,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-19 02:00:31,004 INFO L87 Difference]: Start difference. First operand 4173 states and 9144 transitions. Second operand 6 states. [2019-12-19 02:00:31,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:00:31,226 INFO L93 Difference]: Finished difference Result 4365 states and 9533 transitions. [2019-12-19 02:00:31,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 02:00:31,226 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 100 [2019-12-19 02:00:31,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:00:31,234 INFO L225 Difference]: With dead ends: 4365 [2019-12-19 02:00:31,235 INFO L226 Difference]: Without dead ends: 4365 [2019-12-19 02:00:31,241 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-19 02:00:31,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4365 states. [2019-12-19 02:00:31,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4365 to 4106. [2019-12-19 02:00:31,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4106 states. [2019-12-19 02:00:31,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4106 states to 4106 states and 8999 transitions. [2019-12-19 02:00:31,320 INFO L78 Accepts]: Start accepts. Automaton has 4106 states and 8999 transitions. Word has length 100 [2019-12-19 02:00:31,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:00:31,321 INFO L462 AbstractCegarLoop]: Abstraction has 4106 states and 8999 transitions. [2019-12-19 02:00:31,321 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 02:00:31,321 INFO L276 IsEmpty]: Start isEmpty. Operand 4106 states and 8999 transitions. [2019-12-19 02:00:31,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-12-19 02:00:31,328 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:00:31,328 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-19 02:00:31,328 INFO L410 AbstractCegarLoop]: === Iteration 35 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:00:31,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:00:31,329 INFO L82 PathProgramCache]: Analyzing trace with hash -1921017704, now seen corresponding path program 1 times [2019-12-19 02:00:31,329 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:00:31,330 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915359359] [2019-12-19 02:00:31,330 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:00:31,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:00:31,485 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-19 02:00:31,485 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915359359] [2019-12-19 02:00:31,486 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:00:31,486 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 02:00:31,486 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854082558] [2019-12-19 02:00:31,486 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 02:00:31,486 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:00:31,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 02:00:31,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-19 02:00:31,488 INFO L87 Difference]: Start difference. First operand 4106 states and 8999 transitions. Second operand 7 states. [2019-12-19 02:00:31,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:00:31,866 INFO L93 Difference]: Finished difference Result 4359 states and 9507 transitions. [2019-12-19 02:00:31,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-19 02:00:31,866 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 100 [2019-12-19 02:00:31,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:00:31,874 INFO L225 Difference]: With dead ends: 4359 [2019-12-19 02:00:31,874 INFO L226 Difference]: Without dead ends: 4359 [2019-12-19 02:00:31,874 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-19 02:00:31,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4359 states. [2019-12-19 02:00:31,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4359 to 4098. [2019-12-19 02:00:31,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4098 states. [2019-12-19 02:00:31,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4098 states to 4098 states and 8963 transitions. [2019-12-19 02:00:31,955 INFO L78 Accepts]: Start accepts. Automaton has 4098 states and 8963 transitions. Word has length 100 [2019-12-19 02:00:31,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:00:31,956 INFO L462 AbstractCegarLoop]: Abstraction has 4098 states and 8963 transitions. [2019-12-19 02:00:31,956 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 02:00:31,956 INFO L276 IsEmpty]: Start isEmpty. Operand 4098 states and 8963 transitions. [2019-12-19 02:00:31,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-12-19 02:00:31,963 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:00:31,964 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-19 02:00:31,964 INFO L410 AbstractCegarLoop]: === Iteration 36 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:00:31,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:00:31,964 INFO L82 PathProgramCache]: Analyzing trace with hash 1451347705, now seen corresponding path program 3 times [2019-12-19 02:00:31,965 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:00:31,965 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654564036] [2019-12-19 02:00:31,965 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:00:32,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-19 02:00:32,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-19 02:00:32,156 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-19 02:00:32,156 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-19 02:00:32,522 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.12 02:00:32 BasicIcfg [2019-12-19 02:00:32,522 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-19 02:00:32,528 INFO L168 Benchmark]: Toolchain (without parser) took 54266.57 ms. Allocated memory was 143.1 MB in the beginning and 2.4 GB in the end (delta: 2.2 GB). Free memory was 98.9 MB in the beginning and 670.2 MB in the end (delta: -571.3 MB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. [2019-12-19 02:00:32,528 INFO L168 Benchmark]: CDTParser took 0.44 ms. Allocated memory is still 143.1 MB. Free memory is still 117.8 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-12-19 02:00:32,529 INFO L168 Benchmark]: CACSL2BoogieTranslator took 836.86 ms. Allocated memory was 143.1 MB in the beginning and 200.3 MB in the end (delta: 57.1 MB). Free memory was 98.5 MB in the beginning and 154.8 MB in the end (delta: -56.3 MB). Peak memory consumption was 20.9 MB. Max. memory is 7.1 GB. [2019-12-19 02:00:32,529 INFO L168 Benchmark]: Boogie Procedure Inliner took 64.52 ms. Allocated memory is still 200.3 MB. Free memory was 154.8 MB in the beginning and 151.8 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 7.1 GB. [2019-12-19 02:00:32,530 INFO L168 Benchmark]: Boogie Preprocessor took 37.11 ms. Allocated memory is still 200.3 MB. Free memory was 151.8 MB in the beginning and 149.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-19 02:00:32,530 INFO L168 Benchmark]: RCFGBuilder took 824.65 ms. Allocated memory is still 200.3 MB. Free memory was 149.7 MB in the beginning and 103.7 MB in the end (delta: 46.0 MB). Peak memory consumption was 46.0 MB. Max. memory is 7.1 GB. [2019-12-19 02:00:32,531 INFO L168 Benchmark]: TraceAbstraction took 52497.81 ms. Allocated memory was 200.3 MB in the beginning and 2.4 GB in the end (delta: 2.2 GB). Free memory was 103.7 MB in the beginning and 670.2 MB in the end (delta: -566.5 MB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2019-12-19 02:00:32,533 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.44 ms. Allocated memory is still 143.1 MB. Free memory is still 117.8 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 836.86 ms. Allocated memory was 143.1 MB in the beginning and 200.3 MB in the end (delta: 57.1 MB). Free memory was 98.5 MB in the beginning and 154.8 MB in the end (delta: -56.3 MB). Peak memory consumption was 20.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 64.52 ms. Allocated memory is still 200.3 MB. Free memory was 154.8 MB in the beginning and 151.8 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 37.11 ms. Allocated memory is still 200.3 MB. Free memory was 151.8 MB in the beginning and 149.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 824.65 ms. Allocated memory is still 200.3 MB. Free memory was 149.7 MB in the beginning and 103.7 MB in the end (delta: 46.0 MB). Peak memory consumption was 46.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 52497.81 ms. Allocated memory was 200.3 MB in the beginning and 2.4 GB in the end (delta: 2.2 GB). Free memory was 103.7 MB in the beginning and 670.2 MB in the end (delta: -566.5 MB). Peak memory consumption was 1.6 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.9s, OverallIterations: 36, TraceHistogramMax: 1, AutomataDifference: 17.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 9561 SDtfs, 10567 SDslu, 21178 SDs, 0 SdLazy, 7836 SolverSat, 501 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 358 GetRequests, 100 SyntacticMatches, 23 SemanticMatches, 235 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 285 ImplicationChecksByTransitivity, 2.4s 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: 27.7s AutomataMinimizationTime, 35 MinimizatonAttempts, 85476 StatesRemovedByMinimization, 33 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.6s 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...