/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix054_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 21:49:19,046 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 21:49:19,048 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 21:49:19,060 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 21:49:19,061 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 21:49:19,062 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 21:49:19,063 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 21:49:19,065 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 21:49:19,066 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 21:49:19,067 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 21:49:19,068 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 21:49:19,069 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 21:49:19,070 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 21:49:19,071 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 21:49:19,071 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 21:49:19,073 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 21:49:19,073 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 21:49:19,074 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 21:49:19,076 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 21:49:19,078 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 21:49:19,079 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 21:49:19,081 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 21:49:19,082 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 21:49:19,082 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 21:49:19,085 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 21:49:19,085 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 21:49:19,085 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 21:49:19,086 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 21:49:19,086 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 21:49:19,087 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 21:49:19,088 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 21:49:19,089 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 21:49:19,089 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 21:49:19,090 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 21:49:19,091 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 21:49:19,091 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 21:49:19,092 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 21:49:19,092 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 21:49:19,093 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 21:49:19,093 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 21:49:19,094 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 21:49:19,095 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf [2019-12-18 21:49:19,109 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 21:49:19,109 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 21:49:19,110 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 21:49:19,110 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 21:49:19,111 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 21:49:19,111 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 21:49:19,111 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 21:49:19,111 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 21:49:19,111 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 21:49:19,112 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 21:49:19,112 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 21:49:19,112 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 21:49:19,112 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 21:49:19,112 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 21:49:19,113 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 21:49:19,113 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 21:49:19,113 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 21:49:19,113 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 21:49:19,114 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 21:49:19,114 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 21:49:19,114 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 21:49:19,114 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 21:49:19,114 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 21:49:19,115 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 21:49:19,115 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 21:49:19,115 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 21:49:19,115 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 21:49:19,115 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-18 21:49:19,116 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 21:49:19,116 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 21:49:19,387 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 21:49:19,409 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 21:49:19,412 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 21:49:19,414 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 21:49:19,414 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 21:49:19,415 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix054_tso.opt.i [2019-12-18 21:49:19,479 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fac9aabf7/0535fa01365a483ab07ab9bf755cb796/FLAGd6330ab7c [2019-12-18 21:49:20,024 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 21:49:20,025 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix054_tso.opt.i [2019-12-18 21:49:20,039 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fac9aabf7/0535fa01365a483ab07ab9bf755cb796/FLAGd6330ab7c [2019-12-18 21:49:20,303 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fac9aabf7/0535fa01365a483ab07ab9bf755cb796 [2019-12-18 21:49:20,313 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 21:49:20,314 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 21:49:20,316 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 21:49:20,316 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 21:49:20,320 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 21:49:20,321 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 09:49:20" (1/1) ... [2019-12-18 21:49:20,324 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@695d6cc6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:49:20, skipping insertion in model container [2019-12-18 21:49:20,324 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 09:49:20" (1/1) ... [2019-12-18 21:49:20,334 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 21:49:20,403 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 21:49:20,964 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 21:49:20,979 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 21:49:21,049 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 21:49:21,132 INFO L208 MainTranslator]: Completed translation [2019-12-18 21:49:21,133 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:49:21 WrapperNode [2019-12-18 21:49:21,133 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 21:49:21,134 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 21:49:21,134 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 21:49:21,135 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 21:49:21,142 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:49:21" (1/1) ... [2019-12-18 21:49:21,164 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:49:21" (1/1) ... [2019-12-18 21:49:21,198 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 21:49:21,198 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 21:49:21,198 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 21:49:21,198 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 21:49:21,207 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:49:21" (1/1) ... [2019-12-18 21:49:21,208 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:49:21" (1/1) ... [2019-12-18 21:49:21,212 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:49:21" (1/1) ... [2019-12-18 21:49:21,213 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:49:21" (1/1) ... [2019-12-18 21:49:21,222 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:49:21" (1/1) ... [2019-12-18 21:49:21,226 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:49:21" (1/1) ... [2019-12-18 21:49:21,230 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:49:21" (1/1) ... [2019-12-18 21:49:21,234 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 21:49:21,235 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 21:49:21,235 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 21:49:21,235 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 21:49:21,236 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:49:21" (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 21:49:21,312 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 21:49:21,312 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 21:49:21,312 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 21:49:21,312 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 21:49:21,313 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 21:49:21,313 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 21:49:21,313 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 21:49:21,313 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 21:49:21,313 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 21:49:21,314 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 21:49:21,314 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 21:49:21,316 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 21:49:22,015 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 21:49:22,016 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 21:49:22,017 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 09:49:22 BoogieIcfgContainer [2019-12-18 21:49:22,018 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 21:49:22,019 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 21:49:22,019 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 21:49:22,022 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 21:49:22,023 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 09:49:20" (1/3) ... [2019-12-18 21:49:22,024 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7361e075 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 09:49:22, skipping insertion in model container [2019-12-18 21:49:22,024 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:49:21" (2/3) ... [2019-12-18 21:49:22,024 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7361e075 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 09:49:22, skipping insertion in model container [2019-12-18 21:49:22,025 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 09:49:22" (3/3) ... [2019-12-18 21:49:22,027 INFO L109 eAbstractionObserver]: Analyzing ICFG mix054_tso.opt.i [2019-12-18 21:49:22,037 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 21:49:22,038 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 21:49:22,046 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 21:49:22,047 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 21:49:22,081 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:22,081 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:22,082 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:22,082 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:22,082 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:22,083 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:22,083 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:22,083 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:22,084 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:22,084 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:22,084 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:22,085 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:22,085 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:22,085 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:22,085 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:22,086 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:22,086 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:22,086 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:22,087 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:22,087 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:22,087 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:22,087 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:22,088 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:22,088 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:22,088 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:22,088 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:22,089 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:22,089 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:22,089 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:22,090 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:22,090 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:22,091 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:22,091 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:22,091 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:22,091 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:22,092 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:22,092 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:22,092 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:22,092 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:22,093 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:22,093 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:22,093 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:22,094 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:22,094 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:22,094 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:22,094 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:22,095 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:22,095 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:22,095 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:22,095 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:22,096 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:22,096 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:22,096 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:22,096 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:22,097 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:22,097 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:22,098 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:22,098 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:22,098 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:22,098 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:22,099 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:22,099 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:22,103 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:22,103 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:22,107 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:22,107 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:22,108 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:22,108 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:22,108 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:22,108 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:22,109 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:22,109 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:22,109 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:22,109 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:22,114 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:22,114 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:22,114 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:22,115 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:22,115 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:22,115 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:22,115 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:22,116 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:22,116 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:22,116 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:22,116 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:22,117 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:22,132 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-18 21:49:22,154 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 21:49:22,154 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 21:49:22,154 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 21:49:22,154 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 21:49:22,154 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 21:49:22,155 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 21:49:22,155 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 21:49:22,155 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 21:49:22,172 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 146 places, 180 transitions [2019-12-18 21:49:22,174 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 146 places, 180 transitions [2019-12-18 21:49:22,266 INFO L126 PetriNetUnfolder]: 41/178 cut-off events. [2019-12-18 21:49:22,266 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 21:49:22,280 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 266 event pairs. 6/141 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-18 21:49:22,297 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 146 places, 180 transitions [2019-12-18 21:49:22,333 INFO L126 PetriNetUnfolder]: 41/178 cut-off events. [2019-12-18 21:49:22,333 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 21:49:22,338 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 266 event pairs. 6/141 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-18 21:49:22,352 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 10378 [2019-12-18 21:49:22,353 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-18 21:49:25,164 WARN L192 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 79 [2019-12-18 21:49:25,270 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2019-12-18 21:49:25,307 INFO L206 etLargeBlockEncoding]: Checked pairs total: 48801 [2019-12-18 21:49:25,308 INFO L214 etLargeBlockEncoding]: Total number of compositions: 97 [2019-12-18 21:49:25,311 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 80 places, 93 transitions [2019-12-18 21:49:25,821 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 9180 states. [2019-12-18 21:49:25,823 INFO L276 IsEmpty]: Start isEmpty. Operand 9180 states. [2019-12-18 21:49:25,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-18 21:49:25,830 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:49:25,831 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-18 21:49:25,832 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:49:25,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:49:25,838 INFO L82 PathProgramCache]: Analyzing trace with hash 690083796, now seen corresponding path program 1 times [2019-12-18 21:49:25,847 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:49:25,848 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475873137] [2019-12-18 21:49:25,848 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:49:25,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:49:26,062 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 21:49:26,063 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475873137] [2019-12-18 21:49:26,064 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:49:26,065 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 21:49:26,065 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960535148] [2019-12-18 21:49:26,070 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:49:26,071 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:49:26,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:49:26,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:49:26,091 INFO L87 Difference]: Start difference. First operand 9180 states. Second operand 3 states. [2019-12-18 21:49:26,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:49:26,393 INFO L93 Difference]: Finished difference Result 9108 states and 29960 transitions. [2019-12-18 21:49:26,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:49:26,395 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-18 21:49:26,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:49:26,485 INFO L225 Difference]: With dead ends: 9108 [2019-12-18 21:49:26,485 INFO L226 Difference]: Without dead ends: 8926 [2019-12-18 21:49:26,487 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 21:49:26,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8926 states. [2019-12-18 21:49:26,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8926 to 8926. [2019-12-18 21:49:26,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8926 states. [2019-12-18 21:49:27,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8926 states to 8926 states and 29401 transitions. [2019-12-18 21:49:27,028 INFO L78 Accepts]: Start accepts. Automaton has 8926 states and 29401 transitions. Word has length 5 [2019-12-18 21:49:27,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:49:27,029 INFO L462 AbstractCegarLoop]: Abstraction has 8926 states and 29401 transitions. [2019-12-18 21:49:27,029 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:49:27,029 INFO L276 IsEmpty]: Start isEmpty. Operand 8926 states and 29401 transitions. [2019-12-18 21:49:27,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 21:49:27,032 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:49:27,032 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:49:27,032 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:49:27,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:49:27,033 INFO L82 PathProgramCache]: Analyzing trace with hash 741678959, now seen corresponding path program 1 times [2019-12-18 21:49:27,033 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:49:27,033 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378540887] [2019-12-18 21:49:27,034 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:49:27,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:49:27,126 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 21:49:27,126 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378540887] [2019-12-18 21:49:27,127 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:49:27,127 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:49:27,127 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816085407] [2019-12-18 21:49:27,129 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:49:27,129 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:49:27,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:49:27,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:49:27,131 INFO L87 Difference]: Start difference. First operand 8926 states and 29401 transitions. Second operand 3 states. [2019-12-18 21:49:27,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:49:27,170 INFO L93 Difference]: Finished difference Result 1402 states and 3230 transitions. [2019-12-18 21:49:27,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:49:27,171 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-12-18 21:49:27,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:49:27,179 INFO L225 Difference]: With dead ends: 1402 [2019-12-18 21:49:27,179 INFO L226 Difference]: Without dead ends: 1402 [2019-12-18 21:49:27,181 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:49:27,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1402 states. [2019-12-18 21:49:27,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1402 to 1402. [2019-12-18 21:49:27,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1402 states. [2019-12-18 21:49:27,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1402 states to 1402 states and 3230 transitions. [2019-12-18 21:49:27,216 INFO L78 Accepts]: Start accepts. Automaton has 1402 states and 3230 transitions. Word has length 11 [2019-12-18 21:49:27,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:49:27,217 INFO L462 AbstractCegarLoop]: Abstraction has 1402 states and 3230 transitions. [2019-12-18 21:49:27,217 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:49:27,218 INFO L276 IsEmpty]: Start isEmpty. Operand 1402 states and 3230 transitions. [2019-12-18 21:49:27,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 21:49:27,219 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:49:27,220 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:49:27,220 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:49:27,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:49:27,220 INFO L82 PathProgramCache]: Analyzing trace with hash 520956806, now seen corresponding path program 1 times [2019-12-18 21:49:27,221 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:49:27,221 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187249508] [2019-12-18 21:49:27,221 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:49:27,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:49:27,351 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 21:49:27,351 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187249508] [2019-12-18 21:49:27,352 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:49:27,352 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:49:27,352 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862467343] [2019-12-18 21:49:27,353 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:49:27,353 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:49:27,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:49:27,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:49:27,354 INFO L87 Difference]: Start difference. First operand 1402 states and 3230 transitions. Second operand 4 states. [2019-12-18 21:49:27,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:49:27,661 INFO L93 Difference]: Finished difference Result 1878 states and 4185 transitions. [2019-12-18 21:49:27,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 21:49:27,665 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 21:49:27,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:49:27,675 INFO L225 Difference]: With dead ends: 1878 [2019-12-18 21:49:27,675 INFO L226 Difference]: Without dead ends: 1878 [2019-12-18 21:49:27,676 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 21:49:27,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1878 states. [2019-12-18 21:49:27,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1878 to 1726. [2019-12-18 21:49:27,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1726 states. [2019-12-18 21:49:27,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1726 states to 1726 states and 3896 transitions. [2019-12-18 21:49:27,723 INFO L78 Accepts]: Start accepts. Automaton has 1726 states and 3896 transitions. Word has length 11 [2019-12-18 21:49:27,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:49:27,723 INFO L462 AbstractCegarLoop]: Abstraction has 1726 states and 3896 transitions. [2019-12-18 21:49:27,724 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:49:27,724 INFO L276 IsEmpty]: Start isEmpty. Operand 1726 states and 3896 transitions. [2019-12-18 21:49:27,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-18 21:49:27,727 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:49:27,727 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] [2019-12-18 21:49:27,727 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:49:27,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:49:27,728 INFO L82 PathProgramCache]: Analyzing trace with hash -707662606, now seen corresponding path program 1 times [2019-12-18 21:49:27,728 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:49:27,728 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537568292] [2019-12-18 21:49:27,728 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:49:27,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:49:27,784 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 21:49:27,784 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537568292] [2019-12-18 21:49:27,785 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:49:27,785 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:49:27,785 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714205881] [2019-12-18 21:49:27,786 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:49:27,786 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:49:27,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:49:27,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:49:27,787 INFO L87 Difference]: Start difference. First operand 1726 states and 3896 transitions. Second operand 4 states. [2019-12-18 21:49:27,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:49:27,826 INFO L93 Difference]: Finished difference Result 357 states and 661 transitions. [2019-12-18 21:49:27,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 21:49:27,827 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2019-12-18 21:49:27,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:49:27,829 INFO L225 Difference]: With dead ends: 357 [2019-12-18 21:49:27,830 INFO L226 Difference]: Without dead ends: 357 [2019-12-18 21:49:27,834 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:49:27,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2019-12-18 21:49:27,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 322. [2019-12-18 21:49:27,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 322 states. [2019-12-18 21:49:27,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 596 transitions. [2019-12-18 21:49:27,928 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 596 transitions. Word has length 23 [2019-12-18 21:49:27,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:49:27,929 INFO L462 AbstractCegarLoop]: Abstraction has 322 states and 596 transitions. [2019-12-18 21:49:27,929 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:49:27,929 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 596 transitions. [2019-12-18 21:49:27,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-18 21:49:27,931 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:49:27,931 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 21:49:27,931 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:49:27,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:49:27,932 INFO L82 PathProgramCache]: Analyzing trace with hash -1936914374, now seen corresponding path program 1 times [2019-12-18 21:49:27,932 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:49:27,932 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955534967] [2019-12-18 21:49:27,933 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:49:27,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:49:28,063 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 21:49:28,064 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955534967] [2019-12-18 21:49:28,064 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:49:28,064 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:49:28,065 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511088145] [2019-12-18 21:49:28,065 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:49:28,066 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:49:28,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:49:28,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:49:28,066 INFO L87 Difference]: Start difference. First operand 322 states and 596 transitions. Second operand 3 states. [2019-12-18 21:49:28,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:49:28,127 INFO L93 Difference]: Finished difference Result 332 states and 611 transitions. [2019-12-18 21:49:28,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:49:28,128 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-18 21:49:28,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:49:28,130 INFO L225 Difference]: With dead ends: 332 [2019-12-18 21:49:28,131 INFO L226 Difference]: Without dead ends: 332 [2019-12-18 21:49:28,131 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 21:49:28,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2019-12-18 21:49:28,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 328. [2019-12-18 21:49:28,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2019-12-18 21:49:28,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 607 transitions. [2019-12-18 21:49:28,139 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 607 transitions. Word has length 52 [2019-12-18 21:49:28,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:49:28,141 INFO L462 AbstractCegarLoop]: Abstraction has 328 states and 607 transitions. [2019-12-18 21:49:28,141 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:49:28,141 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 607 transitions. [2019-12-18 21:49:28,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-18 21:49:28,143 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:49:28,143 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 21:49:28,143 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:49:28,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:49:28,144 INFO L82 PathProgramCache]: Analyzing trace with hash 1506335965, now seen corresponding path program 1 times [2019-12-18 21:49:28,144 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:49:28,144 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331888188] [2019-12-18 21:49:28,145 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:49:28,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:49:28,242 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 21:49:28,242 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331888188] [2019-12-18 21:49:28,242 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:49:28,243 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 21:49:28,243 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112967145] [2019-12-18 21:49:28,243 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 21:49:28,244 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:49:28,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 21:49:28,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:49:28,244 INFO L87 Difference]: Start difference. First operand 328 states and 607 transitions. Second operand 5 states. [2019-12-18 21:49:28,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:49:28,467 INFO L93 Difference]: Finished difference Result 459 states and 843 transitions. [2019-12-18 21:49:28,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 21:49:28,469 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2019-12-18 21:49:28,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:49:28,472 INFO L225 Difference]: With dead ends: 459 [2019-12-18 21:49:28,472 INFO L226 Difference]: Without dead ends: 459 [2019-12-18 21:49:28,473 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 21:49:28,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2019-12-18 21:49:28,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 375. [2019-12-18 21:49:28,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2019-12-18 21:49:28,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 698 transitions. [2019-12-18 21:49:28,482 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 698 transitions. Word has length 52 [2019-12-18 21:49:28,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:49:28,484 INFO L462 AbstractCegarLoop]: Abstraction has 375 states and 698 transitions. [2019-12-18 21:49:28,484 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 21:49:28,484 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 698 transitions. [2019-12-18 21:49:28,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-18 21:49:28,486 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:49:28,487 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 21:49:28,487 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:49:28,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:49:28,487 INFO L82 PathProgramCache]: Analyzing trace with hash -788706827, now seen corresponding path program 2 times [2019-12-18 21:49:28,489 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:49:28,489 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773426806] [2019-12-18 21:49:28,489 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:49:28,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:49:28,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:49:28,616 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773426806] [2019-12-18 21:49:28,617 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:49:28,617 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:49:28,618 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720829236] [2019-12-18 21:49:28,618 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:49:28,618 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:49:28,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:49:28,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:49:28,619 INFO L87 Difference]: Start difference. First operand 375 states and 698 transitions. Second operand 3 states. [2019-12-18 21:49:28,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:49:28,634 INFO L93 Difference]: Finished difference Result 375 states and 683 transitions. [2019-12-18 21:49:28,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:49:28,635 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-18 21:49:28,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:49:28,641 INFO L225 Difference]: With dead ends: 375 [2019-12-18 21:49:28,641 INFO L226 Difference]: Without dead ends: 375 [2019-12-18 21:49:28,642 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 21:49:28,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2019-12-18 21:49:28,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 363. [2019-12-18 21:49:28,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 363 states. [2019-12-18 21:49:28,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 661 transitions. [2019-12-18 21:49:28,652 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 661 transitions. Word has length 52 [2019-12-18 21:49:28,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:49:28,653 INFO L462 AbstractCegarLoop]: Abstraction has 363 states and 661 transitions. [2019-12-18 21:49:28,653 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:49:28,653 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 661 transitions. [2019-12-18 21:49:28,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-18 21:49:28,656 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:49:28,656 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 21:49:28,657 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:49:28,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:49:28,657 INFO L82 PathProgramCache]: Analyzing trace with hash -817414714, now seen corresponding path program 1 times [2019-12-18 21:49:28,658 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:49:28,658 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897093405] [2019-12-18 21:49:28,658 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:49:28,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:49:28,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:49:28,819 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897093405] [2019-12-18 21:49:28,820 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:49:28,820 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:49:28,820 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538999558] [2019-12-18 21:49:28,820 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:49:28,821 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:49:28,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:49:28,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:49:28,822 INFO L87 Difference]: Start difference. First operand 363 states and 661 transitions. Second operand 3 states. [2019-12-18 21:49:28,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:49:28,887 INFO L93 Difference]: Finished difference Result 363 states and 660 transitions. [2019-12-18 21:49:28,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:49:28,887 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-12-18 21:49:28,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:49:28,890 INFO L225 Difference]: With dead ends: 363 [2019-12-18 21:49:28,890 INFO L226 Difference]: Without dead ends: 363 [2019-12-18 21:49:28,890 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 21:49:28,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2019-12-18 21:49:28,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 274. [2019-12-18 21:49:28,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274 states. [2019-12-18 21:49:28,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 499 transitions. [2019-12-18 21:49:28,898 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 499 transitions. Word has length 53 [2019-12-18 21:49:28,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:49:28,899 INFO L462 AbstractCegarLoop]: Abstraction has 274 states and 499 transitions. [2019-12-18 21:49:28,899 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:49:28,899 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 499 transitions. [2019-12-18 21:49:28,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 21:49:28,900 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:49:28,901 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 21:49:28,901 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:49:28,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:49:28,902 INFO L82 PathProgramCache]: Analyzing trace with hash 1599315070, now seen corresponding path program 1 times [2019-12-18 21:49:28,902 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:49:28,902 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65213792] [2019-12-18 21:49:28,902 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:49:28,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:49:29,093 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 21:49:29,097 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65213792] [2019-12-18 21:49:29,097 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:49:29,098 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 21:49:29,098 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384651418] [2019-12-18 21:49:29,099 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 21:49:29,099 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:49:29,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 21:49:29,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 21:49:29,099 INFO L87 Difference]: Start difference. First operand 274 states and 499 transitions. Second operand 7 states. [2019-12-18 21:49:29,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:49:29,208 INFO L93 Difference]: Finished difference Result 489 states and 885 transitions. [2019-12-18 21:49:29,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 21:49:29,208 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-12-18 21:49:29,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:49:29,210 INFO L225 Difference]: With dead ends: 489 [2019-12-18 21:49:29,210 INFO L226 Difference]: Without dead ends: 234 [2019-12-18 21:49:29,213 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-12-18 21:49:29,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2019-12-18 21:49:29,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 210. [2019-12-18 21:49:29,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2019-12-18 21:49:29,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 372 transitions. [2019-12-18 21:49:29,218 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 372 transitions. Word has length 54 [2019-12-18 21:49:29,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:49:29,219 INFO L462 AbstractCegarLoop]: Abstraction has 210 states and 372 transitions. [2019-12-18 21:49:29,219 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 21:49:29,219 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 372 transitions. [2019-12-18 21:49:29,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 21:49:29,220 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:49:29,220 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 21:49:29,220 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:49:29,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:49:29,221 INFO L82 PathProgramCache]: Analyzing trace with hash 1986508478, now seen corresponding path program 2 times [2019-12-18 21:49:29,221 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:49:29,222 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307694069] [2019-12-18 21:49:29,222 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:49:29,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:49:29,635 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 21:49:29,635 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307694069] [2019-12-18 21:49:29,636 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:49:29,636 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 21:49:29,636 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119397247] [2019-12-18 21:49:29,636 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-18 21:49:29,637 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:49:29,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-18 21:49:29,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2019-12-18 21:49:29,637 INFO L87 Difference]: Start difference. First operand 210 states and 372 transitions. Second operand 13 states. [2019-12-18 21:49:30,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:49:30,247 INFO L93 Difference]: Finished difference Result 378 states and 653 transitions. [2019-12-18 21:49:30,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 21:49:30,248 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 54 [2019-12-18 21:49:30,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:49:30,251 INFO L225 Difference]: With dead ends: 378 [2019-12-18 21:49:30,251 INFO L226 Difference]: Without dead ends: 344 [2019-12-18 21:49:30,251 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=82, Invalid=380, Unknown=0, NotChecked=0, Total=462 [2019-12-18 21:49:30,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2019-12-18 21:49:30,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 310. [2019-12-18 21:49:30,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 310 states. [2019-12-18 21:49:30,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 543 transitions. [2019-12-18 21:49:30,259 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 543 transitions. Word has length 54 [2019-12-18 21:49:30,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:49:30,260 INFO L462 AbstractCegarLoop]: Abstraction has 310 states and 543 transitions. [2019-12-18 21:49:30,260 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-18 21:49:30,260 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 543 transitions. [2019-12-18 21:49:30,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 21:49:30,261 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:49:30,261 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 21:49:30,262 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:49:30,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:49:30,262 INFO L82 PathProgramCache]: Analyzing trace with hash 1943073384, now seen corresponding path program 3 times [2019-12-18 21:49:30,262 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:49:30,262 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286075638] [2019-12-18 21:49:30,263 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:49:30,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:49:30,969 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 21:49:30,969 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286075638] [2019-12-18 21:49:30,969 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:49:30,970 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-12-18 21:49:30,970 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434469955] [2019-12-18 21:49:30,970 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-18 21:49:30,970 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:49:30,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-18 21:49:30,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2019-12-18 21:49:30,971 INFO L87 Difference]: Start difference. First operand 310 states and 543 transitions. Second operand 18 states. [2019-12-18 21:49:32,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:49:32,488 INFO L93 Difference]: Finished difference Result 808 states and 1380 transitions. [2019-12-18 21:49:32,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-18 21:49:32,488 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 54 [2019-12-18 21:49:32,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:49:32,492 INFO L225 Difference]: With dead ends: 808 [2019-12-18 21:49:32,492 INFO L226 Difference]: Without dead ends: 774 [2019-12-18 21:49:32,493 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 1 SyntacticMatches, 8 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 241 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=189, Invalid=933, Unknown=0, NotChecked=0, Total=1122 [2019-12-18 21:49:32,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 774 states. [2019-12-18 21:49:32,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 774 to 329. [2019-12-18 21:49:32,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2019-12-18 21:49:32,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 579 transitions. [2019-12-18 21:49:32,502 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 579 transitions. Word has length 54 [2019-12-18 21:49:32,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:49:32,502 INFO L462 AbstractCegarLoop]: Abstraction has 329 states and 579 transitions. [2019-12-18 21:49:32,502 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-18 21:49:32,503 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 579 transitions. [2019-12-18 21:49:32,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 21:49:32,503 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:49:32,504 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 21:49:32,504 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:49:32,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:49:32,504 INFO L82 PathProgramCache]: Analyzing trace with hash -2083989660, now seen corresponding path program 4 times [2019-12-18 21:49:32,504 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:49:32,505 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301700588] [2019-12-18 21:49:32,505 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:49:32,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:49:32,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:49:32,915 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301700588] [2019-12-18 21:49:32,915 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:49:32,916 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-18 21:49:32,916 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841893312] [2019-12-18 21:49:32,916 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-18 21:49:32,917 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:49:32,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-18 21:49:32,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2019-12-18 21:49:32,917 INFO L87 Difference]: Start difference. First operand 329 states and 579 transitions. Second operand 14 states. [2019-12-18 21:49:33,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:49:33,621 INFO L93 Difference]: Finished difference Result 433 states and 740 transitions. [2019-12-18 21:49:33,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 21:49:33,622 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 54 [2019-12-18 21:49:33,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:49:33,625 INFO L225 Difference]: With dead ends: 433 [2019-12-18 21:49:33,625 INFO L226 Difference]: Without dead ends: 399 [2019-12-18 21:49:33,625 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=129, Invalid=521, Unknown=0, NotChecked=0, Total=650 [2019-12-18 21:49:33,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2019-12-18 21:49:33,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 318. [2019-12-18 21:49:33,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 318 states. [2019-12-18 21:49:33,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 557 transitions. [2019-12-18 21:49:33,632 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 557 transitions. Word has length 54 [2019-12-18 21:49:33,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:49:33,634 INFO L462 AbstractCegarLoop]: Abstraction has 318 states and 557 transitions. [2019-12-18 21:49:33,634 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-18 21:49:33,634 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 557 transitions. [2019-12-18 21:49:33,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 21:49:33,635 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:49:33,635 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 21:49:33,635 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:49:33,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:49:33,635 INFO L82 PathProgramCache]: Analyzing trace with hash 1497243502, now seen corresponding path program 5 times [2019-12-18 21:49:33,636 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:49:33,636 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741962769] [2019-12-18 21:49:33,636 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:49:33,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 21:49:33,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 21:49:33,804 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 21:49:33,804 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 21:49:33,808 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [697] [697] ULTIMATE.startENTRY-->L779: Formula: (let ((.cse0 (store |v_#valid_49| 0 0))) (and (= 0 v_~x$read_delayed_var~0.base_6) (= v_~main$tmp_guard0~0_10 0) (= v_~x$r_buff1_thd1~0_19 0) (= 0 v_~x$read_delayed_var~0.offset_6) (= 0 v_~__unbuffered_p1_EAX~0_11) (= 0 v_~x$w_buff1~0_25) (= v_~main$tmp_guard1~0_11 0) (= v_~x~0_27 0) (= v_~x$flush_delayed~0_16 0) (= 0 v_~x$w_buff0_used~0_104) (= 0 v_~x$read_delayed~0_6) (< 0 |v_#StackHeapBarrier_14|) (= 0 |v_#NULL.base_4|) (= |v_ULTIMATE.start_main_~#t1455~0.offset_17| 0) (= 0 v_~weak$$choice2~0_33) (= v_~x$w_buff1_used~0_65 0) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1455~0.base_22| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1455~0.base_22|) |v_ULTIMATE.start_main_~#t1455~0.offset_17| 0)) |v_#memory_int_13|) (= v_~x$r_buff1_thd0~0_48 0) (= 0 v_~x$r_buff0_thd0~0_76) (= (store .cse0 |v_ULTIMATE.start_main_~#t1455~0.base_22| 1) |v_#valid_47|) (= v_~x$r_buff1_thd2~0_16 0) (= 0 v_~y~0_8) (= |v_#NULL.offset_4| 0) (= 0 v_~x$r_buff0_thd2~0_25) (= v_~x$mem_tmp~0_11 0) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t1455~0.base_22| 4)) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1455~0.base_22|) (= 0 v_~weak$$choice0~0_6) (= (select .cse0 |v_ULTIMATE.start_main_~#t1455~0.base_22|) 0) (= 0 v_~x$w_buff0~0_28) (= 0 v_~__unbuffered_cnt~0_16) (= 0 v_~x$r_buff0_thd1~0_19))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_28, ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_14|, ~x$flush_delayed~0=v_~x$flush_delayed~0_16, ULTIMATE.start_main_~#t1455~0.base=|v_ULTIMATE.start_main_~#t1455~0.base_22|, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_11|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_19, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_9|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_14|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_9|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_14|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_11, #length=|v_#length_15|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_76, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_11|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_13|, ULTIMATE.start_main_#t~nondet24=|v_ULTIMATE.start_main_#t~nondet24_7|, ~x$w_buff1~0=v_~x$w_buff1~0_25, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_14|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_65, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_16, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_14|, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_14|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_13|, ULTIMATE.start_main_~#t1456~0.offset=|v_ULTIMATE.start_main_~#t1456~0.offset_14|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_6, ~weak$$choice0~0=v_~weak$$choice0~0_6, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_15|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, ~x~0=v_~x~0_27, ULTIMATE.start_main_~#t1455~0.offset=|v_ULTIMATE.start_main_~#t1455~0.offset_17|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_19, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_11|, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_11|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_11, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_12|, ~x$mem_tmp~0=v_~x$mem_tmp~0_11, ULTIMATE.start_main_~#t1456~0.base=|v_ULTIMATE.start_main_~#t1456~0.base_17|, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_9|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_12|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_11|, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_12|, ~y~0=v_~y~0_8, ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_11|, ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_7|, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_9|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_12|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_11|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_48, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_25, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_13|, #NULL.base=|v_#NULL.base_4|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_15|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_104, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_13|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_17|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_7|, ~weak$$choice2~0=v_~weak$$choice2~0_33, ~x$read_delayed~0=v_~x$read_delayed~0_6} AuxVars[] AssignedVars[~x$w_buff0~0, ULTIMATE.start_main_#t~ite28, ~x$flush_delayed~0, ULTIMATE.start_main_~#t1455~0.base, #NULL.offset, ULTIMATE.start_main_#t~ite26, ~x$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, ~__unbuffered_p1_EAX~0, #length, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~nondet24, ~x$w_buff1~0, ULTIMATE.start_main_#t~ite35, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite33, ULTIMATE.start_main_~#t1456~0.offset, ~x$read_delayed_var~0.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~nondet15, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_~#t1455~0.offset, ~x$r_buff0_thd1~0, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_#t~ite25, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ~x$mem_tmp~0, ULTIMATE.start_main_~#t1456~0.base, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite30, ~y~0, ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~nondet23, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ~weak$$choice2~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-18 21:49:33,809 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [668] [668] L779-1-->L781: Formula: (and (= (store |v_#valid_26| |v_ULTIMATE.start_main_~#t1456~0.base_10| 1) |v_#valid_25|) (= (store |v_#length_10| |v_ULTIMATE.start_main_~#t1456~0.base_10| 4) |v_#length_9|) (= 0 (select |v_#valid_26| |v_ULTIMATE.start_main_~#t1456~0.base_10|)) (< |v_#StackHeapBarrier_7| |v_ULTIMATE.start_main_~#t1456~0.base_10|) (= |v_#memory_int_7| (store |v_#memory_int_8| |v_ULTIMATE.start_main_~#t1456~0.base_10| (store (select |v_#memory_int_8| |v_ULTIMATE.start_main_~#t1456~0.base_10|) |v_ULTIMATE.start_main_~#t1456~0.offset_9| 1))) (= |v_ULTIMATE.start_main_~#t1456~0.offset_9| 0) (not (= 0 |v_ULTIMATE.start_main_~#t1456~0.base_10|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_7|, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_8|, #length=|v_#length_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_7|, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_5|, #length=|v_#length_9|, ULTIMATE.start_main_~#t1456~0.base=|v_ULTIMATE.start_main_~#t1456~0.base_10|, ULTIMATE.start_main_~#t1456~0.offset=|v_ULTIMATE.start_main_~#t1456~0.offset_9|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_#t~nondet15, #length, ULTIMATE.start_main_~#t1456~0.base, ULTIMATE.start_main_~#t1456~0.offset] because there is no mapped edge [2019-12-18 21:49:33,810 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [623] [623] P1ENTRY-->L4-3: Formula: (and (= |v_P1Thread1of1ForFork1_#in~arg.offset_5| v_P1Thread1of1ForFork1_~arg.offset_5) (= v_~x$w_buff0~0_21 v_~x$w_buff1~0_18) (= v_P1Thread1of1ForFork1_~arg.base_5 |v_P1Thread1of1ForFork1_#in~arg.base_5|) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_5| 1) (= 0 (mod v_~x$w_buff1_used~0_57 256)) (= 1 v_~x$w_buff0_used~0_88) (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_7 |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_5|) (= v_~x$w_buff1_used~0_57 v_~x$w_buff0_used~0_89) (= 2 v_~x$w_buff0~0_20)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_21, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_5|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_5|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_89} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_7, ~x$w_buff0~0=v_~x$w_buff0~0_20, P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_5, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_5|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_5, ~x$w_buff1~0=v_~x$w_buff1~0_18, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_5|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_5|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_57, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_88} AuxVars[] AssignedVars[P1Thread1of1ForFork1___VERIFIER_assert_~expression, ~x$w_buff0~0, P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression, P1Thread1of1ForFork1_~arg.base, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$w_buff0_used~0] because there is no mapped edge [2019-12-18 21:49:33,813 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [650] [650] L728-2-->L728-5: Formula: (let ((.cse2 (= |P0Thread1of1ForFork0_#t~ite4_Out-44130656| |P0Thread1of1ForFork0_#t~ite3_Out-44130656|)) (.cse1 (= (mod ~x$w_buff1_used~0_In-44130656 256) 0)) (.cse0 (= (mod ~x$r_buff1_thd1~0_In-44130656 256) 0))) (or (and (or .cse0 .cse1) .cse2 (= ~x~0_In-44130656 |P0Thread1of1ForFork0_#t~ite3_Out-44130656|)) (and .cse2 (not .cse1) (= ~x$w_buff1~0_In-44130656 |P0Thread1of1ForFork0_#t~ite3_Out-44130656|) (not .cse0)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-44130656, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-44130656, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-44130656, ~x~0=~x~0_In-44130656} OutVars{P0Thread1of1ForFork0_#t~ite3=|P0Thread1of1ForFork0_#t~ite3_Out-44130656|, P0Thread1of1ForFork0_#t~ite4=|P0Thread1of1ForFork0_#t~ite4_Out-44130656|, ~x$w_buff1~0=~x$w_buff1~0_In-44130656, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-44130656, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-44130656, ~x~0=~x~0_In-44130656} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite3, P0Thread1of1ForFork0_#t~ite4] because there is no mapped edge [2019-12-18 21:49:33,814 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [658] [658] L729-->L729-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In466364943 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In466364943 256)))) (or (and (not .cse0) (= 0 |P0Thread1of1ForFork0_#t~ite5_Out466364943|) (not .cse1)) (and (or .cse1 .cse0) (= ~x$w_buff0_used~0_In466364943 |P0Thread1of1ForFork0_#t~ite5_Out466364943|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In466364943, ~x$w_buff0_used~0=~x$w_buff0_used~0_In466364943} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out466364943|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In466364943, ~x$w_buff0_used~0=~x$w_buff0_used~0_In466364943} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-18 21:49:33,815 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [640] [640] L730-->L730-2: Formula: (let ((.cse3 (= (mod ~x$w_buff1_used~0_In-283837080 256) 0)) (.cse2 (= 0 (mod ~x$r_buff1_thd1~0_In-283837080 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In-283837080 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In-283837080 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite6_Out-283837080| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= |P0Thread1of1ForFork0_#t~ite6_Out-283837080| ~x$w_buff1_used~0_In-283837080) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-283837080, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-283837080, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-283837080, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-283837080} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-283837080|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-283837080, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-283837080, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-283837080, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-283837080} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-18 21:49:33,816 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [647] [647] L757-->L757-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In-661801763 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In-661801763 256) 0))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite11_Out-661801763|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~x$w_buff0_used~0_In-661801763 |P1Thread1of1ForFork1_#t~ite11_Out-661801763|)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-661801763, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-661801763} OutVars{P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out-661801763|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-661801763, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-661801763} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-18 21:49:33,817 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [652] [652] L731-->L731-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd1~0_In-1850628563 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-1850628563 256)))) (or (and (= ~x$r_buff0_thd1~0_In-1850628563 |P0Thread1of1ForFork0_#t~ite7_Out-1850628563|) (or .cse0 .cse1)) (and (not .cse0) (= 0 |P0Thread1of1ForFork0_#t~ite7_Out-1850628563|) (not .cse1)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1850628563, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1850628563} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1850628563, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-1850628563|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1850628563} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-18 21:49:33,818 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [642] [642] L732-->L732-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd1~0_In1091176772 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In1091176772 256) 0)) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In1091176772 256))) (.cse2 (= (mod ~x$r_buff1_thd1~0_In1091176772 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite8_Out1091176772| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite8_Out1091176772| ~x$r_buff1_thd1~0_In1091176772) (or .cse3 .cse2)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1091176772, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1091176772, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1091176772, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1091176772} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1091176772, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out1091176772|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1091176772, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1091176772, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1091176772} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-18 21:49:33,818 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [678] [678] L732-2-->P0EXIT: Formula: (and (= v_~x$r_buff1_thd1~0_15 |v_P0Thread1of1ForFork0_#t~ite8_8|) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= v_~__unbuffered_cnt~0_9 (+ v_~__unbuffered_cnt~0_10 1))) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_7|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_15} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~x$r_buff1_thd1~0] because there is no mapped edge [2019-12-18 21:49:33,818 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [655] [655] L758-->L758-2: Formula: (let ((.cse2 (= 0 (mod ~x$r_buff0_thd2~0_In-1643087850 256))) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In-1643087850 256))) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In-1643087850 256))) (.cse1 (= 0 (mod ~x$r_buff1_thd2~0_In-1643087850 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite12_Out-1643087850| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~x$w_buff1_used~0_In-1643087850 |P1Thread1of1ForFork1_#t~ite12_Out-1643087850|) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1643087850, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1643087850, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1643087850, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1643087850} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-1643087850, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1643087850, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out-1643087850|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1643087850, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1643087850} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-18 21:49:33,819 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [656] [656] L759-->L760: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd2~0_In2057265381 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In2057265381 256)))) (or (and (= ~x$r_buff0_thd2~0_Out2057265381 0) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~x$r_buff0_thd2~0_In2057265381 ~x$r_buff0_thd2~0_Out2057265381)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In2057265381, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2057265381} OutVars{P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out2057265381|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out2057265381, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2057265381} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-18 21:49:33,819 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [657] [657] L760-->L760-2: Formula: (let ((.cse3 (= (mod ~x$w_buff1_used~0_In-853731209 256) 0)) (.cse2 (= (mod ~x$r_buff1_thd2~0_In-853731209 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-853731209 256))) (.cse0 (= (mod ~x$r_buff0_thd2~0_In-853731209 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite14_Out-853731209| ~x$r_buff1_thd2~0_In-853731209) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= |P1Thread1of1ForFork1_#t~ite14_Out-853731209| 0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-853731209, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-853731209, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-853731209, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-853731209} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-853731209, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-853731209, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-853731209, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out-853731209|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-853731209} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-18 21:49:33,820 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [681] [681] L760-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~x$r_buff1_thd2~0_12 |v_P1Thread1of1ForFork1_#t~ite14_8|) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_8|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_12, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_7|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-18 21:49:33,820 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [586] [586] L781-1-->L787: Formula: (and (= v_~main$tmp_guard0~0_4 1) (= v_~__unbuffered_cnt~0_7 2)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_7} OutVars{ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_7, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet16, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 21:49:33,821 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [651] [651] L787-2-->L787-5: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff1_used~0_In-391616586 256))) (.cse2 (= (mod ~x$r_buff1_thd0~0_In-391616586 256) 0)) (.cse1 (= |ULTIMATE.start_main_#t~ite18_Out-391616586| |ULTIMATE.start_main_#t~ite17_Out-391616586|))) (or (and (not .cse0) .cse1 (= |ULTIMATE.start_main_#t~ite17_Out-391616586| ~x$w_buff1~0_In-391616586) (not .cse2)) (and (or .cse0 .cse2) .cse1 (= ~x~0_In-391616586 |ULTIMATE.start_main_#t~ite17_Out-391616586|)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-391616586, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-391616586, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-391616586, ~x~0=~x~0_In-391616586} OutVars{ULTIMATE.start_main_#t~ite17=|ULTIMATE.start_main_#t~ite17_Out-391616586|, ULTIMATE.start_main_#t~ite18=|ULTIMATE.start_main_#t~ite18_Out-391616586|, ~x$w_buff1~0=~x$w_buff1~0_In-391616586, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-391616586, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-391616586, ~x~0=~x~0_In-391616586} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~ite18] because there is no mapped edge [2019-12-18 21:49:33,821 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [648] [648] L788-->L788-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In-586894762 256))) (.cse1 (= (mod ~x$r_buff0_thd0~0_In-586894762 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite19_Out-586894762| 0) (not .cse1)) (and (= ~x$w_buff0_used~0_In-586894762 |ULTIMATE.start_main_#t~ite19_Out-586894762|) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-586894762, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-586894762} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-586894762, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out-586894762|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-586894762} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19] because there is no mapped edge [2019-12-18 21:49:33,822 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [643] [643] L789-->L789-2: Formula: (let ((.cse2 (= (mod ~x$w_buff0_used~0_In753146908 256) 0)) (.cse3 (= (mod ~x$r_buff0_thd0~0_In753146908 256) 0)) (.cse1 (= (mod ~x$r_buff1_thd0~0_In753146908 256) 0)) (.cse0 (= (mod ~x$w_buff1_used~0_In753146908 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite20_Out753146908|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite20_Out753146908| ~x$w_buff1_used~0_In753146908)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In753146908, ~x$w_buff1_used~0=~x$w_buff1_used~0_In753146908, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In753146908, ~x$w_buff0_used~0=~x$w_buff0_used~0_In753146908} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In753146908, ~x$w_buff1_used~0=~x$w_buff1_used~0_In753146908, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out753146908|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In753146908, ~x$w_buff0_used~0=~x$w_buff0_used~0_In753146908} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-18 21:49:33,823 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [661] [661] L790-->L790-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In2141151083 256))) (.cse1 (= (mod ~x$r_buff0_thd0~0_In2141151083 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite21_Out2141151083| 0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite21_Out2141151083| ~x$r_buff0_thd0~0_In2141151083) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In2141151083, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2141151083} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In2141151083, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out2141151083|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2141151083} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-18 21:49:33,824 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [653] [653] L791-->L791-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In-717449074 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In-717449074 256))) (.cse2 (= (mod ~x$w_buff1_used~0_In-717449074 256) 0)) (.cse3 (= 0 (mod ~x$r_buff1_thd0~0_In-717449074 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite22_Out-717449074| 0)) (and (or .cse1 .cse0) (or .cse2 .cse3) (= ~x$r_buff1_thd0~0_In-717449074 |ULTIMATE.start_main_#t~ite22_Out-717449074|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-717449074, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-717449074, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-717449074, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-717449074} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-717449074, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-717449074, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-717449074, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out-717449074|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-717449074} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-18 21:49:33,883 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [683] [683] L800-->L800-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1723744512 256)))) (or (and .cse0 (= |ULTIMATE.start_main_#t~ite31_Out1723744512| |ULTIMATE.start_main_#t~ite32_Out1723744512|) (let ((.cse1 (= (mod ~x$r_buff0_thd0~0_In1723744512 256) 0))) (or (and .cse1 (= 0 (mod ~x$w_buff1_used~0_In1723744512 256))) (= (mod ~x$w_buff0_used~0_In1723744512 256) 0) (and .cse1 (= (mod ~x$r_buff1_thd0~0_In1723744512 256) 0)))) (= |ULTIMATE.start_main_#t~ite31_Out1723744512| ~x$w_buff1~0_In1723744512)) (and (= |ULTIMATE.start_main_#t~ite32_Out1723744512| ~x$w_buff1~0_In1723744512) (not .cse0) (= |ULTIMATE.start_main_#t~ite31_In1723744512| |ULTIMATE.start_main_#t~ite31_Out1723744512|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1723744512, ~x$w_buff1~0=~x$w_buff1~0_In1723744512, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1723744512, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1723744512, ~weak$$choice2~0=~weak$$choice2~0_In1723744512, ULTIMATE.start_main_#t~ite31=|ULTIMATE.start_main_#t~ite31_In1723744512|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1723744512} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1723744512, ~x$w_buff1~0=~x$w_buff1~0_In1723744512, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1723744512, ULTIMATE.start_main_#t~ite31=|ULTIMATE.start_main_#t~ite31_Out1723744512|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1723744512, ~weak$$choice2~0=~weak$$choice2~0_In1723744512, ULTIMATE.start_main_#t~ite32=|ULTIMATE.start_main_#t~ite32_Out1723744512|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1723744512} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite32] because there is no mapped edge [2019-12-18 21:49:33,885 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [628] [628] L803-->L804: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_25 256))) (= v_~x$r_buff0_thd0~0_65 v_~x$r_buff0_thd0~0_64)) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_65, ~weak$$choice2~0=v_~weak$$choice2~0_25} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_64, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_8|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_10|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_9|, ~weak$$choice2~0=v_~weak$$choice2~0_25} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-18 21:49:33,886 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [679] [679] L806-->L809-1: Formula: (and (not (= 0 (mod v_~x$flush_delayed~0_11 256))) (= (mod v_~main$tmp_guard1~0_6 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|) (= v_~x$mem_tmp~0_7 v_~x~0_22) (= v_~x$flush_delayed~0_10 0)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_11, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_6, ~x$mem_tmp~0=v_~x$mem_tmp~0_7} OutVars{~x$flush_delayed~0=v_~x$flush_delayed~0_10, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_6, ~x$mem_tmp~0=v_~x$mem_tmp~0_7, ~x~0=v_~x~0_22, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_9|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[~x$flush_delayed~0, ~x~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 21:49:33,886 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [676] [676] 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 21:49:33,970 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 09:49:33 BasicIcfg [2019-12-18 21:49:33,971 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 21:49:33,973 INFO L168 Benchmark]: Toolchain (without parser) took 13658.52 ms. Allocated memory was 143.1 MB in the beginning and 434.6 MB in the end (delta: 291.5 MB). Free memory was 99.1 MB in the beginning and 327.0 MB in the end (delta: -227.9 MB). Peak memory consumption was 352.7 MB. Max. memory is 7.1 GB. [2019-12-18 21:49:33,973 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 143.1 MB. Free memory was 119.5 MB in the beginning and 119.2 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-18 21:49:33,974 INFO L168 Benchmark]: CACSL2BoogieTranslator took 817.55 ms. Allocated memory was 143.1 MB in the beginning and 200.3 MB in the end (delta: 57.1 MB). Free memory was 98.7 MB in the beginning and 152.6 MB in the end (delta: -53.9 MB). Peak memory consumption was 20.4 MB. Max. memory is 7.1 GB. [2019-12-18 21:49:33,975 INFO L168 Benchmark]: Boogie Procedure Inliner took 63.64 ms. Allocated memory is still 200.3 MB. Free memory was 152.6 MB in the beginning and 149.6 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 7.1 GB. [2019-12-18 21:49:33,976 INFO L168 Benchmark]: Boogie Preprocessor took 36.63 ms. Allocated memory is still 200.3 MB. Free memory was 149.6 MB in the beginning and 147.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-12-18 21:49:33,976 INFO L168 Benchmark]: RCFGBuilder took 782.69 ms. Allocated memory is still 200.3 MB. Free memory was 147.5 MB in the beginning and 102.8 MB in the end (delta: 44.6 MB). Peak memory consumption was 44.6 MB. Max. memory is 7.1 GB. [2019-12-18 21:49:33,977 INFO L168 Benchmark]: TraceAbstraction took 11952.03 ms. Allocated memory was 200.3 MB in the beginning and 434.6 MB in the end (delta: 234.4 MB). Free memory was 102.1 MB in the beginning and 327.0 MB in the end (delta: -224.9 MB). Peak memory consumption was 298.6 MB. Max. memory is 7.1 GB. [2019-12-18 21:49:33,981 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.17 ms. Allocated memory is still 143.1 MB. Free memory was 119.5 MB in the beginning and 119.2 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 817.55 ms. Allocated memory was 143.1 MB in the beginning and 200.3 MB in the end (delta: 57.1 MB). Free memory was 98.7 MB in the beginning and 152.6 MB in the end (delta: -53.9 MB). Peak memory consumption was 20.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 63.64 ms. Allocated memory is still 200.3 MB. Free memory was 152.6 MB in the beginning and 149.6 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 36.63 ms. Allocated memory is still 200.3 MB. Free memory was 149.6 MB in the beginning and 147.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 782.69 ms. Allocated memory is still 200.3 MB. Free memory was 147.5 MB in the beginning and 102.8 MB in the end (delta: 44.6 MB). Peak memory consumption was 44.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 11952.03 ms. Allocated memory was 200.3 MB in the beginning and 434.6 MB in the end (delta: 234.4 MB). Free memory was 102.1 MB in the beginning and 327.0 MB in the end (delta: -224.9 MB). Peak memory consumption was 298.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.1s, 146 ProgramPointsBefore, 80 ProgramPointsAfterwards, 180 TransitionsBefore, 93 TransitionsAfterwards, 10378 CoEnabledTransitionPairs, 7 FixpointIterations, 28 TrivialSequentialCompositions, 34 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 35 ConcurrentYvCompositions, 24 ChoiceCompositions, 3674 VarBasedMoverChecksPositive, 148 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 48801 CheckedPairsTotal, 97 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(&t1455, ((void *)0), P0, ((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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L781] FCALL, FORK 0 pthread_create(&t1456, ((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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L747] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L748] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L749] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L750] 2 x$r_buff0_thd2 = (_Bool)1 [L753] 2 __unbuffered_p1_EAX = 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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L756] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L722] 1 y = 1 [L725] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L728] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L728] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L729] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L730] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L756] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L757] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L731] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L758] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L787] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L787] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L788] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L789] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L790] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L791] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L794] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L795] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L796] 0 x$flush_delayed = weak$$choice2 [L797] 0 x$mem_tmp = x VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L798] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L798] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L799] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L799] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L800] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L801] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L801] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L802] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L802] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L804] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L804] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L805] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 140 locations, 2 error locations. Result: UNSAFE, OverallTime: 11.6s, OverallIterations: 13, TraceHistogramMax: 1, AutomataDifference: 4.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1158 SDtfs, 1191 SDslu, 3242 SDs, 0 SdLazy, 2427 SolverSat, 115 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 127 GetRequests, 14 SyntacticMatches, 14 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 385 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=9180occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 12 MinimizatonAttempts, 960 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 529 NumberOfCodeBlocks, 529 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 463 ConstructedInterpolants, 0 QuantifiedInterpolants, 111207 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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...