/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix033_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 13:17:07,931 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 13:17:07,933 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 13:17:07,945 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 13:17:07,945 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 13:17:07,946 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 13:17:07,947 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 13:17:07,949 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 13:17:07,951 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 13:17:07,952 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 13:17:07,953 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 13:17:07,954 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 13:17:07,954 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 13:17:07,955 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 13:17:07,956 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 13:17:07,957 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 13:17:07,958 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 13:17:07,959 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 13:17:07,961 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 13:17:07,963 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 13:17:07,965 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 13:17:07,966 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 13:17:07,967 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 13:17:07,968 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 13:17:07,970 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 13:17:07,970 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 13:17:07,970 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 13:17:07,971 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 13:17:07,972 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 13:17:07,973 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 13:17:07,973 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 13:17:07,973 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 13:17:07,974 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 13:17:07,975 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 13:17:07,976 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 13:17:07,976 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 13:17:07,977 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 13:17:07,977 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 13:17:07,977 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 13:17:07,978 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 13:17:07,979 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 13:17:07,979 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-18 13:17:07,994 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 13:17:07,994 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 13:17:07,995 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 13:17:07,995 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 13:17:07,995 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 13:17:07,996 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 13:17:07,996 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 13:17:07,996 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 13:17:07,996 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 13:17:07,996 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 13:17:07,997 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 13:17:07,997 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 13:17:07,997 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 13:17:07,997 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 13:17:07,997 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 13:17:07,998 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 13:17:07,998 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 13:17:07,998 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 13:17:07,998 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 13:17:07,998 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 13:17:07,999 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 13:17:07,999 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 13:17:07,999 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 13:17:07,999 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 13:17:07,999 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 13:17:08,000 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 13:17:08,000 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 13:17:08,000 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 13:17:08,000 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-18 13:17:08,000 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 13:17:08,261 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 13:17:08,276 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 13:17:08,281 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 13:17:08,282 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 13:17:08,283 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 13:17:08,284 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix033_tso.oepc.i [2019-12-18 13:17:08,361 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec6bf8ec7/d62a84ff23b54c31a8ea9643b6ca29b8/FLAG104b13e5c [2019-12-18 13:17:08,944 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 13:17:08,944 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix033_tso.oepc.i [2019-12-18 13:17:08,969 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec6bf8ec7/d62a84ff23b54c31a8ea9643b6ca29b8/FLAG104b13e5c [2019-12-18 13:17:09,283 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec6bf8ec7/d62a84ff23b54c31a8ea9643b6ca29b8 [2019-12-18 13:17:09,293 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 13:17:09,295 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 13:17:09,296 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 13:17:09,297 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 13:17:09,300 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 13:17:09,301 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 01:17:09" (1/1) ... [2019-12-18 13:17:09,304 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51df9b38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:17:09, skipping insertion in model container [2019-12-18 13:17:09,304 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 01:17:09" (1/1) ... [2019-12-18 13:17:09,313 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 13:17:09,377 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 13:17:09,976 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 13:17:09,997 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 13:17:10,068 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 13:17:10,156 INFO L208 MainTranslator]: Completed translation [2019-12-18 13:17:10,156 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:17:10 WrapperNode [2019-12-18 13:17:10,156 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 13:17:10,157 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 13:17:10,157 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 13:17:10,157 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 13:17:10,166 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:17:10" (1/1) ... [2019-12-18 13:17:10,189 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:17:10" (1/1) ... [2019-12-18 13:17:10,234 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 13:17:10,235 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 13:17:10,235 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 13:17:10,235 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 13:17:10,244 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:17:10" (1/1) ... [2019-12-18 13:17:10,244 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:17:10" (1/1) ... [2019-12-18 13:17:10,249 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:17:10" (1/1) ... [2019-12-18 13:17:10,250 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:17:10" (1/1) ... [2019-12-18 13:17:10,260 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:17:10" (1/1) ... [2019-12-18 13:17:10,265 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:17:10" (1/1) ... [2019-12-18 13:17:10,269 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:17:10" (1/1) ... [2019-12-18 13:17:10,274 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 13:17:10,275 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 13:17:10,275 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 13:17:10,275 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 13:17:10,276 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:17:10" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 13:17:10,346 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 13:17:10,347 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 13:17:10,347 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 13:17:10,347 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 13:17:10,347 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 13:17:10,347 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 13:17:10,348 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 13:17:10,348 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 13:17:10,348 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 13:17:10,348 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 13:17:10,349 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 13:17:10,349 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 13:17:10,349 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 13:17:10,351 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 13:17:11,160 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 13:17:11,161 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 13:17:11,162 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 01:17:11 BoogieIcfgContainer [2019-12-18 13:17:11,162 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 13:17:11,164 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 13:17:11,164 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 13:17:11,167 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 13:17:11,168 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 01:17:09" (1/3) ... [2019-12-18 13:17:11,168 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34207651 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 01:17:11, skipping insertion in model container [2019-12-18 13:17:11,169 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:17:10" (2/3) ... [2019-12-18 13:17:11,169 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34207651 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 01:17:11, skipping insertion in model container [2019-12-18 13:17:11,169 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 01:17:11" (3/3) ... [2019-12-18 13:17:11,171 INFO L109 eAbstractionObserver]: Analyzing ICFG mix033_tso.oepc.i [2019-12-18 13:17:11,182 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 13:17:11,182 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 13:17:11,190 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 13:17:11,191 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 13:17:11,229 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:11,229 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:11,230 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:11,230 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:11,230 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:11,230 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:11,231 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:11,231 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:11,231 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:11,232 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:11,232 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:11,232 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:11,232 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:11,233 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:11,233 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:11,233 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:11,233 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:11,248 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:11,249 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:11,249 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:11,249 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:11,250 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:11,250 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:11,250 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:11,250 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:11,251 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:11,253 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:11,254 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:11,254 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:11,255 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:11,257 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:11,257 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:11,257 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:11,258 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:11,258 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:11,258 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:11,260 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:11,260 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:11,261 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:11,262 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:11,262 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:11,262 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:11,263 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:11,263 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:11,263 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:11,263 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:11,264 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:11,264 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:11,264 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:11,264 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:11,264 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:11,265 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:11,265 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:11,265 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:11,265 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:11,265 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:11,266 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:11,266 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:11,266 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:11,267 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:11,267 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:11,267 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:11,268 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:11,268 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:11,270 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:11,270 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:11,270 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:11,271 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:11,271 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:11,271 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:11,271 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:11,271 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:11,272 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:11,272 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:11,272 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:11,273 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:11,273 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:11,273 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:11,273 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:11,273 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:11,274 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:11,275 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:11,275 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:11,275 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:11,275 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:11,276 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:11,276 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:11,277 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:11,277 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:11,277 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:11,277 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:11,277 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:11,278 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:11,278 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:11,283 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:11,283 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:11,283 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:11,284 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:11,284 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:11,284 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:11,284 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:11,285 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:11,288 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:11,289 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:11,291 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:11,292 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:11,299 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:11,300 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:11,300 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:11,300 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:11,300 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:11,300 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:11,300 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:11,300 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:11,305 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:11,305 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:11,305 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:11,305 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:11,305 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:11,306 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:11,306 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:11,306 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:11,306 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:11,306 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:11,307 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:11,307 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:11,321 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 13:17:11,341 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 13:17:11,341 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 13:17:11,341 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 13:17:11,341 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 13:17:11,342 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 13:17:11,342 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 13:17:11,342 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 13:17:11,342 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 13:17:11,358 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 179 places, 216 transitions [2019-12-18 13:17:11,360 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 179 places, 216 transitions [2019-12-18 13:17:11,471 INFO L126 PetriNetUnfolder]: 47/213 cut-off events. [2019-12-18 13:17:11,472 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 13:17:11,490 INFO L76 FinitePrefix]: Finished finitePrefix Result has 223 conditions, 213 events. 47/213 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 335 event pairs. 9/173 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 13:17:11,518 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 179 places, 216 transitions [2019-12-18 13:17:11,564 INFO L126 PetriNetUnfolder]: 47/213 cut-off events. [2019-12-18 13:17:11,565 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 13:17:11,574 INFO L76 FinitePrefix]: Finished finitePrefix Result has 223 conditions, 213 events. 47/213 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 335 event pairs. 9/173 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 13:17:11,597 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 17074 [2019-12-18 13:17:11,599 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 13:17:16,914 WARN L192 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 95 [2019-12-18 13:17:17,060 WARN L192 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2019-12-18 13:17:17,091 INFO L206 etLargeBlockEncoding]: Checked pairs total: 82137 [2019-12-18 13:17:17,091 INFO L214 etLargeBlockEncoding]: Total number of compositions: 118 [2019-12-18 13:17:17,095 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 92 places, 99 transitions [2019-12-18 13:17:32,794 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 102312 states. [2019-12-18 13:17:32,796 INFO L276 IsEmpty]: Start isEmpty. Operand 102312 states. [2019-12-18 13:17:32,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-18 13:17:32,802 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:17:32,803 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-18 13:17:32,803 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:17:32,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:17:32,810 INFO L82 PathProgramCache]: Analyzing trace with hash 830375313, now seen corresponding path program 1 times [2019-12-18 13:17:32,818 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:17:32,819 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218087264] [2019-12-18 13:17:32,819 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:17:32,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:17:33,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:17:33,050 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218087264] [2019-12-18 13:17:33,051 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:17:33,051 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 13:17:33,052 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773256991] [2019-12-18 13:17:33,056 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:17:33,057 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:17:33,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:17:33,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:17:33,075 INFO L87 Difference]: Start difference. First operand 102312 states. Second operand 3 states. [2019-12-18 13:17:34,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:17:34,493 INFO L93 Difference]: Finished difference Result 102012 states and 430324 transitions. [2019-12-18 13:17:34,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:17:34,495 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-18 13:17:34,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:17:35,308 INFO L225 Difference]: With dead ends: 102012 [2019-12-18 13:17:35,308 INFO L226 Difference]: Without dead ends: 99828 [2019-12-18 13:17:35,310 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:17:41,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99828 states. [2019-12-18 13:17:46,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99828 to 99828. [2019-12-18 13:17:46,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99828 states. [2019-12-18 13:17:46,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99828 states to 99828 states and 421406 transitions. [2019-12-18 13:17:46,808 INFO L78 Accepts]: Start accepts. Automaton has 99828 states and 421406 transitions. Word has length 5 [2019-12-18 13:17:46,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:17:46,809 INFO L462 AbstractCegarLoop]: Abstraction has 99828 states and 421406 transitions. [2019-12-18 13:17:46,809 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:17:46,809 INFO L276 IsEmpty]: Start isEmpty. Operand 99828 states and 421406 transitions. [2019-12-18 13:17:46,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 13:17:46,819 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:17:46,819 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:17:46,820 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:17:46,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:17:46,820 INFO L82 PathProgramCache]: Analyzing trace with hash 1614971329, now seen corresponding path program 1 times [2019-12-18 13:17:46,820 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:17:46,821 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898815302] [2019-12-18 13:17:46,821 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:17:46,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:17:47,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:17:47,009 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898815302] [2019-12-18 13:17:47,009 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:17:47,009 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:17:47,010 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310536073] [2019-12-18 13:17:47,011 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 13:17:47,011 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:17:47,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 13:17:47,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:17:47,012 INFO L87 Difference]: Start difference. First operand 99828 states and 421406 transitions. Second operand 4 states. [2019-12-18 13:17:52,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:17:52,133 INFO L93 Difference]: Finished difference Result 160374 states and 648740 transitions. [2019-12-18 13:17:52,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 13:17:52,134 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 13:17:52,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:17:52,706 INFO L225 Difference]: With dead ends: 160374 [2019-12-18 13:17:52,706 INFO L226 Difference]: Without dead ends: 160325 [2019-12-18 13:17:52,707 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:17:56,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160325 states. [2019-12-18 13:18:00,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160325 to 147565. [2019-12-18 13:18:00,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147565 states. [2019-12-18 13:18:00,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147565 states to 147565 states and 602627 transitions. [2019-12-18 13:18:00,876 INFO L78 Accepts]: Start accepts. Automaton has 147565 states and 602627 transitions. Word has length 11 [2019-12-18 13:18:00,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:18:00,877 INFO L462 AbstractCegarLoop]: Abstraction has 147565 states and 602627 transitions. [2019-12-18 13:18:00,877 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 13:18:00,877 INFO L276 IsEmpty]: Start isEmpty. Operand 147565 states and 602627 transitions. [2019-12-18 13:18:00,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 13:18:00,881 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:18:00,881 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:18:00,881 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:18:00,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:18:00,882 INFO L82 PathProgramCache]: Analyzing trace with hash -1756735114, now seen corresponding path program 1 times [2019-12-18 13:18:00,882 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:18:00,882 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455107359] [2019-12-18 13:18:00,883 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:18:00,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:18:00,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:18:00,951 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455107359] [2019-12-18 13:18:00,952 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:18:00,952 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:18:00,952 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025260130] [2019-12-18 13:18:00,953 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:18:00,954 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:18:00,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:18:00,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:18:00,955 INFO L87 Difference]: Start difference. First operand 147565 states and 602627 transitions. Second operand 3 states. [2019-12-18 13:18:01,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:18:01,107 INFO L93 Difference]: Finished difference Result 30660 states and 98018 transitions. [2019-12-18 13:18:01,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:18:01,108 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-18 13:18:01,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:18:01,192 INFO L225 Difference]: With dead ends: 30660 [2019-12-18 13:18:01,192 INFO L226 Difference]: Without dead ends: 30660 [2019-12-18 13:18:01,193 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 13:18:01,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30660 states. [2019-12-18 13:18:06,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30660 to 30660. [2019-12-18 13:18:06,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30660 states. [2019-12-18 13:18:06,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30660 states to 30660 states and 98018 transitions. [2019-12-18 13:18:06,406 INFO L78 Accepts]: Start accepts. Automaton has 30660 states and 98018 transitions. Word has length 13 [2019-12-18 13:18:06,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:18:06,407 INFO L462 AbstractCegarLoop]: Abstraction has 30660 states and 98018 transitions. [2019-12-18 13:18:06,407 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:18:06,407 INFO L276 IsEmpty]: Start isEmpty. Operand 30660 states and 98018 transitions. [2019-12-18 13:18:06,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 13:18:06,409 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:18:06,409 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:18:06,410 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:18:06,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:18:06,410 INFO L82 PathProgramCache]: Analyzing trace with hash -781051858, now seen corresponding path program 1 times [2019-12-18 13:18:06,410 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:18:06,412 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134532609] [2019-12-18 13:18:06,412 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:18:06,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:18:06,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:18:06,519 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134532609] [2019-12-18 13:18:06,519 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:18:06,520 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:18:06,520 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993437104] [2019-12-18 13:18:06,520 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 13:18:06,520 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:18:06,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 13:18:06,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:18:06,521 INFO L87 Difference]: Start difference. First operand 30660 states and 98018 transitions. Second operand 4 states. [2019-12-18 13:18:06,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:18:06,936 INFO L93 Difference]: Finished difference Result 41073 states and 128391 transitions. [2019-12-18 13:18:06,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 13:18:06,936 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-18 13:18:06,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:18:07,010 INFO L225 Difference]: With dead ends: 41073 [2019-12-18 13:18:07,010 INFO L226 Difference]: Without dead ends: 41066 [2019-12-18 13:18:07,011 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:18:07,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41066 states. [2019-12-18 13:18:07,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41066 to 36091. [2019-12-18 13:18:07,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36091 states. [2019-12-18 13:18:07,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36091 states to 36091 states and 114542 transitions. [2019-12-18 13:18:07,791 INFO L78 Accepts]: Start accepts. Automaton has 36091 states and 114542 transitions. Word has length 13 [2019-12-18 13:18:07,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:18:07,791 INFO L462 AbstractCegarLoop]: Abstraction has 36091 states and 114542 transitions. [2019-12-18 13:18:07,791 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 13:18:07,791 INFO L276 IsEmpty]: Start isEmpty. Operand 36091 states and 114542 transitions. [2019-12-18 13:18:07,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 13:18:07,796 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:18:07,796 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:18:07,796 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:18:07,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:18:07,796 INFO L82 PathProgramCache]: Analyzing trace with hash -1241691420, now seen corresponding path program 1 times [2019-12-18 13:18:07,796 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:18:07,797 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217349617] [2019-12-18 13:18:07,797 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:18:07,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:18:07,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:18:07,904 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217349617] [2019-12-18 13:18:07,904 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:18:07,904 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:18:07,904 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280471539] [2019-12-18 13:18:07,905 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 13:18:07,906 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:18:07,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 13:18:07,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:18:07,906 INFO L87 Difference]: Start difference. First operand 36091 states and 114542 transitions. Second operand 5 states. [2019-12-18 13:18:08,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:18:08,927 INFO L93 Difference]: Finished difference Result 48600 states and 151172 transitions. [2019-12-18 13:18:08,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 13:18:08,928 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-12-18 13:18:08,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:18:09,001 INFO L225 Difference]: With dead ends: 48600 [2019-12-18 13:18:09,001 INFO L226 Difference]: Without dead ends: 48587 [2019-12-18 13:18:09,002 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 13:18:09,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48587 states. [2019-12-18 13:18:09,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48587 to 36434. [2019-12-18 13:18:09,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36434 states. [2019-12-18 13:18:09,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36434 states to 36434 states and 115508 transitions. [2019-12-18 13:18:09,698 INFO L78 Accepts]: Start accepts. Automaton has 36434 states and 115508 transitions. Word has length 19 [2019-12-18 13:18:09,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:18:09,698 INFO L462 AbstractCegarLoop]: Abstraction has 36434 states and 115508 transitions. [2019-12-18 13:18:09,698 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 13:18:09,698 INFO L276 IsEmpty]: Start isEmpty. Operand 36434 states and 115508 transitions. [2019-12-18 13:18:09,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 13:18:09,712 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:18:09,712 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:18:09,712 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:18:09,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:18:09,712 INFO L82 PathProgramCache]: Analyzing trace with hash -1959079235, now seen corresponding path program 1 times [2019-12-18 13:18:09,713 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:18:09,713 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474985565] [2019-12-18 13:18:09,713 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:18:09,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:18:09,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:18:09,770 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474985565] [2019-12-18 13:18:09,770 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:18:09,770 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:18:09,770 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777675842] [2019-12-18 13:18:09,771 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 13:18:09,771 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:18:09,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 13:18:09,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:18:09,771 INFO L87 Difference]: Start difference. First operand 36434 states and 115508 transitions. Second operand 4 states. [2019-12-18 13:18:09,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:18:09,811 INFO L93 Difference]: Finished difference Result 7041 states and 19099 transitions. [2019-12-18 13:18:09,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 13:18:09,812 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-18 13:18:09,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:18:09,823 INFO L225 Difference]: With dead ends: 7041 [2019-12-18 13:18:09,823 INFO L226 Difference]: Without dead ends: 7041 [2019-12-18 13:18:09,824 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 13:18:09,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7041 states. [2019-12-18 13:18:09,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7041 to 6929. [2019-12-18 13:18:09,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6929 states. [2019-12-18 13:18:09,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6929 states to 6929 states and 18779 transitions. [2019-12-18 13:18:09,925 INFO L78 Accepts]: Start accepts. Automaton has 6929 states and 18779 transitions. Word has length 25 [2019-12-18 13:18:09,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:18:09,925 INFO L462 AbstractCegarLoop]: Abstraction has 6929 states and 18779 transitions. [2019-12-18 13:18:09,925 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 13:18:09,926 INFO L276 IsEmpty]: Start isEmpty. Operand 6929 states and 18779 transitions. [2019-12-18 13:18:09,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-18 13:18:09,936 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:18:09,936 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:18:09,937 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:18:09,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:18:09,937 INFO L82 PathProgramCache]: Analyzing trace with hash -1376683013, now seen corresponding path program 1 times [2019-12-18 13:18:09,937 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:18:09,938 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114086884] [2019-12-18 13:18:09,938 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:18:09,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:18:10,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:18:10,021 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114086884] [2019-12-18 13:18:10,022 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:18:10,022 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 13:18:10,022 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610074336] [2019-12-18 13:18:10,022 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 13:18:10,023 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:18:10,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 13:18:10,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:18:10,023 INFO L87 Difference]: Start difference. First operand 6929 states and 18779 transitions. Second operand 5 states. [2019-12-18 13:18:10,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:18:10,059 INFO L93 Difference]: Finished difference Result 5022 states and 14415 transitions. [2019-12-18 13:18:10,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 13:18:10,059 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2019-12-18 13:18:10,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:18:10,067 INFO L225 Difference]: With dead ends: 5022 [2019-12-18 13:18:10,067 INFO L226 Difference]: Without dead ends: 5022 [2019-12-18 13:18:10,067 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:18:10,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5022 states. [2019-12-18 13:18:10,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5022 to 4658. [2019-12-18 13:18:10,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4658 states. [2019-12-18 13:18:10,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4658 states to 4658 states and 13431 transitions. [2019-12-18 13:18:10,163 INFO L78 Accepts]: Start accepts. Automaton has 4658 states and 13431 transitions. Word has length 37 [2019-12-18 13:18:10,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:18:10,163 INFO L462 AbstractCegarLoop]: Abstraction has 4658 states and 13431 transitions. [2019-12-18 13:18:10,164 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 13:18:10,164 INFO L276 IsEmpty]: Start isEmpty. Operand 4658 states and 13431 transitions. [2019-12-18 13:18:10,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 13:18:10,173 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:18:10,173 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:18:10,173 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:18:10,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:18:10,174 INFO L82 PathProgramCache]: Analyzing trace with hash 863082331, now seen corresponding path program 1 times [2019-12-18 13:18:10,174 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:18:10,174 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358833543] [2019-12-18 13:18:10,174 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:18:10,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:18:10,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:18:10,427 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358833543] [2019-12-18 13:18:10,427 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:18:10,427 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:18:10,428 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611751495] [2019-12-18 13:18:10,428 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:18:10,428 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:18:10,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:18:10,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:18:10,429 INFO L87 Difference]: Start difference. First operand 4658 states and 13431 transitions. Second operand 3 states. [2019-12-18 13:18:10,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:18:10,492 INFO L93 Difference]: Finished difference Result 4658 states and 13430 transitions. [2019-12-18 13:18:10,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:18:10,492 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-18 13:18:10,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:18:10,502 INFO L225 Difference]: With dead ends: 4658 [2019-12-18 13:18:10,502 INFO L226 Difference]: Without dead ends: 4658 [2019-12-18 13:18:10,503 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 13:18:10,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4658 states. [2019-12-18 13:18:10,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4658 to 3633. [2019-12-18 13:18:10,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3633 states. [2019-12-18 13:18:10,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3633 states to 3633 states and 10652 transitions. [2019-12-18 13:18:10,567 INFO L78 Accepts]: Start accepts. Automaton has 3633 states and 10652 transitions. Word has length 65 [2019-12-18 13:18:10,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:18:10,568 INFO L462 AbstractCegarLoop]: Abstraction has 3633 states and 10652 transitions. [2019-12-18 13:18:10,568 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:18:10,568 INFO L276 IsEmpty]: Start isEmpty. Operand 3633 states and 10652 transitions. [2019-12-18 13:18:10,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 13:18:10,574 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:18:10,574 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:18:10,574 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:18:10,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:18:10,575 INFO L82 PathProgramCache]: Analyzing trace with hash -633612741, now seen corresponding path program 1 times [2019-12-18 13:18:10,575 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:18:10,575 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303708734] [2019-12-18 13:18:10,575 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:18:10,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:18:10,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:18:10,712 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303708734] [2019-12-18 13:18:10,712 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:18:10,712 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:18:10,712 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031864931] [2019-12-18 13:18:10,713 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:18:10,714 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:18:10,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:18:10,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:18:10,714 INFO L87 Difference]: Start difference. First operand 3633 states and 10652 transitions. Second operand 3 states. [2019-12-18 13:18:10,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:18:10,739 INFO L93 Difference]: Finished difference Result 3633 states and 10448 transitions. [2019-12-18 13:18:10,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:18:10,740 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-18 13:18:10,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:18:10,748 INFO L225 Difference]: With dead ends: 3633 [2019-12-18 13:18:10,749 INFO L226 Difference]: Without dead ends: 3633 [2019-12-18 13:18:10,749 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 13:18:10,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3633 states. [2019-12-18 13:18:10,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3633 to 3473. [2019-12-18 13:18:10,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3473 states. [2019-12-18 13:18:10,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3473 states to 3473 states and 10004 transitions. [2019-12-18 13:18:10,841 INFO L78 Accepts]: Start accepts. Automaton has 3473 states and 10004 transitions. Word has length 66 [2019-12-18 13:18:10,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:18:10,842 INFO L462 AbstractCegarLoop]: Abstraction has 3473 states and 10004 transitions. [2019-12-18 13:18:10,842 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:18:10,842 INFO L276 IsEmpty]: Start isEmpty. Operand 3473 states and 10004 transitions. [2019-12-18 13:18:10,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 13:18:10,852 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:18:10,853 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:18:10,853 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:18:10,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:18:10,853 INFO L82 PathProgramCache]: Analyzing trace with hash 2114787906, now seen corresponding path program 1 times [2019-12-18 13:18:10,854 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:18:10,854 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858562278] [2019-12-18 13:18:10,854 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:18:10,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:18:10,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:18:10,986 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858562278] [2019-12-18 13:18:10,986 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:18:10,986 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:18:10,987 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053065562] [2019-12-18 13:18:10,988 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:18:10,989 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:18:10,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:18:10,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:18:10,989 INFO L87 Difference]: Start difference. First operand 3473 states and 10004 transitions. Second operand 3 states. [2019-12-18 13:18:11,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:18:11,015 INFO L93 Difference]: Finished difference Result 3301 states and 9333 transitions. [2019-12-18 13:18:11,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:18:11,015 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-12-18 13:18:11,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:18:11,020 INFO L225 Difference]: With dead ends: 3301 [2019-12-18 13:18:11,021 INFO L226 Difference]: Without dead ends: 3301 [2019-12-18 13:18:11,021 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 13:18:11,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3301 states. [2019-12-18 13:18:11,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3301 to 2981. [2019-12-18 13:18:11,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2981 states. [2019-12-18 13:18:11,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2981 states to 2981 states and 8445 transitions. [2019-12-18 13:18:11,088 INFO L78 Accepts]: Start accepts. Automaton has 2981 states and 8445 transitions. Word has length 67 [2019-12-18 13:18:11,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:18:11,088 INFO L462 AbstractCegarLoop]: Abstraction has 2981 states and 8445 transitions. [2019-12-18 13:18:11,088 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:18:11,088 INFO L276 IsEmpty]: Start isEmpty. Operand 2981 states and 8445 transitions. [2019-12-18 13:18:11,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-18 13:18:11,094 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:18:11,094 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:18:11,094 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:18:11,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:18:11,095 INFO L82 PathProgramCache]: Analyzing trace with hash 1583995874, now seen corresponding path program 1 times [2019-12-18 13:18:11,095 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:18:11,095 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925627161] [2019-12-18 13:18:11,096 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:18:11,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:18:11,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:18:11,477 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925627161] [2019-12-18 13:18:11,477 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:18:11,477 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-18 13:18:11,478 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700047858] [2019-12-18 13:18:11,478 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-18 13:18:11,478 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:18:11,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-18 13:18:11,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2019-12-18 13:18:11,479 INFO L87 Difference]: Start difference. First operand 2981 states and 8445 transitions. Second operand 14 states. [2019-12-18 13:18:12,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:18:12,512 INFO L93 Difference]: Finished difference Result 6692 states and 18955 transitions. [2019-12-18 13:18:12,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-18 13:18:12,512 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 68 [2019-12-18 13:18:12,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:18:12,522 INFO L225 Difference]: With dead ends: 6692 [2019-12-18 13:18:12,522 INFO L226 Difference]: Without dead ends: 6666 [2019-12-18 13:18:12,523 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=169, Invalid=761, Unknown=0, NotChecked=0, Total=930 [2019-12-18 13:18:12,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6666 states. [2019-12-18 13:18:12,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6666 to 4756. [2019-12-18 13:18:12,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4756 states. [2019-12-18 13:18:12,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4756 states to 4756 states and 13434 transitions. [2019-12-18 13:18:12,595 INFO L78 Accepts]: Start accepts. Automaton has 4756 states and 13434 transitions. Word has length 68 [2019-12-18 13:18:12,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:18:12,596 INFO L462 AbstractCegarLoop]: Abstraction has 4756 states and 13434 transitions. [2019-12-18 13:18:12,596 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-18 13:18:12,596 INFO L276 IsEmpty]: Start isEmpty. Operand 4756 states and 13434 transitions. [2019-12-18 13:18:12,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-18 13:18:12,602 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:18:12,603 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:18:12,603 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:18:12,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:18:12,603 INFO L82 PathProgramCache]: Analyzing trace with hash -1734168910, now seen corresponding path program 2 times [2019-12-18 13:18:12,603 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:18:12,603 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124494367] [2019-12-18 13:18:12,603 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:18:12,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:18:12,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:18:12,800 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124494367] [2019-12-18 13:18:12,801 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:18:12,801 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 13:18:12,801 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127244667] [2019-12-18 13:18:12,801 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 13:18:12,802 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:18:12,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 13:18:12,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-12-18 13:18:12,802 INFO L87 Difference]: Start difference. First operand 4756 states and 13434 transitions. Second operand 12 states. [2019-12-18 13:18:13,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:18:13,283 INFO L93 Difference]: Finished difference Result 7879 states and 22036 transitions. [2019-12-18 13:18:13,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-18 13:18:13,283 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 68 [2019-12-18 13:18:13,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:18:13,293 INFO L225 Difference]: With dead ends: 7879 [2019-12-18 13:18:13,294 INFO L226 Difference]: Without dead ends: 7855 [2019-12-18 13:18:13,294 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=113, Invalid=439, Unknown=0, NotChecked=0, Total=552 [2019-12-18 13:18:13,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7855 states. [2019-12-18 13:18:13,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7855 to 4884. [2019-12-18 13:18:13,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4884 states. [2019-12-18 13:18:13,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4884 states to 4884 states and 13791 transitions. [2019-12-18 13:18:13,376 INFO L78 Accepts]: Start accepts. Automaton has 4884 states and 13791 transitions. Word has length 68 [2019-12-18 13:18:13,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:18:13,377 INFO L462 AbstractCegarLoop]: Abstraction has 4884 states and 13791 transitions. [2019-12-18 13:18:13,377 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 13:18:13,377 INFO L276 IsEmpty]: Start isEmpty. Operand 4884 states and 13791 transitions. [2019-12-18 13:18:13,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-18 13:18:13,384 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:18:13,384 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:18:13,384 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:18:13,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:18:13,384 INFO L82 PathProgramCache]: Analyzing trace with hash 1138948950, now seen corresponding path program 3 times [2019-12-18 13:18:13,384 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:18:13,384 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62958550] [2019-12-18 13:18:13,385 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:18:13,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:18:13,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:18:13,727 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62958550] [2019-12-18 13:18:13,727 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:18:13,727 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 13:18:13,728 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529806710] [2019-12-18 13:18:13,728 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-18 13:18:13,728 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:18:13,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-18 13:18:13,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2019-12-18 13:18:13,729 INFO L87 Difference]: Start difference. First operand 4884 states and 13791 transitions. Second operand 15 states. [2019-12-18 13:18:14,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:18:14,796 INFO L93 Difference]: Finished difference Result 8025 states and 22481 transitions. [2019-12-18 13:18:14,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-18 13:18:14,797 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 68 [2019-12-18 13:18:14,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:18:14,808 INFO L225 Difference]: With dead ends: 8025 [2019-12-18 13:18:14,808 INFO L226 Difference]: Without dead ends: 7999 [2019-12-18 13:18:14,813 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=169, Invalid=761, Unknown=0, NotChecked=0, Total=930 [2019-12-18 13:18:14,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7999 states. [2019-12-18 13:18:15,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7999 to 4849. [2019-12-18 13:18:15,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4849 states. [2019-12-18 13:18:15,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4849 states to 4849 states and 13625 transitions. [2019-12-18 13:18:15,019 INFO L78 Accepts]: Start accepts. Automaton has 4849 states and 13625 transitions. Word has length 68 [2019-12-18 13:18:15,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:18:15,020 INFO L462 AbstractCegarLoop]: Abstraction has 4849 states and 13625 transitions. [2019-12-18 13:18:15,020 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-18 13:18:15,020 INFO L276 IsEmpty]: Start isEmpty. Operand 4849 states and 13625 transitions. [2019-12-18 13:18:15,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-18 13:18:15,026 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:18:15,026 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:18:15,027 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:18:15,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:18:15,027 INFO L82 PathProgramCache]: Analyzing trace with hash 1526775698, now seen corresponding path program 4 times [2019-12-18 13:18:15,027 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:18:15,027 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485668441] [2019-12-18 13:18:15,027 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:18:15,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:18:15,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:18:15,279 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485668441] [2019-12-18 13:18:15,279 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:18:15,280 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 13:18:15,280 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813708471] [2019-12-18 13:18:15,280 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 13:18:15,280 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:18:15,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 13:18:15,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-12-18 13:18:15,281 INFO L87 Difference]: Start difference. First operand 4849 states and 13625 transitions. Second operand 12 states. [2019-12-18 13:18:15,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:18:15,760 INFO L93 Difference]: Finished difference Result 7828 states and 21856 transitions. [2019-12-18 13:18:15,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-18 13:18:15,761 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 68 [2019-12-18 13:18:15,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:18:15,772 INFO L225 Difference]: With dead ends: 7828 [2019-12-18 13:18:15,772 INFO L226 Difference]: Without dead ends: 7802 [2019-12-18 13:18:15,772 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=342, Unknown=0, NotChecked=0, Total=420 [2019-12-18 13:18:15,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7802 states. [2019-12-18 13:18:15,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7802 to 4903. [2019-12-18 13:18:15,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4903 states. [2019-12-18 13:18:15,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4903 states to 4903 states and 13778 transitions. [2019-12-18 13:18:15,851 INFO L78 Accepts]: Start accepts. Automaton has 4903 states and 13778 transitions. Word has length 68 [2019-12-18 13:18:15,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:18:15,851 INFO L462 AbstractCegarLoop]: Abstraction has 4903 states and 13778 transitions. [2019-12-18 13:18:15,851 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 13:18:15,851 INFO L276 IsEmpty]: Start isEmpty. Operand 4903 states and 13778 transitions. [2019-12-18 13:18:15,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-18 13:18:15,858 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:18:15,858 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:18:15,858 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:18:15,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:18:15,859 INFO L82 PathProgramCache]: Analyzing trace with hash 829115294, now seen corresponding path program 5 times [2019-12-18 13:18:15,859 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:18:15,859 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853306995] [2019-12-18 13:18:15,859 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:18:15,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 13:18:15,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 13:18:16,038 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 13:18:16,038 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 13:18:16,043 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [845] [845] ULTIMATE.startENTRY-->L827: Formula: (let ((.cse0 (store |v_#valid_64| 0 0))) (and (= (store |v_#length_22| |v_ULTIMATE.start_main_~#t891~0.base_24| 4) |v_#length_21|) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t891~0.base_24|) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t891~0.base_24|)) (= 0 v_~__unbuffered_p1_EAX~0_77) (= v_~__unbuffered_cnt~0_133 0) (= 0 |v_ULTIMATE.start_main_~#t891~0.offset_17|) (= |v_#NULL.offset_7| 0) (= 0 v_~x~0_162) (= v_~a~0_11 0) (= v_~x$r_buff1_thd0~0_242 0) (= v_~x$mem_tmp~0_19 0) (= v_~x$r_buff1_thd1~0_183 0) (= 0 v_~x$r_buff1_thd2~0_137) (= 0 v_~x$r_buff0_thd2~0_211) (= |v_#valid_62| (store .cse0 |v_ULTIMATE.start_main_~#t891~0.base_24| 1)) (= v_~main$tmp_guard0~0_27 0) (= v_~x$r_buff0_thd0~0_328 0) (= v_~main$tmp_guard1~0_21 0) (< 0 |v_#StackHeapBarrier_17|) (= v_~y~0_70 0) (= 0 v_~x$r_buff0_thd3~0_142) (= 0 v_~weak$$choice2~0_94) (= 0 v_~x$read_delayed_var~0.base_8) (= 0 v_~x$w_buff0~0_417) (= v_~x$r_buff0_thd1~0_166 0) (= v_~x$flush_delayed~0_36 0) (= 0 v_~x$read_delayed~0_8) (= 0 v_~x$r_buff1_thd3~0_132) (= 0 v_~x$read_delayed_var~0.offset_8) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t891~0.base_24| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t891~0.base_24|) |v_ULTIMATE.start_main_~#t891~0.offset_17| 0)) |v_#memory_int_17|) (= 0 |v_#NULL.base_7|) (= 0 v_~x$w_buff1_used~0_523) (= 0 v_~weak$$choice0~0_13) (= v_~b~0_19 0) (= v_~__unbuffered_p2_EBX~0_19 0) (= v_~z~0_71 0) (= 0 v_~__unbuffered_p2_EAX~0_20) (= v_~__unbuffered_p1_EBX~0_78 0) (= 0 v_~x$w_buff1~0_278) (= 0 v_~x$w_buff0_used~0_807))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_18|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_#t~nondet30=|v_ULTIMATE.start_main_#t~nondet30_19|, ~x$w_buff0~0=v_~x$w_buff0~0_417, ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_39|, ~x$flush_delayed~0=v_~x$flush_delayed~0_36, ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_37|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_24|, #NULL.offset=|v_#NULL.offset_7|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_29|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_33|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_183, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_142, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_43|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_23|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_27|, ~a~0=v_~a~0_11, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_34|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_77, #length=|v_#length_21|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_20, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_328, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_19, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_7|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_36|, ~x$w_buff1~0=v_~x$w_buff1~0_278, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_25|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_523, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_137, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_30|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_77|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_8, ~weak$$choice0~0=v_~weak$$choice0~0_13, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_142|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_133, ~x~0=v_~x~0_162, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_166, ULTIMATE.start_main_#t~nondet31=|v_ULTIMATE.start_main_#t~nondet31_19|, ULTIMATE.start_main_~#t893~0.base=|v_ULTIMATE.start_main_~#t893~0.base_18|, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_29|, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_27|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_24|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_132, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_21, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_109|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_20|, ~x$mem_tmp~0=v_~x$mem_tmp~0_19, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_86|, ULTIMATE.start_main_~#t891~0.offset=|v_ULTIMATE.start_main_~#t891~0.offset_17|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_35|, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_33|, ~y~0=v_~y~0_70, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_8|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_78, ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_23|, ULTIMATE.start_main_~#t891~0.base=|v_ULTIMATE.start_main_~#t891~0.base_24|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_24|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_34|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_27, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_242, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_211, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_43|, ULTIMATE.start_main_~#t893~0.offset=|v_ULTIMATE.start_main_~#t893~0.offset_14|, #NULL.base=|v_#NULL.base_7|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_21|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_807, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_84|, ULTIMATE.start_main_~#t892~0.base=|v_ULTIMATE.start_main_~#t892~0.base_20|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_8, ~b~0=v_~b~0_19, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_17|, #valid=|v_#valid_62|, #memory_int=|v_#memory_int_17|, ~z~0=v_~z~0_71, ULTIMATE.start_main_~#t892~0.offset=|v_ULTIMATE.start_main_~#t892~0.offset_15|, ~weak$$choice2~0=v_~weak$$choice2~0_94, ~x$read_delayed~0=v_~x$read_delayed~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet30, ~x$w_buff0~0, ULTIMATE.start_main_#t~ite28, ~x$flush_delayed~0, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite49, ~x$r_buff1_thd1~0, ~x$r_buff0_thd3~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite50, ~a~0, ULTIMATE.start_main_#t~ite52, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~x$r_buff0_thd0~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~nondet22, ULTIMATE.start_main_#t~ite39, ~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~ite33, ~x$read_delayed_var~0.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~__unbuffered_cnt~0, ~x~0, ~x$r_buff0_thd1~0, ULTIMATE.start_main_#t~nondet31, ULTIMATE.start_main_~#t893~0.base, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_#t~ite25, ULTIMATE.start_main_#t~ite46, ~x$r_buff1_thd3~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite48, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_~#t891~0.offset, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite51, ~y~0, ULTIMATE.start_main_#t~nondet21, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~nondet23, ULTIMATE.start_main_~#t891~0.base, 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, ULTIMATE.start_main_~#t893~0.offset, #NULL.base, ULTIMATE.start_main_#t~ite34, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_~#t892~0.base, ~x$read_delayed_var~0.offset, ~b~0, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ULTIMATE.start_main_~#t892~0.offset, ~weak$$choice2~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-18 13:18:16,044 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [794] [794] L827-1-->L829: Formula: (and (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t892~0.base_10| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t892~0.base_10|) |v_ULTIMATE.start_main_~#t892~0.offset_10| 1))) (= 0 (select |v_#valid_30| |v_ULTIMATE.start_main_~#t892~0.base_10|)) (not (= |v_ULTIMATE.start_main_~#t892~0.base_10| 0)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t892~0.base_10|) (= 0 |v_ULTIMATE.start_main_~#t892~0.offset_10|) (= |v_#valid_29| (store |v_#valid_30| |v_ULTIMATE.start_main_~#t892~0.base_10| 1)) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t892~0.base_10| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_30|, #memory_int=|v_#memory_int_10|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_~#t892~0.base=|v_ULTIMATE.start_main_~#t892~0.base_10|, #StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_5|, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_9|, #length=|v_#length_13|, ULTIMATE.start_main_~#t892~0.offset=|v_ULTIMATE.start_main_~#t892~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t892~0.base, ULTIMATE.start_main_#t~nondet21, #valid, #memory_int, #length, ULTIMATE.start_main_~#t892~0.offset] because there is no mapped edge [2019-12-18 13:18:16,045 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [818] [818] L829-1-->L831: Formula: (and (= |v_#valid_37| (store |v_#valid_38| |v_ULTIMATE.start_main_~#t893~0.base_12| 1)) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t893~0.base_12| 4)) (= |v_#memory_int_13| (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t893~0.base_12| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t893~0.base_12|) |v_ULTIMATE.start_main_~#t893~0.offset_10| 2))) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t893~0.base_12|) (= |v_ULTIMATE.start_main_~#t893~0.offset_10| 0) (not (= 0 |v_ULTIMATE.start_main_~#t893~0.base_12|)) (= 0 (select |v_#valid_38| |v_ULTIMATE.start_main_~#t893~0.base_12|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_~#t893~0.base=|v_ULTIMATE.start_main_~#t893~0.base_12|, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_5|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_13|, #length=|v_#length_17|, ULTIMATE.start_main_~#t893~0.offset=|v_ULTIMATE.start_main_~#t893~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t893~0.base, ULTIMATE.start_main_#t~nondet22, #valid, #memory_int, #length, ULTIMATE.start_main_~#t893~0.offset] because there is no mapped edge [2019-12-18 13:18:16,046 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L4-->L778: Formula: (and (= ~__unbuffered_p1_EBX~0_Out-727903060 ~z~0_In-727903060) (= ~x$r_buff1_thd0~0_Out-727903060 ~x$r_buff0_thd0~0_In-727903060) (= ~x$r_buff1_thd2~0_Out-727903060 ~x$r_buff0_thd2~0_In-727903060) (not (= P1Thread1of1ForFork2___VERIFIER_assert_~expression_In-727903060 0)) (= ~x$r_buff0_thd1~0_In-727903060 ~x$r_buff1_thd1~0_Out-727903060) (= 1 ~x$r_buff0_thd2~0_Out-727903060) (= ~y~0_Out-727903060 1) (= ~x$r_buff0_thd3~0_In-727903060 ~x$r_buff1_thd3~0_Out-727903060) (= ~__unbuffered_p1_EAX~0_Out-727903060 ~y~0_Out-727903060)) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-727903060, P1Thread1of1ForFork2___VERIFIER_assert_~expression=P1Thread1of1ForFork2___VERIFIER_assert_~expression_In-727903060, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-727903060, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-727903060, ~z~0=~z~0_In-727903060, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-727903060} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-727903060, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-727903060, ~__unbuffered_p1_EBX~0=~__unbuffered_p1_EBX~0_Out-727903060, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_Out-727903060, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_Out-727903060, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_Out-727903060, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-727903060, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out-727903060, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_Out-727903060, P1Thread1of1ForFork2___VERIFIER_assert_~expression=P1Thread1of1ForFork2___VERIFIER_assert_~expression_In-727903060, ~__unbuffered_p1_EAX~0=~__unbuffered_p1_EAX~0_Out-727903060, ~z~0=~z~0_In-727903060, ~y~0=~y~0_Out-727903060} AuxVars[] AssignedVars[~__unbuffered_p1_EBX~0, ~__unbuffered_p1_EAX~0, ~x$r_buff1_thd3~0, ~x$r_buff1_thd2~0, ~x$r_buff1_thd1~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, ~y~0] because there is no mapped edge [2019-12-18 13:18:16,047 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [784] [784] L779-->L779-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In24096044 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In24096044 256)))) (or (and (= |P1Thread1of1ForFork2_#t~ite11_Out24096044| ~x$w_buff0_used~0_In24096044) (or .cse0 .cse1)) (and (not .cse0) (= |P1Thread1of1ForFork2_#t~ite11_Out24096044| 0) (not .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In24096044, ~x$w_buff0_used~0=~x$w_buff0_used~0_In24096044} OutVars{P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out24096044|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In24096044, ~x$w_buff0_used~0=~x$w_buff0_used~0_In24096044} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-18 13:18:16,048 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] L804-2-->L804-4: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff1_used~0_In133497931 256))) (.cse0 (= 0 (mod ~x$r_buff1_thd3~0_In133497931 256)))) (or (and (or .cse0 .cse1) (= ~x~0_In133497931 |P2Thread1of1ForFork0_#t~ite15_Out133497931|)) (and (not .cse1) (not .cse0) (= |P2Thread1of1ForFork0_#t~ite15_Out133497931| ~x$w_buff1~0_In133497931)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In133497931, ~x$w_buff1_used~0=~x$w_buff1_used~0_In133497931, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In133497931, ~x~0=~x~0_In133497931} OutVars{P2Thread1of1ForFork0_#t~ite15=|P2Thread1of1ForFork0_#t~ite15_Out133497931|, ~x$w_buff1~0=~x$w_buff1~0_In133497931, ~x$w_buff1_used~0=~x$w_buff1_used~0_In133497931, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In133497931, ~x~0=~x~0_In133497931} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite15] because there is no mapped edge [2019-12-18 13:18:16,049 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [700] [700] L804-4-->L805: Formula: (= v_~x~0_17 |v_P2Thread1of1ForFork0_#t~ite15_8|) InVars {P2Thread1of1ForFork0_#t~ite15=|v_P2Thread1of1ForFork0_#t~ite15_8|} OutVars{P2Thread1of1ForFork0_#t~ite15=|v_P2Thread1of1ForFork0_#t~ite15_7|, P2Thread1of1ForFork0_#t~ite16=|v_P2Thread1of1ForFork0_#t~ite16_7|, ~x~0=v_~x~0_17} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite15, P2Thread1of1ForFork0_#t~ite16, ~x~0] because there is no mapped edge [2019-12-18 13:18:16,049 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [771] [771] L805-->L805-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd3~0_In89517784 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In89517784 256)))) (or (and (not .cse0) (= 0 |P2Thread1of1ForFork0_#t~ite17_Out89517784|) (not .cse1)) (and (or .cse1 .cse0) (= ~x$w_buff0_used~0_In89517784 |P2Thread1of1ForFork0_#t~ite17_Out89517784|)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In89517784, ~x$w_buff0_used~0=~x$w_buff0_used~0_In89517784} OutVars{P2Thread1of1ForFork0_#t~ite17=|P2Thread1of1ForFork0_#t~ite17_Out89517784|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In89517784, ~x$w_buff0_used~0=~x$w_buff0_used~0_In89517784} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite17] because there is no mapped edge [2019-12-18 13:18:16,050 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [785] [785] L806-->L806-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff1_thd3~0_In-836900464 256))) (.cse1 (= (mod ~x$w_buff1_used~0_In-836900464 256) 0)) (.cse3 (= 0 (mod ~x$r_buff0_thd3~0_In-836900464 256))) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In-836900464 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite18_Out-836900464| ~x$w_buff1_used~0_In-836900464) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= |P2Thread1of1ForFork0_#t~ite18_Out-836900464| 0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-836900464, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-836900464, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-836900464, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-836900464} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-836900464, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-836900464, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-836900464, P2Thread1of1ForFork0_#t~ite18=|P2Thread1of1ForFork0_#t~ite18_Out-836900464|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-836900464} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite18] because there is no mapped edge [2019-12-18 13:18:16,050 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [776] [776] L807-->L807-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd3~0_In1026753572 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In1026753572 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork0_#t~ite19_Out1026753572|)) (and (= |P2Thread1of1ForFork0_#t~ite19_Out1026753572| ~x$r_buff0_thd3~0_In1026753572) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1026753572, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1026753572} OutVars{~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1026753572, P2Thread1of1ForFork0_#t~ite19=|P2Thread1of1ForFork0_#t~ite19_Out1026753572|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1026753572} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite19] because there is no mapped edge [2019-12-18 13:18:16,051 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] L808-->L808-2: Formula: (let ((.cse2 (= (mod ~x$r_buff1_thd3~0_In759120870 256) 0)) (.cse3 (= (mod ~x$w_buff1_used~0_In759120870 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd3~0_In759120870 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In759120870 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork0_#t~ite20_Out759120870| 0)) (and (= |P2Thread1of1ForFork0_#t~ite20_Out759120870| ~x$r_buff1_thd3~0_In759120870) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In759120870, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In759120870, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In759120870, ~x$w_buff0_used~0=~x$w_buff0_used~0_In759120870} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In759120870, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In759120870, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In759120870, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_Out759120870|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In759120870} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite20] because there is no mapped edge [2019-12-18 13:18:16,051 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [804] [804] L808-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_80 1) v_~__unbuffered_cnt~0_79) (= |v_P2Thread1of1ForFork0_#res.base_5| 0) (= v_~x$r_buff1_thd3~0_64 |v_P2Thread1of1ForFork0_#t~ite20_36|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_80, P2Thread1of1ForFork0_#t~ite20=|v_P2Thread1of1ForFork0_#t~ite20_36|} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_64, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_79, P2Thread1of1ForFork0_#t~ite20=|v_P2Thread1of1ForFork0_#t~ite20_35|, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, ~x$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#t~ite20, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-18 13:18:16,052 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] L743-2-->L743-5: Formula: (let ((.cse0 (= |P0Thread1of1ForFork1_#t~ite3_Out1683529641| |P0Thread1of1ForFork1_#t~ite4_Out1683529641|)) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In1683529641 256))) (.cse1 (= (mod ~x$r_buff1_thd1~0_In1683529641 256) 0))) (or (and .cse0 (= |P0Thread1of1ForFork1_#t~ite3_Out1683529641| ~x$w_buff1~0_In1683529641) (not .cse1) (not .cse2)) (and .cse0 (or .cse2 .cse1) (= |P0Thread1of1ForFork1_#t~ite3_Out1683529641| ~x~0_In1683529641)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In1683529641, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1683529641, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1683529641, ~x~0=~x~0_In1683529641} OutVars{P0Thread1of1ForFork1_#t~ite4=|P0Thread1of1ForFork1_#t~ite4_Out1683529641|, P0Thread1of1ForFork1_#t~ite3=|P0Thread1of1ForFork1_#t~ite3_Out1683529641|, ~x$w_buff1~0=~x$w_buff1~0_In1683529641, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1683529641, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1683529641, ~x~0=~x~0_In1683529641} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite4, P0Thread1of1ForFork1_#t~ite3] because there is no mapped edge [2019-12-18 13:18:16,053 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [779] [779] L780-->L780-2: Formula: (let ((.cse2 (= 0 (mod ~x$w_buff0_used~0_In1030359126 256))) (.cse3 (= (mod ~x$r_buff0_thd2~0_In1030359126 256) 0)) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In1030359126 256))) (.cse1 (= 0 (mod ~x$r_buff1_thd2~0_In1030359126 256)))) (or (and (= |P1Thread1of1ForFork2_#t~ite12_Out1030359126| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= |P1Thread1of1ForFork2_#t~ite12_Out1030359126| ~x$w_buff1_used~0_In1030359126) (or .cse0 .cse1)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1030359126, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1030359126, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1030359126, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1030359126} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In1030359126, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1030359126, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out1030359126|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1030359126, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1030359126} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-18 13:18:16,053 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [783] [783] L781-->L782: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In2128157971 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd2~0_In2128157971 256) 0))) (or (and (not .cse0) (= ~x$r_buff0_thd2~0_Out2128157971 0) (not .cse1)) (and (= ~x$r_buff0_thd2~0_Out2128157971 ~x$r_buff0_thd2~0_In2128157971) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In2128157971, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2128157971} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out2128157971, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out2128157971|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2128157971} AuxVars[] AssignedVars[~x$r_buff0_thd2~0, P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-18 13:18:16,054 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [777] [777] L782-->L782-2: Formula: (let ((.cse3 (= 0 (mod ~x$r_buff1_thd2~0_In-2018979489 256))) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In-2018979489 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In-2018979489 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd2~0_In-2018979489 256) 0))) (or (and (= |P1Thread1of1ForFork2_#t~ite14_Out-2018979489| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= |P1Thread1of1ForFork2_#t~ite14_Out-2018979489| ~x$r_buff1_thd2~0_In-2018979489) (or .cse0 .cse1)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-2018979489, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-2018979489, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-2018979489, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2018979489} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-2018979489, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-2018979489, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out-2018979489|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-2018979489, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2018979489} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-18 13:18:16,054 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [788] [788] L782-2-->P1EXIT: Formula: (and (= v_~x$r_buff1_thd2~0_58 |v_P1Thread1of1ForFork2_#t~ite14_42|) (= (+ v_~__unbuffered_cnt~0_56 1) v_~__unbuffered_cnt~0_55) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_42|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_58, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_41|, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-18 13:18:16,054 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [786] [786] L744-->L744-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In1987226986 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In1987226986 256) 0))) (or (and (= ~x$w_buff0_used~0_In1987226986 |P0Thread1of1ForFork1_#t~ite5_Out1987226986|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= 0 |P0Thread1of1ForFork1_#t~ite5_Out1987226986|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1987226986, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1987226986} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out1987226986|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1987226986, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1987226986} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-18 13:18:16,055 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [768] [768] L745-->L745-2: Formula: (let ((.cse3 (= (mod ~x$w_buff0_used~0_In-955879223 256) 0)) (.cse2 (= 0 (mod ~x$r_buff0_thd1~0_In-955879223 256))) (.cse1 (= 0 (mod ~x$r_buff1_thd1~0_In-955879223 256))) (.cse0 (= (mod ~x$w_buff1_used~0_In-955879223 256) 0))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork1_#t~ite6_Out-955879223| ~x$w_buff1_used~0_In-955879223) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= 0 |P0Thread1of1ForFork1_#t~ite6_Out-955879223|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-955879223, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-955879223, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-955879223, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-955879223} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-955879223, P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out-955879223|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-955879223, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-955879223, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-955879223} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-18 13:18:16,056 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [770] [770] L746-->L746-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd1~0_In-221222228 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In-221222228 256) 0))) (or (and (= ~x$r_buff0_thd1~0_In-221222228 |P0Thread1of1ForFork1_#t~ite7_Out-221222228|) (or .cse0 .cse1)) (and (= 0 |P0Thread1of1ForFork1_#t~ite7_Out-221222228|) (not .cse0) (not .cse1)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-221222228, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-221222228} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-221222228, P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out-221222228|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-221222228} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7] because there is no mapped edge [2019-12-18 13:18:16,057 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [780] [780] L747-->L747-2: Formula: (let ((.cse3 (= 0 (mod ~x$w_buff1_used~0_In-1567516517 256))) (.cse2 (= 0 (mod ~x$r_buff1_thd1~0_In-1567516517 256))) (.cse1 (= (mod ~x$r_buff0_thd1~0_In-1567516517 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1567516517 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork1_#t~ite8_Out-1567516517|)) (and (= |P0Thread1of1ForFork1_#t~ite8_Out-1567516517| ~x$r_buff1_thd1~0_In-1567516517) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1567516517, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1567516517, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1567516517, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1567516517} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1567516517, P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out-1567516517|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1567516517, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1567516517, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1567516517} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-18 13:18:16,057 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [797] [797] L747-2-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= v_~x$r_buff1_thd1~0_67 |v_P0Thread1of1ForFork1_#t~ite8_32|) (= v_~__unbuffered_cnt~0_67 (+ v_~__unbuffered_cnt~0_68 1)) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_32|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_68} OutVars{P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_31|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_67, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_67} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0, ~x$r_buff1_thd1~0] because there is no mapped edge [2019-12-18 13:18:16,057 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L831-1-->L837: Formula: (and (= v_~main$tmp_guard0~0_9 1) (= 3 v_~__unbuffered_cnt~0_18)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18} OutVars{ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_9} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet23, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 13:18:16,058 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] L837-2-->L837-5: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In815799648 256))) (.cse0 (= (mod ~x$w_buff1_used~0_In815799648 256) 0)) (.cse2 (= |ULTIMATE.start_main_#t~ite25_Out815799648| |ULTIMATE.start_main_#t~ite24_Out815799648|))) (or (and (= ~x~0_In815799648 |ULTIMATE.start_main_#t~ite24_Out815799648|) (or .cse0 .cse1) .cse2) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite24_Out815799648| ~x$w_buff1~0_In815799648) (not .cse0) .cse2))) InVars {~x$w_buff1~0=~x$w_buff1~0_In815799648, ~x$w_buff1_used~0=~x$w_buff1_used~0_In815799648, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In815799648, ~x~0=~x~0_In815799648} OutVars{~x$w_buff1~0=~x$w_buff1~0_In815799648, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out815799648|, ULTIMATE.start_main_#t~ite25=|ULTIMATE.start_main_#t~ite25_Out815799648|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In815799648, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In815799648, ~x~0=~x~0_In815799648} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite25] because there is no mapped edge [2019-12-18 13:18:16,059 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L838-->L838-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd0~0_In-786293792 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-786293792 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite26_Out-786293792| 0)) (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In-786293792 |ULTIMATE.start_main_#t~ite26_Out-786293792|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-786293792, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-786293792} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-786293792, ULTIMATE.start_main_#t~ite26=|ULTIMATE.start_main_#t~ite26_Out-786293792|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-786293792} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite26] because there is no mapped edge [2019-12-18 13:18:16,060 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L839-->L839-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff1_used~0_In-1490742724 256))) (.cse0 (= (mod ~x$r_buff1_thd0~0_In-1490742724 256) 0)) (.cse2 (= 0 (mod ~x$r_buff0_thd0~0_In-1490742724 256))) (.cse3 (= (mod ~x$w_buff0_used~0_In-1490742724 256) 0))) (or (and (or .cse0 .cse1) (= ~x$w_buff1_used~0_In-1490742724 |ULTIMATE.start_main_#t~ite27_Out-1490742724|) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite27_Out-1490742724|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1490742724, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1490742724, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1490742724, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1490742724} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1490742724, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1490742724, ULTIMATE.start_main_#t~ite27=|ULTIMATE.start_main_#t~ite27_Out-1490742724|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1490742724, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1490742724} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite27] because there is no mapped edge [2019-12-18 13:18:16,061 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L840-->L840-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In1049059904 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In1049059904 256)))) (or (and (or .cse0 .cse1) (= ~x$r_buff0_thd0~0_In1049059904 |ULTIMATE.start_main_#t~ite28_Out1049059904|)) (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite28_Out1049059904|) (not .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1049059904, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1049059904} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1049059904, ULTIMATE.start_main_#t~ite28=|ULTIMATE.start_main_#t~ite28_Out1049059904|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1049059904} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28] because there is no mapped edge [2019-12-18 13:18:16,062 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L841-->L841-2: Formula: (let ((.cse2 (= (mod ~x$w_buff0_used~0_In-272442185 256) 0)) (.cse3 (= (mod ~x$r_buff0_thd0~0_In-272442185 256) 0)) (.cse0 (= (mod ~x$r_buff1_thd0~0_In-272442185 256) 0)) (.cse1 (= (mod ~x$w_buff1_used~0_In-272442185 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite29_Out-272442185| ~x$r_buff1_thd0~0_In-272442185) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite29_Out-272442185| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-272442185, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-272442185, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-272442185, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-272442185} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-272442185, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_Out-272442185|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-272442185, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-272442185, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-272442185} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite29] because there is no mapped edge [2019-12-18 13:18:16,063 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L849-->L849-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In736855692 256)))) (or (and (= |ULTIMATE.start_main_#t~ite36_Out736855692| |ULTIMATE.start_main_#t~ite35_Out736855692|) .cse0 (= |ULTIMATE.start_main_#t~ite35_Out736855692| ~x$w_buff0~0_In736855692) (let ((.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In736855692 256)))) (or (and (= (mod ~x$r_buff1_thd0~0_In736855692 256) 0) .cse1) (= 0 (mod ~x$w_buff0_used~0_In736855692 256)) (and .cse1 (= 0 (mod ~x$w_buff1_used~0_In736855692 256)))))) (and (= |ULTIMATE.start_main_#t~ite35_In736855692| |ULTIMATE.start_main_#t~ite35_Out736855692|) (not .cse0) (= |ULTIMATE.start_main_#t~ite36_Out736855692| ~x$w_buff0~0_In736855692)))) InVars {~x$w_buff0~0=~x$w_buff0~0_In736855692, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In736855692, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_In736855692|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In736855692, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In736855692, ~weak$$choice2~0=~weak$$choice2~0_In736855692, ~x$w_buff0_used~0=~x$w_buff0_used~0_In736855692} OutVars{~x$w_buff0~0=~x$w_buff0~0_In736855692, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In736855692, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_Out736855692|, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out736855692|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In736855692, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In736855692, ~weak$$choice2~0=~weak$$choice2~0_In736855692, ~x$w_buff0_used~0=~x$w_buff0_used~0_In736855692} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36] because there is no mapped edge [2019-12-18 13:18:16,064 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [823] [823] L850-->L850-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In-1200459495 256)))) (or (and (= |ULTIMATE.start_main_#t~ite39_Out-1200459495| |ULTIMATE.start_main_#t~ite38_Out-1200459495|) (let ((.cse0 (= (mod ~x$r_buff0_thd0~0_In-1200459495 256) 0))) (or (and .cse0 (= (mod ~x$r_buff1_thd0~0_In-1200459495 256) 0)) (= 0 (mod ~x$w_buff0_used~0_In-1200459495 256)) (and .cse0 (= (mod ~x$w_buff1_used~0_In-1200459495 256) 0)))) (= |ULTIMATE.start_main_#t~ite38_Out-1200459495| ~x$w_buff1~0_In-1200459495) .cse1) (and (= |ULTIMATE.start_main_#t~ite39_Out-1200459495| ~x$w_buff1~0_In-1200459495) (not .cse1) (= |ULTIMATE.start_main_#t~ite38_In-1200459495| |ULTIMATE.start_main_#t~ite38_Out-1200459495|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1200459495, ~x$w_buff1~0=~x$w_buff1~0_In-1200459495, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1200459495, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_In-1200459495|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1200459495, ~weak$$choice2~0=~weak$$choice2~0_In-1200459495, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1200459495} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1200459495, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out-1200459495|, ~x$w_buff1~0=~x$w_buff1~0_In-1200459495, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1200459495, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out-1200459495|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1200459495, ~weak$$choice2~0=~weak$$choice2~0_In-1200459495, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1200459495} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-18 13:18:16,065 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [822] [822] L851-->L851-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-906158459 256)))) (or (and (not .cse0) (= ~x$w_buff0_used~0_In-906158459 |ULTIMATE.start_main_#t~ite42_Out-906158459|) (= |ULTIMATE.start_main_#t~ite41_In-906158459| |ULTIMATE.start_main_#t~ite41_Out-906158459|)) (and (let ((.cse1 (= (mod ~x$r_buff0_thd0~0_In-906158459 256) 0))) (or (and .cse1 (= (mod ~x$w_buff1_used~0_In-906158459 256) 0)) (= (mod ~x$w_buff0_used~0_In-906158459 256) 0) (and .cse1 (= 0 (mod ~x$r_buff1_thd0~0_In-906158459 256))))) (= ~x$w_buff0_used~0_In-906158459 |ULTIMATE.start_main_#t~ite41_Out-906158459|) (= |ULTIMATE.start_main_#t~ite41_Out-906158459| |ULTIMATE.start_main_#t~ite42_Out-906158459|) .cse0))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-906158459, ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_In-906158459|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-906158459, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-906158459, ~weak$$choice2~0=~weak$$choice2~0_In-906158459, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-906158459} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-906158459, ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out-906158459|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-906158459, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-906158459, ~weak$$choice2~0=~weak$$choice2~0_In-906158459, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-906158459|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-906158459} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-18 13:18:16,067 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [741] [741] L853-->L854: Formula: (and (= v_~x$r_buff0_thd0~0_126 v_~x$r_buff0_thd0~0_125) (not (= 0 (mod v_~weak$$choice2~0_24 256)))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_126, ~weak$$choice2~0=v_~weak$$choice2~0_24} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_125, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_9|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_8|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_8|, ~weak$$choice2~0=v_~weak$$choice2~0_24} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite46, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-18 13:18:16,067 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [824] [824] L854-->L854-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1394840820 256)))) (or (and (= ~x$r_buff1_thd0~0_In1394840820 |ULTIMATE.start_main_#t~ite50_Out1394840820|) .cse0 (let ((.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In1394840820 256)))) (or (= (mod ~x$w_buff0_used~0_In1394840820 256) 0) (and .cse1 (= 0 (mod ~x$w_buff1_used~0_In1394840820 256))) (and .cse1 (= (mod ~x$r_buff1_thd0~0_In1394840820 256) 0)))) (= |ULTIMATE.start_main_#t~ite50_Out1394840820| |ULTIMATE.start_main_#t~ite51_Out1394840820|)) (and (= ~x$r_buff1_thd0~0_In1394840820 |ULTIMATE.start_main_#t~ite51_Out1394840820|) (not .cse0) (= |ULTIMATE.start_main_#t~ite50_In1394840820| |ULTIMATE.start_main_#t~ite50_Out1394840820|)))) InVars {ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_In1394840820|, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1394840820, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1394840820, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1394840820, ~weak$$choice2~0=~weak$$choice2~0_In1394840820, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1394840820} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out1394840820|, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1394840820, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out1394840820|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1394840820, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1394840820, ~weak$$choice2~0=~weak$$choice2~0_In1394840820, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1394840820} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-18 13:18:16,068 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [812] [812] L856-->L859-1: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_5| (mod v_~main$tmp_guard1~0_11 256)) (= v_~x$mem_tmp~0_14 v_~x~0_125) (not (= 0 (mod v_~x$flush_delayed~0_29 256))) (= v_~x$flush_delayed~0_28 0)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_29, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_11, ~x$mem_tmp~0=v_~x$mem_tmp~0_14} OutVars{ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_28|, ~x$flush_delayed~0=v_~x$flush_delayed~0_28, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_11, ~x$mem_tmp~0=v_~x$mem_tmp~0_14, ~x~0=v_~x~0_125, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ~x$flush_delayed~0, ~x~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 13:18:16,069 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [815] [815] L859-1-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_11, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-18 13:18:16,211 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 01:18:16 BasicIcfg [2019-12-18 13:18:16,212 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 13:18:16,216 INFO L168 Benchmark]: Toolchain (without parser) took 66919.18 ms. Allocated memory was 145.2 MB in the beginning and 2.9 GB in the end (delta: 2.8 GB). Free memory was 101.4 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. [2019-12-18 13:18:16,217 INFO L168 Benchmark]: CDTParser took 1.73 ms. Allocated memory is still 145.2 MB. Free memory was 121.6 MB in the beginning and 121.3 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-18 13:18:16,218 INFO L168 Benchmark]: CACSL2BoogieTranslator took 860.28 ms. Allocated memory was 145.2 MB in the beginning and 202.4 MB in the end (delta: 57.1 MB). Free memory was 100.9 MB in the beginning and 153.4 MB in the end (delta: -52.5 MB). Peak memory consumption was 20.5 MB. Max. memory is 7.1 GB. [2019-12-18 13:18:16,219 INFO L168 Benchmark]: Boogie Procedure Inliner took 77.26 ms. Allocated memory is still 202.4 MB. Free memory was 153.4 MB in the beginning and 150.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-18 13:18:16,220 INFO L168 Benchmark]: Boogie Preprocessor took 39.62 ms. Allocated memory is still 202.4 MB. Free memory was 150.7 MB in the beginning and 148.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-18 13:18:16,220 INFO L168 Benchmark]: RCFGBuilder took 887.95 ms. Allocated memory is still 202.4 MB. Free memory was 148.0 MB in the beginning and 97.2 MB in the end (delta: 50.8 MB). Peak memory consumption was 50.8 MB. Max. memory is 7.1 GB. [2019-12-18 13:18:16,225 INFO L168 Benchmark]: TraceAbstraction took 65048.19 ms. Allocated memory was 202.4 MB in the beginning and 2.9 GB in the end (delta: 2.7 GB). Free memory was 96.6 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. [2019-12-18 13:18:16,233 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.73 ms. Allocated memory is still 145.2 MB. Free memory was 121.6 MB in the beginning and 121.3 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 860.28 ms. Allocated memory was 145.2 MB in the beginning and 202.4 MB in the end (delta: 57.1 MB). Free memory was 100.9 MB in the beginning and 153.4 MB in the end (delta: -52.5 MB). Peak memory consumption was 20.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 77.26 ms. Allocated memory is still 202.4 MB. Free memory was 153.4 MB in the beginning and 150.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 39.62 ms. Allocated memory is still 202.4 MB. Free memory was 150.7 MB in the beginning and 148.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 887.95 ms. Allocated memory is still 202.4 MB. Free memory was 148.0 MB in the beginning and 97.2 MB in the end (delta: 50.8 MB). Peak memory consumption was 50.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 65048.19 ms. Allocated memory was 202.4 MB in the beginning and 2.9 GB in the end (delta: 2.7 GB). Free memory was 96.6 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.7s, 179 ProgramPointsBefore, 92 ProgramPointsAfterwards, 216 TransitionsBefore, 99 TransitionsAfterwards, 17074 CoEnabledTransitionPairs, 8 FixpointIterations, 36 TrivialSequentialCompositions, 45 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 37 ConcurrentYvCompositions, 34 ChoiceCompositions, 6446 VarBasedMoverChecksPositive, 230 VarBasedMoverChecksNegative, 40 SemBasedMoverChecksPositive, 257 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.8s, 0 MoverChecksTotal, 82137 CheckedPairsTotal, 118 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L827] FCALL, FORK 0 pthread_create(&t891, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, b=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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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, z=0] [L829] FCALL, FORK 0 pthread_create(&t892, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, b=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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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, z=0] [L757] 2 x$w_buff1 = x$w_buff0 [L758] 2 x$w_buff0 = 2 [L759] 2 x$w_buff1_used = x$w_buff0_used [L760] 2 x$w_buff0_used = (_Bool)1 [L831] FCALL, FORK 0 pthread_create(&t893, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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, z=0] [L778] 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=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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, z=0] [L778] 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) [L792] 3 z = 1 [L795] 3 a = 1 [L798] 3 __unbuffered_p2_EAX = a [L801] 3 __unbuffered_p2_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, 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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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, z=1] [L804] 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, 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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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, z=1] [L737] 1 b = 1 [L740] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, 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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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, x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x=2, y=1, z=1] [L805] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L806] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L807] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L743] 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 [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, 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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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, z=1] [L779] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L780] 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 [L743] 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) [L744] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L745] 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 [L746] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L837] 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}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, 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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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, z=1] [L837] 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) [L838] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L839] 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 [L840] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L841] 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 [L844] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L845] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L846] 0 x$flush_delayed = weak$$choice2 [L847] 0 x$mem_tmp = x VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, 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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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, z=1] [L848] 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}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, 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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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, z=1] [L848] 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) [L849] 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)) [L850] 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)) [L851] 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)) [L852] 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}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, 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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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, z=1] [L852] 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)) [L854] 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)) [L855] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, 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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 170 locations, 2 error locations. Result: UNSAFE, OverallTime: 64.7s, OverallIterations: 15, TraceHistogramMax: 1, AutomataDifference: 13.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2006 SDtfs, 2757 SDslu, 5793 SDs, 0 SdLazy, 2832 SolverSat, 179 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 149 GetRequests, 14 SyntacticMatches, 13 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 499 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=147565occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 27.1s AutomataMinimizationTime, 14 MinimizatonAttempts, 42799 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 661 NumberOfCodeBlocks, 661 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 579 ConstructedInterpolants, 0 QuantifiedInterpolants, 173851 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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...