/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe010_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 14:36:42,883 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 14:36:42,886 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 14:36:42,903 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 14:36:42,904 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 14:36:42,906 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 14:36:42,908 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 14:36:42,921 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 14:36:42,923 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 14:36:42,924 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 14:36:42,926 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 14:36:42,927 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 14:36:42,927 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 14:36:42,930 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 14:36:42,932 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 14:36:42,934 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 14:36:42,936 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 14:36:42,938 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 14:36:42,940 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 14:36:42,944 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 14:36:42,945 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 14:36:42,949 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 14:36:42,950 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 14:36:42,953 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 14:36:42,955 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 14:36:42,955 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 14:36:42,955 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 14:36:42,956 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 14:36:42,956 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 14:36:42,957 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 14:36:42,957 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 14:36:42,958 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 14:36:42,959 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 14:36:42,959 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 14:36:42,960 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 14:36:42,961 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 14:36:42,961 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 14:36:42,961 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 14:36:42,962 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 14:36:42,963 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 14:36:42,963 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 14:36:42,964 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-18 14:36:42,985 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 14:36:42,985 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 14:36:42,987 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 14:36:42,987 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 14:36:42,988 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 14:36:42,988 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 14:36:42,988 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 14:36:42,988 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 14:36:42,988 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 14:36:42,989 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 14:36:42,990 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 14:36:42,990 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 14:36:42,990 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 14:36:42,991 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 14:36:42,991 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 14:36:42,991 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 14:36:42,991 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 14:36:42,992 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 14:36:42,992 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 14:36:42,992 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 14:36:42,993 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 14:36:42,993 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 14:36:42,993 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 14:36:42,993 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 14:36:42,993 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 14:36:42,994 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 14:36:42,994 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 14:36:42,994 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 14:36:42,994 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-18 14:36:42,994 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 14:36:43,329 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 14:36:43,344 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 14:36:43,349 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 14:36:43,350 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 14:36:43,350 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 14:36:43,351 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe010_rmo.opt.i [2019-12-18 14:36:43,426 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ecfd345e7/5482c82b436e4c18873408b5a5a55063/FLAG3a5aa6248 [2019-12-18 14:36:43,981 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 14:36:43,981 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe010_rmo.opt.i [2019-12-18 14:36:43,996 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ecfd345e7/5482c82b436e4c18873408b5a5a55063/FLAG3a5aa6248 [2019-12-18 14:36:44,247 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ecfd345e7/5482c82b436e4c18873408b5a5a55063 [2019-12-18 14:36:44,255 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 14:36:44,257 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 14:36:44,258 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 14:36:44,258 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 14:36:44,262 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 14:36:44,263 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 02:36:44" (1/1) ... [2019-12-18 14:36:44,267 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3899c684 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:36:44, skipping insertion in model container [2019-12-18 14:36:44,268 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 02:36:44" (1/1) ... [2019-12-18 14:36:44,277 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 14:36:44,329 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 14:36:44,880 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 14:36:44,901 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 14:36:45,012 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 14:36:45,083 INFO L208 MainTranslator]: Completed translation [2019-12-18 14:36:45,084 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:36:45 WrapperNode [2019-12-18 14:36:45,084 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 14:36:45,085 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 14:36:45,085 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 14:36:45,085 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 14:36:45,093 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:36:45" (1/1) ... [2019-12-18 14:36:45,113 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:36:45" (1/1) ... [2019-12-18 14:36:45,150 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 14:36:45,150 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 14:36:45,150 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 14:36:45,150 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 14:36:45,158 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:36:45" (1/1) ... [2019-12-18 14:36:45,158 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:36:45" (1/1) ... [2019-12-18 14:36:45,163 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:36:45" (1/1) ... [2019-12-18 14:36:45,163 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:36:45" (1/1) ... [2019-12-18 14:36:45,172 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:36:45" (1/1) ... [2019-12-18 14:36:45,176 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:36:45" (1/1) ... [2019-12-18 14:36:45,180 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:36:45" (1/1) ... [2019-12-18 14:36:45,185 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 14:36:45,185 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 14:36:45,185 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 14:36:45,186 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 14:36:45,186 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:36:45" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 14:36:45,259 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 14:36:45,260 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 14:36:45,260 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 14:36:45,260 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 14:36:45,260 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 14:36:45,260 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 14:36:45,261 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 14:36:45,261 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 14:36:45,261 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 14:36:45,261 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 14:36:45,262 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 14:36:45,264 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 14:36:46,037 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 14:36:46,037 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 14:36:46,039 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 02:36:46 BoogieIcfgContainer [2019-12-18 14:36:46,039 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 14:36:46,041 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 14:36:46,041 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 14:36:46,044 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 14:36:46,044 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 02:36:44" (1/3) ... [2019-12-18 14:36:46,047 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68db815f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 02:36:46, skipping insertion in model container [2019-12-18 14:36:46,047 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:36:45" (2/3) ... [2019-12-18 14:36:46,047 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68db815f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 02:36:46, skipping insertion in model container [2019-12-18 14:36:46,047 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 02:36:46" (3/3) ... [2019-12-18 14:36:46,049 INFO L109 eAbstractionObserver]: Analyzing ICFG safe010_rmo.opt.i [2019-12-18 14:36:46,060 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 14:36:46,060 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 14:36:46,068 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 14:36:46,069 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 14:36:46,109 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:46,109 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:46,110 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:46,110 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:46,110 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:46,110 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:46,111 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:46,111 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:46,112 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:46,112 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:46,112 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:46,112 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:46,113 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:46,113 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:46,113 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:46,114 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:46,114 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:46,114 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:46,114 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:46,114 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:46,115 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:46,115 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:46,116 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:46,116 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:46,116 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:46,118 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:46,119 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:46,119 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:46,119 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:46,120 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:46,120 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:46,120 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:46,120 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:46,121 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:46,122 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:46,122 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:46,122 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:46,122 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:46,123 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:46,124 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:46,124 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:46,125 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:46,128 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:46,129 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:46,129 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:46,130 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:46,130 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:46,130 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:46,130 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:46,130 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:46,131 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:46,131 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:46,131 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:46,132 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:46,133 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:46,133 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:46,133 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:46,133 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:46,134 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:46,134 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:46,134 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:46,134 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:46,135 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:46,135 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:46,139 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:46,139 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:46,139 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:46,140 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:46,140 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:46,140 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:46,141 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:46,141 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:46,141 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:46,141 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:46,142 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:46,142 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:46,161 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:46,161 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:46,162 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:46,162 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:46,162 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:46,162 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:46,163 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:46,163 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:46,164 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:46,164 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:36:46,179 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-18 14:36:46,200 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 14:36:46,200 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 14:36:46,200 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 14:36:46,200 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 14:36:46,200 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 14:36:46,200 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 14:36:46,201 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 14:36:46,201 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 14:36:46,218 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 146 places, 180 transitions [2019-12-18 14:36:46,220 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 146 places, 180 transitions [2019-12-18 14:36:46,294 INFO L126 PetriNetUnfolder]: 41/178 cut-off events. [2019-12-18 14:36:46,295 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 14:36:46,313 INFO L76 FinitePrefix]: Finished finitePrefix Result has 185 conditions, 178 events. 41/178 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 248 event pairs. 6/141 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-18 14:36:46,332 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 146 places, 180 transitions [2019-12-18 14:36:46,409 INFO L126 PetriNetUnfolder]: 41/178 cut-off events. [2019-12-18 14:36:46,409 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 14:36:46,417 INFO L76 FinitePrefix]: Finished finitePrefix Result has 185 conditions, 178 events. 41/178 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 248 event pairs. 6/141 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-18 14:36:46,434 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 10418 [2019-12-18 14:36:46,435 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 14:36:51,261 WARN L192 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 79 [2019-12-18 14:36:51,390 INFO L206 etLargeBlockEncoding]: Checked pairs total: 46090 [2019-12-18 14:36:51,390 INFO L214 etLargeBlockEncoding]: Total number of compositions: 101 [2019-12-18 14:36:51,394 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 79 places, 91 transitions [2019-12-18 14:36:51,935 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8654 states. [2019-12-18 14:36:51,938 INFO L276 IsEmpty]: Start isEmpty. Operand 8654 states. [2019-12-18 14:36:51,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 14:36:51,945 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:36:51,946 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 14:36:51,946 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:36:51,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:36:51,954 INFO L82 PathProgramCache]: Analyzing trace with hash 722891, now seen corresponding path program 1 times [2019-12-18 14:36:51,964 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:36:51,965 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37406040] [2019-12-18 14:36:51,965 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:36:52,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:36:52,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:36:52,187 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37406040] [2019-12-18 14:36:52,188 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:36:52,188 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 14:36:52,190 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313218865] [2019-12-18 14:36:52,195 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:36:52,196 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:36:52,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:36:52,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:36:52,214 INFO L87 Difference]: Start difference. First operand 8654 states. Second operand 3 states. [2019-12-18 14:36:52,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:36:52,545 INFO L93 Difference]: Finished difference Result 8604 states and 28108 transitions. [2019-12-18 14:36:52,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:36:52,547 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 14:36:52,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:36:52,657 INFO L225 Difference]: With dead ends: 8604 [2019-12-18 14:36:52,657 INFO L226 Difference]: Without dead ends: 8436 [2019-12-18 14:36:52,658 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:36:52,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8436 states. [2019-12-18 14:36:53,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8436 to 8436. [2019-12-18 14:36:53,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8436 states. [2019-12-18 14:36:53,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8436 states to 8436 states and 27590 transitions. [2019-12-18 14:36:53,102 INFO L78 Accepts]: Start accepts. Automaton has 8436 states and 27590 transitions. Word has length 3 [2019-12-18 14:36:53,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:36:53,102 INFO L462 AbstractCegarLoop]: Abstraction has 8436 states and 27590 transitions. [2019-12-18 14:36:53,102 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:36:53,103 INFO L276 IsEmpty]: Start isEmpty. Operand 8436 states and 27590 transitions. [2019-12-18 14:36:53,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 14:36:53,107 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:36:53,108 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:36:53,108 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:36:53,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:36:53,109 INFO L82 PathProgramCache]: Analyzing trace with hash -1596153002, now seen corresponding path program 1 times [2019-12-18 14:36:53,109 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:36:53,109 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174330377] [2019-12-18 14:36:53,109 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:36:53,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:36:53,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:36:53,276 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174330377] [2019-12-18 14:36:53,276 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:36:53,276 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:36:53,276 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478606791] [2019-12-18 14:36:53,279 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 14:36:53,279 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:36:53,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 14:36:53,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 14:36:53,280 INFO L87 Difference]: Start difference. First operand 8436 states and 27590 transitions. Second operand 4 states. [2019-12-18 14:36:53,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:36:53,691 INFO L93 Difference]: Finished difference Result 13130 states and 41153 transitions. [2019-12-18 14:36:53,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 14:36:53,691 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 14:36:53,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:36:53,875 INFO L225 Difference]: With dead ends: 13130 [2019-12-18 14:36:53,876 INFO L226 Difference]: Without dead ends: 13123 [2019-12-18 14:36:53,880 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:36:53,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13123 states. [2019-12-18 14:36:54,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13123 to 11988. [2019-12-18 14:36:54,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11988 states. [2019-12-18 14:36:54,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11988 states to 11988 states and 38075 transitions. [2019-12-18 14:36:54,300 INFO L78 Accepts]: Start accepts. Automaton has 11988 states and 38075 transitions. Word has length 11 [2019-12-18 14:36:54,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:36:54,300 INFO L462 AbstractCegarLoop]: Abstraction has 11988 states and 38075 transitions. [2019-12-18 14:36:54,300 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 14:36:54,301 INFO L276 IsEmpty]: Start isEmpty. Operand 11988 states and 38075 transitions. [2019-12-18 14:36:54,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 14:36:54,309 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:36:54,309 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:36:54,310 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:36:54,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:36:54,310 INFO L82 PathProgramCache]: Analyzing trace with hash 1194917716, now seen corresponding path program 1 times [2019-12-18 14:36:54,310 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:36:54,311 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058710726] [2019-12-18 14:36:54,311 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:36:54,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:36:54,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:36:54,429 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058710726] [2019-12-18 14:36:54,429 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:36:54,429 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:36:54,429 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984322553] [2019-12-18 14:36:54,430 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 14:36:54,430 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:36:54,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 14:36:54,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 14:36:54,431 INFO L87 Difference]: Start difference. First operand 11988 states and 38075 transitions. Second operand 4 states. [2019-12-18 14:36:54,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:36:54,668 INFO L93 Difference]: Finished difference Result 14736 states and 46267 transitions. [2019-12-18 14:36:54,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 14:36:54,669 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 14:36:54,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:36:54,718 INFO L225 Difference]: With dead ends: 14736 [2019-12-18 14:36:54,718 INFO L226 Difference]: Without dead ends: 14736 [2019-12-18 14:36:54,718 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:36:55,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14736 states. [2019-12-18 14:36:55,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14736 to 13160. [2019-12-18 14:36:55,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13160 states. [2019-12-18 14:36:55,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13160 states to 13160 states and 41689 transitions. [2019-12-18 14:36:55,783 INFO L78 Accepts]: Start accepts. Automaton has 13160 states and 41689 transitions. Word has length 11 [2019-12-18 14:36:55,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:36:55,784 INFO L462 AbstractCegarLoop]: Abstraction has 13160 states and 41689 transitions. [2019-12-18 14:36:55,784 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 14:36:55,784 INFO L276 IsEmpty]: Start isEmpty. Operand 13160 states and 41689 transitions. [2019-12-18 14:36:55,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-18 14:36:55,787 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:36:55,788 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:36:55,788 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:36:55,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:36:55,788 INFO L82 PathProgramCache]: Analyzing trace with hash -1502155024, now seen corresponding path program 1 times [2019-12-18 14:36:55,789 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:36:55,789 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075675070] [2019-12-18 14:36:55,789 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:36:55,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:36:55,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:36:55,868 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075675070] [2019-12-18 14:36:55,869 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:36:55,869 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 14:36:55,869 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452726638] [2019-12-18 14:36:55,870 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 14:36:55,870 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:36:55,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 14:36:55,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:36:55,873 INFO L87 Difference]: Start difference. First operand 13160 states and 41689 transitions. Second operand 5 states. [2019-12-18 14:36:56,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:36:56,448 INFO L93 Difference]: Finished difference Result 17572 states and 54523 transitions. [2019-12-18 14:36:56,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 14:36:56,448 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-12-18 14:36:56,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:36:56,483 INFO L225 Difference]: With dead ends: 17572 [2019-12-18 14:36:56,484 INFO L226 Difference]: Without dead ends: 17565 [2019-12-18 14:36:56,484 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 14:36:56,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17565 states. [2019-12-18 14:36:56,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17565 to 13105. [2019-12-18 14:36:56,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13105 states. [2019-12-18 14:36:56,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13105 states to 13105 states and 41426 transitions. [2019-12-18 14:36:56,907 INFO L78 Accepts]: Start accepts. Automaton has 13105 states and 41426 transitions. Word has length 17 [2019-12-18 14:36:56,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:36:56,907 INFO L462 AbstractCegarLoop]: Abstraction has 13105 states and 41426 transitions. [2019-12-18 14:36:56,907 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 14:36:56,907 INFO L276 IsEmpty]: Start isEmpty. Operand 13105 states and 41426 transitions. [2019-12-18 14:36:56,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 14:36:56,922 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:36:56,922 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:36:56,922 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:36:56,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:36:56,922 INFO L82 PathProgramCache]: Analyzing trace with hash 933350131, now seen corresponding path program 1 times [2019-12-18 14:36:56,923 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:36:56,923 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951897690] [2019-12-18 14:36:56,923 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:36:56,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:36:57,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:36:57,003 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951897690] [2019-12-18 14:36:57,004 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:36:57,004 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 14:36:57,004 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027464109] [2019-12-18 14:36:57,005 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:36:57,005 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:36:57,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:36:57,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:36:57,006 INFO L87 Difference]: Start difference. First operand 13105 states and 41426 transitions. Second operand 3 states. [2019-12-18 14:36:57,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:36:57,121 INFO L93 Difference]: Finished difference Result 16057 states and 50095 transitions. [2019-12-18 14:36:57,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:36:57,122 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-12-18 14:36:57,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:36:57,159 INFO L225 Difference]: With dead ends: 16057 [2019-12-18 14:36:57,160 INFO L226 Difference]: Without dead ends: 16057 [2019-12-18 14:36:57,160 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:36:57,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16057 states. [2019-12-18 14:36:57,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16057 to 14186. [2019-12-18 14:36:57,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14186 states. [2019-12-18 14:36:57,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14186 states to 14186 states and 44710 transitions. [2019-12-18 14:36:57,755 INFO L78 Accepts]: Start accepts. Automaton has 14186 states and 44710 transitions. Word has length 25 [2019-12-18 14:36:57,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:36:57,756 INFO L462 AbstractCegarLoop]: Abstraction has 14186 states and 44710 transitions. [2019-12-18 14:36:57,756 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:36:57,756 INFO L276 IsEmpty]: Start isEmpty. Operand 14186 states and 44710 transitions. [2019-12-18 14:36:57,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 14:36:57,773 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:36:57,773 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:36:57,773 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:36:57,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:36:57,774 INFO L82 PathProgramCache]: Analyzing trace with hash 933194542, now seen corresponding path program 1 times [2019-12-18 14:36:57,774 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:36:57,774 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072802585] [2019-12-18 14:36:57,775 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:36:57,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:36:57,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:36:57,849 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072802585] [2019-12-18 14:36:57,849 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:36:57,849 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 14:36:57,849 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912125642] [2019-12-18 14:36:57,850 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 14:36:57,850 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:36:57,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 14:36:57,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 14:36:57,851 INFO L87 Difference]: Start difference. First operand 14186 states and 44710 transitions. Second operand 4 states. [2019-12-18 14:36:57,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:36:57,884 INFO L93 Difference]: Finished difference Result 2296 states and 5226 transitions. [2019-12-18 14:36:57,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 14:36:57,885 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-18 14:36:57,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:36:57,890 INFO L225 Difference]: With dead ends: 2296 [2019-12-18 14:36:57,890 INFO L226 Difference]: Without dead ends: 2019 [2019-12-18 14:36:57,891 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:36:57,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2019 states. [2019-12-18 14:36:57,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2019 to 2019. [2019-12-18 14:36:57,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2019 states. [2019-12-18 14:36:57,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2019 states to 2019 states and 4460 transitions. [2019-12-18 14:36:57,923 INFO L78 Accepts]: Start accepts. Automaton has 2019 states and 4460 transitions. Word has length 25 [2019-12-18 14:36:57,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:36:57,923 INFO L462 AbstractCegarLoop]: Abstraction has 2019 states and 4460 transitions. [2019-12-18 14:36:57,923 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 14:36:57,923 INFO L276 IsEmpty]: Start isEmpty. Operand 2019 states and 4460 transitions. [2019-12-18 14:36:57,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-18 14:36:57,927 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:36:57,927 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] [2019-12-18 14:36:57,927 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:36:57,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:36:57,927 INFO L82 PathProgramCache]: Analyzing trace with hash -568804126, now seen corresponding path program 1 times [2019-12-18 14:36:57,928 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:36:57,928 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318676551] [2019-12-18 14:36:57,928 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:36:57,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:36:58,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:36:58,022 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318676551] [2019-12-18 14:36:58,022 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:36:58,023 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 14:36:58,023 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097861218] [2019-12-18 14:36:58,023 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 14:36:58,023 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:36:58,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 14:36:58,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:36:58,024 INFO L87 Difference]: Start difference. First operand 2019 states and 4460 transitions. Second operand 5 states. [2019-12-18 14:36:58,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:36:58,070 INFO L93 Difference]: Finished difference Result 416 states and 758 transitions. [2019-12-18 14:36:58,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 14:36:58,071 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2019-12-18 14:36:58,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:36:58,072 INFO L225 Difference]: With dead ends: 416 [2019-12-18 14:36:58,072 INFO L226 Difference]: Without dead ends: 371 [2019-12-18 14:36:58,072 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 14:36:58,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2019-12-18 14:36:58,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 343. [2019-12-18 14:36:58,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2019-12-18 14:36:58,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 618 transitions. [2019-12-18 14:36:58,078 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 618 transitions. Word has length 37 [2019-12-18 14:36:58,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:36:58,078 INFO L462 AbstractCegarLoop]: Abstraction has 343 states and 618 transitions. [2019-12-18 14:36:58,078 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 14:36:58,078 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 618 transitions. [2019-12-18 14:36:58,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-18 14:36:58,080 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:36:58,080 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:36:58,080 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:36:58,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:36:58,081 INFO L82 PathProgramCache]: Analyzing trace with hash -506418728, now seen corresponding path program 1 times [2019-12-18 14:36:58,081 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:36:58,081 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509652633] [2019-12-18 14:36:58,081 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:36:58,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:36:58,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:36:58,152 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509652633] [2019-12-18 14:36:58,152 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:36:58,152 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:36:58,153 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840331164] [2019-12-18 14:36:58,153 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:36:58,153 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:36:58,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:36:58,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:36:58,154 INFO L87 Difference]: Start difference. First operand 343 states and 618 transitions. Second operand 3 states. [2019-12-18 14:36:58,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:36:58,168 INFO L93 Difference]: Finished difference Result 331 states and 582 transitions. [2019-12-18 14:36:58,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:36:58,168 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-18 14:36:58,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:36:58,169 INFO L225 Difference]: With dead ends: 331 [2019-12-18 14:36:58,169 INFO L226 Difference]: Without dead ends: 331 [2019-12-18 14:36:58,170 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:36:58,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2019-12-18 14:36:58,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 331. [2019-12-18 14:36:58,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 331 states. [2019-12-18 14:36:58,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 582 transitions. [2019-12-18 14:36:58,174 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 582 transitions. Word has length 52 [2019-12-18 14:36:58,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:36:58,175 INFO L462 AbstractCegarLoop]: Abstraction has 331 states and 582 transitions. [2019-12-18 14:36:58,175 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:36:58,175 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 582 transitions. [2019-12-18 14:36:58,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-18 14:36:58,176 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:36:58,176 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:36:58,176 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:36:58,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:36:58,177 INFO L82 PathProgramCache]: Analyzing trace with hash -156128935, now seen corresponding path program 1 times [2019-12-18 14:36:58,177 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:36:58,177 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125979192] [2019-12-18 14:36:58,177 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:36:58,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:36:58,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:36:58,256 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125979192] [2019-12-18 14:36:58,257 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:36:58,257 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 14:36:58,257 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063090755] [2019-12-18 14:36:58,257 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 14:36:58,258 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:36:58,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 14:36:58,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:36:58,258 INFO L87 Difference]: Start difference. First operand 331 states and 582 transitions. Second operand 5 states. [2019-12-18 14:36:58,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:36:58,441 INFO L93 Difference]: Finished difference Result 487 states and 864 transitions. [2019-12-18 14:36:58,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 14:36:58,441 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2019-12-18 14:36:58,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:36:58,442 INFO L225 Difference]: With dead ends: 487 [2019-12-18 14:36:58,443 INFO L226 Difference]: Without dead ends: 487 [2019-12-18 14:36:58,443 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 14:36:58,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487 states. [2019-12-18 14:36:58,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487 to 422. [2019-12-18 14:36:58,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 422 states. [2019-12-18 14:36:58,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 748 transitions. [2019-12-18 14:36:58,449 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 748 transitions. Word has length 53 [2019-12-18 14:36:58,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:36:58,450 INFO L462 AbstractCegarLoop]: Abstraction has 422 states and 748 transitions. [2019-12-18 14:36:58,450 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 14:36:58,450 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 748 transitions. [2019-12-18 14:36:58,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-18 14:36:58,455 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:36:58,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] [2019-12-18 14:36:58,456 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:36:58,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:36:58,456 INFO L82 PathProgramCache]: Analyzing trace with hash -2022513439, now seen corresponding path program 2 times [2019-12-18 14:36:58,457 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:36:58,457 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231491471] [2019-12-18 14:36:58,457 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:36:58,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:36:58,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:36:58,615 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231491471] [2019-12-18 14:36:58,615 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:36:58,615 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 14:36:58,615 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040940266] [2019-12-18 14:36:58,616 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 14:36:58,616 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:36:58,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 14:36:58,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 14:36:58,617 INFO L87 Difference]: Start difference. First operand 422 states and 748 transitions. Second operand 6 states. [2019-12-18 14:36:58,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:36:58,789 INFO L93 Difference]: Finished difference Result 511 states and 903 transitions. [2019-12-18 14:36:58,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 14:36:58,789 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2019-12-18 14:36:58,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:36:58,791 INFO L225 Difference]: With dead ends: 511 [2019-12-18 14:36:58,791 INFO L226 Difference]: Without dead ends: 511 [2019-12-18 14:36:58,791 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-12-18 14:36:58,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2019-12-18 14:36:58,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 429. [2019-12-18 14:36:58,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 429 states. [2019-12-18 14:36:58,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 761 transitions. [2019-12-18 14:36:58,797 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 761 transitions. Word has length 53 [2019-12-18 14:36:58,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:36:58,798 INFO L462 AbstractCegarLoop]: Abstraction has 429 states and 761 transitions. [2019-12-18 14:36:58,798 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 14:36:58,798 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 761 transitions. [2019-12-18 14:36:58,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-18 14:36:58,800 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:36:58,800 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:36:58,800 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:36:58,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:36:58,801 INFO L82 PathProgramCache]: Analyzing trace with hash -681731879, now seen corresponding path program 3 times [2019-12-18 14:36:58,801 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:36:58,801 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595844355] [2019-12-18 14:36:58,801 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:36:58,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:36:59,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:36:59,123 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595844355] [2019-12-18 14:36:59,123 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:36:59,123 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 14:36:59,124 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796646946] [2019-12-18 14:36:59,124 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 14:36:59,124 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:36:59,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 14:36:59,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-12-18 14:36:59,125 INFO L87 Difference]: Start difference. First operand 429 states and 761 transitions. Second operand 10 states. [2019-12-18 14:36:59,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:36:59,621 INFO L93 Difference]: Finished difference Result 612 states and 1059 transitions. [2019-12-18 14:36:59,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-18 14:36:59,621 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 53 [2019-12-18 14:36:59,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:36:59,625 INFO L225 Difference]: With dead ends: 612 [2019-12-18 14:36:59,625 INFO L226 Difference]: Without dead ends: 612 [2019-12-18 14:36:59,625 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 5 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=77, Invalid=229, Unknown=0, NotChecked=0, Total=306 [2019-12-18 14:36:59,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2019-12-18 14:36:59,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 407. [2019-12-18 14:36:59,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2019-12-18 14:36:59,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 707 transitions. [2019-12-18 14:36:59,632 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 707 transitions. Word has length 53 [2019-12-18 14:36:59,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:36:59,633 INFO L462 AbstractCegarLoop]: Abstraction has 407 states and 707 transitions. [2019-12-18 14:36:59,633 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 14:36:59,633 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 707 transitions. [2019-12-18 14:36:59,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-18 14:36:59,634 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:36:59,634 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:36:59,634 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:36:59,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:36:59,635 INFO L82 PathProgramCache]: Analyzing trace with hash 31866971, now seen corresponding path program 4 times [2019-12-18 14:36:59,635 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:36:59,635 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308663736] [2019-12-18 14:36:59,635 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:36:59,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:36:59,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:36:59,961 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308663736] [2019-12-18 14:36:59,961 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:36:59,961 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 14:36:59,962 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865989042] [2019-12-18 14:36:59,962 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 14:36:59,962 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:36:59,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 14:36:59,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-18 14:36:59,963 INFO L87 Difference]: Start difference. First operand 407 states and 707 transitions. Second operand 12 states. [2019-12-18 14:37:00,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:37:00,453 INFO L93 Difference]: Finished difference Result 733 states and 1256 transitions. [2019-12-18 14:37:00,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-18 14:37:00,454 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 53 [2019-12-18 14:37:00,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:37:00,455 INFO L225 Difference]: With dead ends: 733 [2019-12-18 14:37:00,455 INFO L226 Difference]: Without dead ends: 273 [2019-12-18 14:37:00,455 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2019-12-18 14:37:00,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2019-12-18 14:37:00,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 249. [2019-12-18 14:37:00,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2019-12-18 14:37:00,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 421 transitions. [2019-12-18 14:37:00,459 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 421 transitions. Word has length 53 [2019-12-18 14:37:00,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:37:00,460 INFO L462 AbstractCegarLoop]: Abstraction has 249 states and 421 transitions. [2019-12-18 14:37:00,460 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 14:37:00,460 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 421 transitions. [2019-12-18 14:37:00,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-18 14:37:00,461 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:37:00,461 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:37:00,461 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:37:00,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:37:00,462 INFO L82 PathProgramCache]: Analyzing trace with hash -1114856101, now seen corresponding path program 5 times [2019-12-18 14:37:00,462 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:37:00,462 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710659143] [2019-12-18 14:37:00,462 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:37:00,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:37:00,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:37:00,527 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710659143] [2019-12-18 14:37:00,527 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:37:00,527 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:37:00,527 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702501722] [2019-12-18 14:37:00,528 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:37:00,528 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:37:00,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:37:00,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:37:00,528 INFO L87 Difference]: Start difference. First operand 249 states and 421 transitions. Second operand 3 states. [2019-12-18 14:37:00,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:37:00,563 INFO L93 Difference]: Finished difference Result 249 states and 420 transitions. [2019-12-18 14:37:00,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:37:00,564 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-12-18 14:37:00,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:37:00,565 INFO L225 Difference]: With dead ends: 249 [2019-12-18 14:37:00,565 INFO L226 Difference]: Without dead ends: 249 [2019-12-18 14:37:00,565 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:37:00,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2019-12-18 14:37:00,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 206. [2019-12-18 14:37:00,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2019-12-18 14:37:00,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 347 transitions. [2019-12-18 14:37:00,569 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 347 transitions. Word has length 53 [2019-12-18 14:37:00,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:37:00,569 INFO L462 AbstractCegarLoop]: Abstraction has 206 states and 347 transitions. [2019-12-18 14:37:00,569 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:37:00,569 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 347 transitions. [2019-12-18 14:37:00,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 14:37:00,570 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:37:00,570 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:37:00,570 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:37:00,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:37:00,571 INFO L82 PathProgramCache]: Analyzing trace with hash -1034362442, now seen corresponding path program 1 times [2019-12-18 14:37:00,571 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:37:00,571 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213707096] [2019-12-18 14:37:00,572 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:37:00,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:37:00,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:37:00,791 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213707096] [2019-12-18 14:37:00,791 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:37:00,791 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-18 14:37:00,792 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545530899] [2019-12-18 14:37:00,792 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-18 14:37:00,792 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:37:00,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-18 14:37:00,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2019-12-18 14:37:00,792 INFO L87 Difference]: Start difference. First operand 206 states and 347 transitions. Second operand 14 states. [2019-12-18 14:37:01,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:37:01,382 INFO L93 Difference]: Finished difference Result 375 states and 624 transitions. [2019-12-18 14:37:01,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-18 14:37:01,382 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 54 [2019-12-18 14:37:01,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:37:01,383 INFO L225 Difference]: With dead ends: 375 [2019-12-18 14:37:01,383 INFO L226 Difference]: Without dead ends: 340 [2019-12-18 14:37:01,384 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=140, Invalid=616, Unknown=0, NotChecked=0, Total=756 [2019-12-18 14:37:01,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2019-12-18 14:37:01,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 306. [2019-12-18 14:37:01,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 306 states. [2019-12-18 14:37:01,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 518 transitions. [2019-12-18 14:37:01,387 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 518 transitions. Word has length 54 [2019-12-18 14:37:01,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:37:01,388 INFO L462 AbstractCegarLoop]: Abstraction has 306 states and 518 transitions. [2019-12-18 14:37:01,388 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-18 14:37:01,388 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 518 transitions. [2019-12-18 14:37:01,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 14:37:01,389 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:37:01,389 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:37:01,389 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:37:01,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:37:01,389 INFO L82 PathProgramCache]: Analyzing trace with hash 1326135034, now seen corresponding path program 2 times [2019-12-18 14:37:01,389 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:37:01,390 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512755179] [2019-12-18 14:37:01,390 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:37:01,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:37:01,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:37:01,642 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512755179] [2019-12-18 14:37:01,642 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:37:01,642 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-18 14:37:01,643 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749679056] [2019-12-18 14:37:01,643 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-18 14:37:01,643 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:37:01,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-18 14:37:01,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2019-12-18 14:37:01,644 INFO L87 Difference]: Start difference. First operand 306 states and 518 transitions. Second operand 14 states. [2019-12-18 14:37:01,809 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2019-12-18 14:37:02,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:37:02,288 INFO L93 Difference]: Finished difference Result 411 states and 675 transitions. [2019-12-18 14:37:02,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-18 14:37:02,288 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 54 [2019-12-18 14:37:02,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:37:02,289 INFO L225 Difference]: With dead ends: 411 [2019-12-18 14:37:02,289 INFO L226 Difference]: Without dead ends: 376 [2019-12-18 14:37:02,290 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=126, Invalid=524, Unknown=0, NotChecked=0, Total=650 [2019-12-18 14:37:02,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2019-12-18 14:37:02,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 314. [2019-12-18 14:37:02,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 314 states. [2019-12-18 14:37:02,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 532 transitions. [2019-12-18 14:37:02,296 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 532 transitions. Word has length 54 [2019-12-18 14:37:02,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:37:02,296 INFO L462 AbstractCegarLoop]: Abstraction has 314 states and 532 transitions. [2019-12-18 14:37:02,296 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-18 14:37:02,296 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 532 transitions. [2019-12-18 14:37:02,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 14:37:02,297 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:37:02,297 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:37:02,297 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:37:02,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:37:02,298 INFO L82 PathProgramCache]: Analyzing trace with hash -91775718, now seen corresponding path program 3 times [2019-12-18 14:37:02,298 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:37:02,298 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378688339] [2019-12-18 14:37:02,298 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:37:02,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 14:37:02,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 14:37:02,389 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 14:37:02,389 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 14:37:02,394 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] ULTIMATE.startENTRY-->L779: Formula: (let ((.cse0 (store |v_#valid_47| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (= v_~y$r_buff1_thd0~0_329 0) (= v_~y$w_buff0_used~0_834 0) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2019~0.base_24| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2019~0.base_24|) |v_ULTIMATE.start_main_~#t2019~0.offset_19| 0)) |v_#memory_int_11|) (= 0 v_~__unbuffered_cnt~0_61) (= 0 v_~weak$$choice0~0_14) (= v_~y$r_buff1_thd1~0_200 0) (= 0 v_~x~0_147) (= |v_#NULL.offset_3| 0) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t2019~0.base_24|) (= v_~main$tmp_guard1~0_27 0) (= v_~y$read_delayed~0_6 0) (= 0 v_~__unbuffered_p1_EAX~0_29) (= (store |v_#length_14| |v_ULTIMATE.start_main_~#t2019~0.base_24| 4) |v_#length_13|) (= 0 v_~y$r_buff1_thd2~0_208) (= 0 v_~y$r_buff0_thd2~0_162) (= v_~y$mem_tmp~0_19 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t2019~0.base_24|) 0) (= v_~weak$$choice2~0_141 0) (= v_~y$w_buff1_used~0_547 0) (= 0 |v_ULTIMATE.start_main_~#t2019~0.offset_19|) (= v_~y$r_buff0_thd1~0_297 0) (= 0 v_~y$flush_delayed~0_36) (= v_~main$tmp_guard0~0_33 0) (= 0 |v_#NULL.base_3|) (= 0 v_~y$w_buff0~0_485) (= 0 v_~y$read_delayed_var~0.offset_6) (= v_~y$r_buff0_thd0~0_416 0) (= v_~y~0_146 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t2019~0.base_24| 1) |v_#valid_45|) (< 0 |v_#StackHeapBarrier_13|) (= v_~y$w_buff1~0_308 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_~#t2019~0.offset=|v_ULTIMATE.start_main_~#t2019~0.offset_19|, ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_41|, #NULL.offset=|v_#NULL.offset_3|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_35|, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_145|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_48|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_37|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_36|, ULTIMATE.start_main_~#t2020~0.base=|v_ULTIMATE.start_main_~#t2020~0.base_19|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ~y$mem_tmp~0=v_~y$mem_tmp~0_19, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_29, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_297, ~y$flush_delayed~0=v_~y$flush_delayed~0_36, #length=|v_#length_13|, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_36|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_38|, ULTIMATE.start_main_#t~nondet24=|v_ULTIMATE.start_main_#t~nondet24_21|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_27|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_41|, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_44|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_38|, ~weak$$choice0~0=v_~weak$$choice0~0_14, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_36|, ~y$w_buff1~0=v_~y$w_buff1~0_308, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_162, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_61, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_329, ~x~0=v_~x~0_147, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_6, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_834, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_36|, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_33|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_27, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_43|, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_33|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_42|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_34|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_200, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_34|, ~y$w_buff0~0=v_~y$w_buff0~0_485, ~y~0=v_~y~0_146, ULTIMATE.start_main_~#t2019~0.base=|v_ULTIMATE.start_main_~#t2019~0.base_24|, ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_29|, ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_21|, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_33|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_53|, ULTIMATE.start_main_~#t2020~0.offset=|v_ULTIMATE.start_main_~#t2020~0.offset_16|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_27|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_33, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_35|, #NULL.base=|v_#NULL.base_3|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_40|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_208, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_37|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_18|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_416, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_14|, ~weak$$choice2~0=v_~weak$$choice2~0_141, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_547} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2019~0.offset, ULTIMATE.start_main_#t~ite28, #NULL.offset, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_~#t2020~0.base, ~y$read_delayed~0, ~y$mem_tmp~0, ~__unbuffered_p1_EAX~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~nondet24, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite33, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet15, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_#t~ite25, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ~y$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite30, ~y$w_buff0~0, ~y~0, ULTIMATE.start_main_~#t2019~0.base, ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~nondet23, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_~#t2020~0.offset, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 14:37:02,394 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [675] [675] L779-1-->L781: Formula: (and (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t2020~0.base_11|) (= |v_ULTIMATE.start_main_~#t2020~0.offset_10| 0) (= (store |v_#memory_int_8| |v_ULTIMATE.start_main_~#t2020~0.base_11| (store (select |v_#memory_int_8| |v_ULTIMATE.start_main_~#t2020~0.base_11|) |v_ULTIMATE.start_main_~#t2020~0.offset_10| 1)) |v_#memory_int_7|) (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t2020~0.base_11|)) (= (store |v_#length_10| |v_ULTIMATE.start_main_~#t2020~0.base_11| 4) |v_#length_9|) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t2020~0.base_11| 1)) (not (= |v_ULTIMATE.start_main_~#t2020~0.base_11| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_8|, #length=|v_#length_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_6|, ULTIMATE.start_main_~#t2020~0.offset=|v_ULTIMATE.start_main_~#t2020~0.offset_10|, #length=|v_#length_9|, ULTIMATE.start_main_~#t2020~0.base=|v_ULTIMATE.start_main_~#t2020~0.base_11|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_#t~nondet15, ULTIMATE.start_main_~#t2020~0.offset, #length, ULTIMATE.start_main_~#t2020~0.base] because there is no mapped edge [2019-12-18 14:37:02,395 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [638] [638] P0ENTRY-->L4-3: Formula: (and (= v_~y$w_buff1~0_121 v_~y$w_buff0~0_204) (= 2 v_~y$w_buff0~0_203) (= v_P0Thread1of1ForFork0_~arg.base_96 |v_P0Thread1of1ForFork0_#in~arg.base_96|) (= 0 (mod v_~y$w_buff1_used~0_210 256)) (= 1 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_96|) (= v_P0Thread1of1ForFork0_~arg.offset_96 |v_P0Thread1of1ForFork0_#in~arg.offset_96|) (= v_~y$w_buff0_used~0_350 v_~y$w_buff1_used~0_210) (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_100 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_96|) (= v_~y$w_buff0_used~0_349 1)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_96|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_350, ~y$w_buff0~0=v_~y$w_buff0~0_204, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_96|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_96|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_349, ~y$w_buff1~0=v_~y$w_buff1~0_121, ~y$w_buff0~0=v_~y$w_buff0~0_203, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_100, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_96|, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_96, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_96|, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_96, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_210} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$w_buff1~0, ~y$w_buff0~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression, P0Thread1of1ForFork0_~arg.offset, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 14:37:02,397 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [642] [642] L756-2-->L756-4: Formula: (let ((.cse1 (= (mod ~y$r_buff1_thd2~0_In-1574112698 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-1574112698 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite9_Out-1574112698| ~y~0_In-1574112698)) (and (= ~y$w_buff1~0_In-1574112698 |P1Thread1of1ForFork1_#t~ite9_Out-1574112698|) (not .cse1) (not .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1574112698, ~y$w_buff1~0=~y$w_buff1~0_In-1574112698, ~y~0=~y~0_In-1574112698, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1574112698} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1574112698, ~y$w_buff1~0=~y$w_buff1~0_In-1574112698, P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out-1574112698|, ~y~0=~y~0_In-1574112698, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1574112698} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9] because there is no mapped edge [2019-12-18 14:37:02,397 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [621] [621] L756-4-->L757: Formula: (= v_~y~0_41 |v_P1Thread1of1ForFork1_#t~ite9_10|) InVars {P1Thread1of1ForFork1_#t~ite9=|v_P1Thread1of1ForFork1_#t~ite9_10|} OutVars{P1Thread1of1ForFork1_#t~ite9=|v_P1Thread1of1ForFork1_#t~ite9_9|, P1Thread1of1ForFork1_#t~ite10=|v_P1Thread1of1ForFork1_#t~ite10_15|, ~y~0=v_~y~0_41} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite10, ~y~0] because there is no mapped edge [2019-12-18 14:37:02,398 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [646] [646] L757-->L757-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In1753178284 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In1753178284 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite11_Out1753178284| 0) (not .cse0) (not .cse1)) (and (= ~y$w_buff0_used~0_In1753178284 |P1Thread1of1ForFork1_#t~ite11_Out1753178284|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1753178284, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1753178284} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1753178284, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1753178284, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out1753178284|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-18 14:37:02,398 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [659] [659] L758-->L758-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd2~0_In131638617 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In131638617 256) 0)) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In131638617 256))) (.cse3 (= 0 (mod ~y$r_buff0_thd2~0_In131638617 256)))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite12_Out131638617|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= ~y$w_buff1_used~0_In131638617 |P1Thread1of1ForFork1_#t~ite12_Out131638617|) (or .cse2 .cse3)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In131638617, ~y$w_buff0_used~0=~y$w_buff0_used~0_In131638617, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In131638617, ~y$w_buff1_used~0=~y$w_buff1_used~0_In131638617} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In131638617, ~y$w_buff0_used~0=~y$w_buff0_used~0_In131638617, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In131638617, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out131638617|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In131638617} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-18 14:37:02,399 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [645] [645] L759-->L759-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In1351248524 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In1351248524 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite13_Out1351248524| 0) (not .cse0) (not .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite13_Out1351248524| ~y$r_buff0_thd2~0_In1351248524) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1351248524, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1351248524} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1351248524, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1351248524, P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out1351248524|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13] because there is no mapped edge [2019-12-18 14:37:02,399 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [652] [652] L760-->L760-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff0_used~0_In1614474270 256))) (.cse3 (= (mod ~y$r_buff0_thd2~0_In1614474270 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In1614474270 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In1614474270 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite14_Out1614474270| ~y$r_buff1_thd2~0_In1614474270) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= |P1Thread1of1ForFork1_#t~ite14_Out1614474270| 0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1614474270, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1614474270, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1614474270, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1614474270} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1614474270, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1614474270, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1614474270, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out1614474270|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1614474270} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-18 14:37:02,400 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L760-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_39 1) v_~__unbuffered_cnt~0_38) (= |v_P1Thread1of1ForFork1_#t~ite14_30| v_~y$r_buff1_thd2~0_91) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_30|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_91, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_38, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_29|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-18 14:37:02,400 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [655] [655] L737-->L737-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd1~0_In2119514464 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In2119514464 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite5_Out2119514464| 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |P0Thread1of1ForFork0_#t~ite5_Out2119514464| ~y$w_buff0_used~0_In2119514464)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In2119514464, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In2119514464} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out2119514464|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2119514464, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In2119514464} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-18 14:37:02,400 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [641] [641] L738-->L738-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd1~0_In-150326744 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In-150326744 256) 0)) (.cse3 (= (mod ~y$w_buff1_used~0_In-150326744 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd1~0_In-150326744 256) 0))) (or (and (or .cse0 .cse1) (= ~y$w_buff1_used~0_In-150326744 |P0Thread1of1ForFork0_#t~ite6_Out-150326744|) (or .cse2 .cse3)) (and (= 0 |P0Thread1of1ForFork0_#t~ite6_Out-150326744|) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-150326744, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-150326744, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-150326744, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-150326744} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-150326744|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-150326744, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-150326744, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-150326744, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-150326744} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-18 14:37:02,401 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [643] [643] L739-->L740: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd1~0_In-1092602679 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1092602679 256)))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd1~0_In-1092602679 ~y$r_buff0_thd1~0_Out-1092602679)) (and (not .cse1) (= 0 ~y$r_buff0_thd1~0_Out-1092602679) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1092602679, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1092602679} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1092602679, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-1092602679|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out-1092602679} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 14:37:02,401 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [657] [657] L740-->L740-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In340860912 256))) (.cse0 (= (mod ~y$r_buff1_thd1~0_In340860912 256) 0)) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In340860912 256))) (.cse3 (= (mod ~y$r_buff0_thd1~0_In340860912 256) 0))) (or (and (= 0 |P0Thread1of1ForFork0_#t~ite8_Out340860912|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse2 .cse3) (= ~y$r_buff1_thd1~0_In340860912 |P0Thread1of1ForFork0_#t~ite8_Out340860912|)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In340860912, ~y$w_buff0_used~0=~y$w_buff0_used~0_In340860912, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In340860912, ~y$w_buff1_used~0=~y$w_buff1_used~0_In340860912} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In340860912, ~y$w_buff0_used~0=~y$w_buff0_used~0_In340860912, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out340860912|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In340860912, ~y$w_buff1_used~0=~y$w_buff1_used~0_In340860912} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-18 14:37:02,401 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [668] [668] L740-2-->P0EXIT: Formula: (and (= v_~y$r_buff1_thd1~0_80 |v_P0Thread1of1ForFork0_#t~ite8_30|) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= v_~__unbuffered_cnt~0_31 (+ v_~__unbuffered_cnt~0_32 1))) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_32} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_80, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_29|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_31} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-18 14:37:02,402 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [577] [577] L785-->L787-2: Formula: (and (not (= (mod v_~main$tmp_guard0~0_4 256) 0)) (or (= (mod v_~y$w_buff0_used~0_67 256) 0) (= 0 (mod v_~y$r_buff0_thd0~0_44 256)))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_67, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_44, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_67, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_44, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-18 14:37:02,402 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [656] [656] L787-2-->L787-5: Formula: (let ((.cse0 (= |ULTIMATE.start_main_#t~ite18_Out-1554763370| |ULTIMATE.start_main_#t~ite17_Out-1554763370|)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-1554763370 256))) (.cse1 (= (mod ~y$r_buff1_thd0~0_In-1554763370 256) 0))) (or (and .cse0 (not .cse1) (= |ULTIMATE.start_main_#t~ite17_Out-1554763370| ~y$w_buff1~0_In-1554763370) (not .cse2)) (and .cse0 (= |ULTIMATE.start_main_#t~ite17_Out-1554763370| ~y~0_In-1554763370) (or .cse2 .cse1)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-1554763370, ~y~0=~y~0_In-1554763370, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1554763370, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1554763370} OutVars{ULTIMATE.start_main_#t~ite17=|ULTIMATE.start_main_#t~ite17_Out-1554763370|, ~y$w_buff1~0=~y$w_buff1~0_In-1554763370, ULTIMATE.start_main_#t~ite18=|ULTIMATE.start_main_#t~ite18_Out-1554763370|, ~y~0=~y~0_In-1554763370, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1554763370, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1554763370} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~ite18] because there is no mapped edge [2019-12-18 14:37:02,402 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [644] [644] L788-->L788-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-861644888 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-861644888 256)))) (or (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In-861644888 |ULTIMATE.start_main_#t~ite19_Out-861644888|)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite19_Out-861644888| 0) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-861644888, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-861644888} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-861644888, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out-861644888|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-861644888} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19] because there is no mapped edge [2019-12-18 14:37:02,403 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [648] [648] L789-->L789-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff1_used~0_In-2142278170 256))) (.cse2 (= 0 (mod ~y$r_buff1_thd0~0_In-2142278170 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-2142278170 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-2142278170 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite20_Out-2142278170| 0)) (and (= ~y$w_buff1_used~0_In-2142278170 |ULTIMATE.start_main_#t~ite20_Out-2142278170|) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2142278170, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2142278170, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-2142278170, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2142278170} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-2142278170, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2142278170, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out-2142278170|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-2142278170, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2142278170} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-18 14:37:02,403 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [639] [639] L790-->L790-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In1838054138 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In1838054138 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite21_Out1838054138| 0) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite21_Out1838054138| ~y$r_buff0_thd0~0_In1838054138)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1838054138, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1838054138} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1838054138, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1838054138, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out1838054138|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-18 14:37:02,404 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [651] [651] L791-->L791-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff0_thd0~0_In-2128573414 256))) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In-2128573414 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In-2128573414 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-2128573414 256)))) (or (and (= |ULTIMATE.start_main_#t~ite22_Out-2128573414| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |ULTIMATE.start_main_#t~ite22_Out-2128573414| ~y$r_buff1_thd0~0_In-2128573414) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2128573414, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2128573414, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-2128573414, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2128573414} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-2128573414, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2128573414, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-2128573414, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out-2128573414|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2128573414} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-18 14:37:02,406 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [689] [689] L800-->L800-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1814216036 256) 0))) (or (and .cse0 (= |ULTIMATE.start_main_#t~ite32_Out-1814216036| |ULTIMATE.start_main_#t~ite31_Out-1814216036|) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-1814216036 256)))) (or (and (= 0 (mod ~y$w_buff1_used~0_In-1814216036 256)) .cse1) (and .cse1 (= 0 (mod ~y$r_buff1_thd0~0_In-1814216036 256))) (= 0 (mod ~y$w_buff0_used~0_In-1814216036 256)))) (= ~y$w_buff1~0_In-1814216036 |ULTIMATE.start_main_#t~ite31_Out-1814216036|)) (and (not .cse0) (= ~y$w_buff1~0_In-1814216036 |ULTIMATE.start_main_#t~ite32_Out-1814216036|) (= |ULTIMATE.start_main_#t~ite31_In-1814216036| |ULTIMATE.start_main_#t~ite31_Out-1814216036|)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-1814216036, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1814216036, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1814216036, ~weak$$choice2~0=~weak$$choice2~0_In-1814216036, ULTIMATE.start_main_#t~ite31=|ULTIMATE.start_main_#t~ite31_In-1814216036|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1814216036, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1814216036} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-1814216036, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1814216036, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1814216036, ULTIMATE.start_main_#t~ite31=|ULTIMATE.start_main_#t~ite31_Out-1814216036|, ~weak$$choice2~0=~weak$$choice2~0_In-1814216036, ULTIMATE.start_main_#t~ite32=|ULTIMATE.start_main_#t~ite32_Out-1814216036|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1814216036, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1814216036} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite32] because there is no mapped edge [2019-12-18 14:37:02,408 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [637] [637] L803-->L804: Formula: (and (= v_~y$r_buff0_thd0~0_162 v_~y$r_buff0_thd0~0_163) (not (= (mod v_~weak$$choice2~0_39 256) 0))) InVars {~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_163, ~weak$$choice2~0=v_~weak$$choice2~0_39} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_9|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_11|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_18|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_162, ~weak$$choice2~0=v_~weak$$choice2~0_39} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~ite39, ~y$r_buff0_thd0~0] because there is no mapped edge [2019-12-18 14:37:02,409 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [686] [686] L806-->L809-1: Formula: (and (= 0 v_~y$flush_delayed~0_24) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6| (mod v_~main$tmp_guard1~0_12 256)) (not (= 0 (mod v_~y$flush_delayed~0_25 256))) (= v_~y~0_106 v_~y$mem_tmp~0_13)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_13, ~y$flush_delayed~0=v_~y$flush_delayed~0_25, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_12} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_13, ~y$flush_delayed~0=v_~y$flush_delayed~0_24, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_12, ~y~0=v_~y~0_106, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_22|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[~y$flush_delayed~0, ~y~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 14:37:02,409 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] L809-1-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_10, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-18 14:37:02,517 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 02:37:02 BasicIcfg [2019-12-18 14:37:02,517 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 14:37:02,519 INFO L168 Benchmark]: Toolchain (without parser) took 18262.25 ms. Allocated memory was 141.0 MB in the beginning and 751.8 MB in the end (delta: 610.8 MB). Free memory was 104.3 MB in the beginning and 463.9 MB in the end (delta: -359.7 MB). Peak memory consumption was 251.1 MB. Max. memory is 7.1 GB. [2019-12-18 14:37:02,521 INFO L168 Benchmark]: CDTParser took 0.54 ms. Allocated memory is still 141.0 MB. Free memory was 124.2 MB in the beginning and 124.0 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-18 14:37:02,522 INFO L168 Benchmark]: CACSL2BoogieTranslator took 826.52 ms. Allocated memory was 141.0 MB in the beginning and 203.4 MB in the end (delta: 62.4 MB). Free memory was 103.8 MB in the beginning and 156.5 MB in the end (delta: -52.7 MB). Peak memory consumption was 24.4 MB. Max. memory is 7.1 GB. [2019-12-18 14:37:02,523 INFO L168 Benchmark]: Boogie Procedure Inliner took 64.99 ms. Allocated memory is still 203.4 MB. Free memory was 156.5 MB in the beginning and 153.3 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 7.1 GB. [2019-12-18 14:37:02,523 INFO L168 Benchmark]: Boogie Preprocessor took 34.81 ms. Allocated memory is still 203.4 MB. Free memory was 153.3 MB in the beginning and 150.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-18 14:37:02,526 INFO L168 Benchmark]: RCFGBuilder took 854.12 ms. Allocated memory is still 203.4 MB. Free memory was 150.8 MB in the beginning and 106.7 MB in the end (delta: 44.1 MB). Peak memory consumption was 44.1 MB. Max. memory is 7.1 GB. [2019-12-18 14:37:02,527 INFO L168 Benchmark]: TraceAbstraction took 16476.32 ms. Allocated memory was 203.4 MB in the beginning and 751.8 MB in the end (delta: 548.4 MB). Free memory was 106.0 MB in the beginning and 463.9 MB in the end (delta: -357.9 MB). Peak memory consumption was 190.5 MB. Max. memory is 7.1 GB. [2019-12-18 14:37:02,536 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.54 ms. Allocated memory is still 141.0 MB. Free memory was 124.2 MB in the beginning and 124.0 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 826.52 ms. Allocated memory was 141.0 MB in the beginning and 203.4 MB in the end (delta: 62.4 MB). Free memory was 103.8 MB in the beginning and 156.5 MB in the end (delta: -52.7 MB). Peak memory consumption was 24.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 64.99 ms. Allocated memory is still 203.4 MB. Free memory was 156.5 MB in the beginning and 153.3 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 34.81 ms. Allocated memory is still 203.4 MB. Free memory was 153.3 MB in the beginning and 150.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 854.12 ms. Allocated memory is still 203.4 MB. Free memory was 150.8 MB in the beginning and 106.7 MB in the end (delta: 44.1 MB). Peak memory consumption was 44.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 16476.32 ms. Allocated memory was 203.4 MB in the beginning and 751.8 MB in the end (delta: 548.4 MB). Free memory was 106.0 MB in the beginning and 463.9 MB in the end (delta: -357.9 MB). Peak memory consumption was 190.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.1s, 146 ProgramPointsBefore, 79 ProgramPointsAfterwards, 180 TransitionsBefore, 91 TransitionsAfterwards, 10418 CoEnabledTransitionPairs, 7 FixpointIterations, 28 TrivialSequentialCompositions, 39 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 25 ChoiceCompositions, 3678 VarBasedMoverChecksPositive, 231 VarBasedMoverChecksNegative, 69 SemBasedMoverChecksPositive, 221 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.8s, 0 MoverChecksTotal, 46090 CheckedPairsTotal, 101 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L779] FCALL, FORK 0 pthread_create(&t2019, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L781] FCALL, FORK 0 pthread_create(&t2020, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L727] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L728] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L729] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L730] 1 y$r_buff0_thd1 = (_Bool)1 [L733] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L736] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L750] 2 __unbuffered_p1_EAX = x [L753] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L736] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L756] 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L757] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L758] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L759] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L737] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L738] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L783] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L787] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L788] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L789] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L790] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L791] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L794] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L795] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L796] 0 y$flush_delayed = weak$$choice2 [L797] 0 y$mem_tmp = y VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L798] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L798] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L799] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L799] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L800] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L801] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L801] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L802] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L802] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L804] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L804] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L805] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p1_EAX == 1) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 140 locations, 2 error locations. Result: UNSAFE, OverallTime: 16.1s, OverallIterations: 16, TraceHistogramMax: 1, AutomataDifference: 4.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1565 SDtfs, 1751 SDslu, 3600 SDs, 0 SdLazy, 2399 SolverSat, 180 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 153 GetRequests, 15 SyntacticMatches, 18 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 327 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=14186occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.0s AutomataMinimizationTime, 15 MinimizatonAttempts, 9585 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 608 NumberOfCodeBlocks, 608 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 539 ConstructedInterpolants, 0 QuantifiedInterpolants, 112375 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 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...