/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix054_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-1d1d2b5 [2020-10-21 23:01:19,927 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-21 23:01:19,931 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-21 23:01:19,975 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-21 23:01:19,975 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-21 23:01:19,984 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-21 23:01:19,987 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-21 23:01:19,991 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-21 23:01:19,994 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-21 23:01:19,997 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-21 23:01:19,998 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-21 23:01:19,999 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-21 23:01:19,999 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-21 23:01:20,003 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-21 23:01:20,006 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-21 23:01:20,008 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-21 23:01:20,010 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-21 23:01:20,012 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-21 23:01:20,013 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-21 23:01:20,021 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-21 23:01:20,023 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-21 23:01:20,025 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-21 23:01:20,026 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-21 23:01:20,026 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-21 23:01:20,045 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-21 23:01:20,045 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-21 23:01:20,045 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-21 23:01:20,046 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-21 23:01:20,047 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-21 23:01:20,047 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-21 23:01:20,048 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-21 23:01:20,048 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-21 23:01:20,049 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-21 23:01:20,050 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-21 23:01:20,051 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-21 23:01:20,051 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-21 23:01:20,052 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-21 23:01:20,052 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-21 23:01:20,052 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-21 23:01:20,053 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-21 23:01:20,054 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-21 23:01:20,054 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA.epf [2020-10-21 23:01:20,076 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-21 23:01:20,076 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-21 23:01:20,077 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-21 23:01:20,077 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-21 23:01:20,078 INFO L138 SettingsManager]: * Use SBE=true [2020-10-21 23:01:20,078 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-21 23:01:20,081 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-21 23:01:20,081 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-21 23:01:20,082 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-21 23:01:20,082 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-21 23:01:20,082 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-21 23:01:20,082 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-21 23:01:20,082 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-21 23:01:20,083 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-21 23:01:20,083 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-21 23:01:20,083 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-21 23:01:20,083 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-21 23:01:20,084 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-21 23:01:20,084 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-21 23:01:20,084 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-21 23:01:20,084 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-21 23:01:20,084 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-21 23:01:20,085 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-21 23:01:20,085 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2020-10-21 23:01:20,085 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-21 23:01:20,085 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-21 23:01:20,086 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-21 23:01:20,086 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-10-21 23:01:20,086 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-21 23:01:20,365 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-21 23:01:20,383 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-21 23:01:20,388 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-21 23:01:20,389 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-21 23:01:20,392 INFO L275 PluginConnector]: CDTParser initialized [2020-10-21 23:01:20,392 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix054_pso.opt.i [2020-10-21 23:01:20,464 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a66386fc/d5301b120bb94a9c8eff0a5590528e6a/FLAGbb650c599 [2020-10-21 23:01:21,040 INFO L306 CDTParser]: Found 1 translation units. [2020-10-21 23:01:21,041 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix054_pso.opt.i [2020-10-21 23:01:21,059 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a66386fc/d5301b120bb94a9c8eff0a5590528e6a/FLAGbb650c599 [2020-10-21 23:01:21,278 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a66386fc/d5301b120bb94a9c8eff0a5590528e6a [2020-10-21 23:01:21,287 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-21 23:01:21,294 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-21 23:01:21,295 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-21 23:01:21,295 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-21 23:01:21,300 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-21 23:01:21,301 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.10 11:01:21" (1/1) ... [2020-10-21 23:01:21,303 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b627d65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:01:21, skipping insertion in model container [2020-10-21 23:01:21,304 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.10 11:01:21" (1/1) ... [2020-10-21 23:01:21,311 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-21 23:01:21,377 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-21 23:01:22,014 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-21 23:01:22,027 INFO L203 MainTranslator]: Completed pre-run [2020-10-21 23:01:22,134 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-21 23:01:22,225 INFO L208 MainTranslator]: Completed translation [2020-10-21 23:01:22,227 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:01:22 WrapperNode [2020-10-21 23:01:22,227 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-21 23:01:22,229 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-21 23:01:22,229 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-21 23:01:22,229 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-21 23:01:22,238 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:01:22" (1/1) ... [2020-10-21 23:01:22,266 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:01:22" (1/1) ... [2020-10-21 23:01:22,301 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-21 23:01:22,301 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-21 23:01:22,302 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-21 23:01:22,302 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-21 23:01:22,312 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:01:22" (1/1) ... [2020-10-21 23:01:22,312 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:01:22" (1/1) ... [2020-10-21 23:01:22,317 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:01:22" (1/1) ... [2020-10-21 23:01:22,317 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:01:22" (1/1) ... [2020-10-21 23:01:22,327 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:01:22" (1/1) ... [2020-10-21 23:01:22,331 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:01:22" (1/1) ... [2020-10-21 23:01:22,335 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:01:22" (1/1) ... [2020-10-21 23:01:22,340 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-21 23:01:22,340 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-21 23:01:22,341 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-21 23:01:22,341 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-21 23:01:22,342 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:01:22" (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 [2020-10-21 23:01:22,410 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-21 23:01:22,411 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-21 23:01:22,411 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-21 23:01:22,411 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-21 23:01:22,411 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-21 23:01:22,412 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-21 23:01:22,412 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-21 23:01:22,412 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-21 23:01:22,412 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-21 23:01:22,413 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-21 23:01:22,413 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-21 23:01:22,413 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-21 23:01:22,415 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-21 23:01:24,338 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-21 23:01:24,338 INFO L298 CfgBuilder]: Removed 14 assume(true) statements. [2020-10-21 23:01:24,341 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.10 11:01:24 BoogieIcfgContainer [2020-10-21 23:01:24,341 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-21 23:01:24,342 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-21 23:01:24,343 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-21 23:01:24,346 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-21 23:01:24,347 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.10 11:01:21" (1/3) ... [2020-10-21 23:01:24,348 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d8f0449 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.10 11:01:24, skipping insertion in model container [2020-10-21 23:01:24,348 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:01:22" (2/3) ... [2020-10-21 23:01:24,349 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d8f0449 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.10 11:01:24, skipping insertion in model container [2020-10-21 23:01:24,349 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.10 11:01:24" (3/3) ... [2020-10-21 23:01:24,351 INFO L111 eAbstractionObserver]: Analyzing ICFG mix054_pso.opt.i [2020-10-21 23:01:24,364 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-21 23:01:24,365 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-21 23:01:24,372 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-21 23:01:24,374 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-21 23:01:24,403 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:24,403 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:24,403 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:24,404 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:24,404 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:24,404 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:24,404 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:24,404 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:24,405 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:24,405 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:24,405 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:24,406 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:24,406 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:24,406 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:24,406 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:24,407 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:24,407 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:24,407 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:24,407 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:24,407 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:24,408 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:24,408 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:24,408 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:24,408 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:24,408 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:24,409 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:24,409 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:24,409 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:24,409 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:24,410 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:24,410 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:24,410 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:24,410 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:24,410 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:24,411 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:24,411 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:24,415 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:24,415 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:24,416 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:24,416 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:24,416 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:24,416 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:24,417 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:24,417 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:24,417 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:24,417 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:24,419 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:24,420 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:24,420 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:24,420 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:24,420 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:24,421 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:24,421 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:24,421 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:24,421 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:24,422 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:24,422 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:24,422 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:24,422 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:24,422 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:24,424 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-10-21 23:01:24,441 INFO L253 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2020-10-21 23:01:24,465 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-21 23:01:24,466 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-21 23:01:24,466 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-21 23:01:24,466 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-21 23:01:24,466 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-21 23:01:24,466 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-21 23:01:24,466 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-21 23:01:24,467 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-21 23:01:24,480 INFO L137 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2020-10-21 23:01:24,481 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 88 places, 84 transitions, 178 flow [2020-10-21 23:01:24,484 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 88 places, 84 transitions, 178 flow [2020-10-21 23:01:24,486 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 88 places, 84 transitions, 178 flow [2020-10-21 23:01:24,528 INFO L129 PetriNetUnfolder]: 3/82 cut-off events. [2020-10-21 23:01:24,528 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-21 23:01:24,533 INFO L80 FinitePrefix]: Finished finitePrefix Result has 89 conditions, 82 events. 3/82 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 59 event pairs, 0 based on Foata normal form. 0/77 useless extension candidates. Maximal degree in co-relation 50. Up to 2 conditions per place. [2020-10-21 23:01:24,535 INFO L116 LiptonReduction]: Number of co-enabled transitions 1038 [2020-10-21 23:01:24,957 WARN L193 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 45 [2020-10-21 23:01:25,942 WARN L193 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2020-10-21 23:01:27,653 WARN L193 SmtUtils]: Spent 1.34 s on a formula simplification. DAG size of input: 230 DAG size of output: 190 [2020-10-21 23:01:27,686 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 2, 2, 1] term [2020-10-21 23:01:27,686 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 23:01:27,688 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-10-21 23:01:27,689 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 23:01:28,876 WARN L193 SmtUtils]: Spent 1.17 s on a formula simplification. DAG size of input: 145 DAG size of output: 116 [2020-10-21 23:01:29,995 WARN L193 SmtUtils]: Spent 1.11 s on a formula simplification. DAG size of input: 227 DAG size of output: 186 [2020-10-21 23:01:30,016 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 2, 1] term [2020-10-21 23:01:30,018 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 23:01:30,023 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-10-21 23:01:30,023 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 23:01:30,939 WARN L193 SmtUtils]: Spent 886.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 105 [2020-10-21 23:01:31,335 WARN L193 SmtUtils]: Spent 297.00 ms on a formula simplification that was a NOOP. DAG size: 122 [2020-10-21 23:01:31,634 WARN L193 SmtUtils]: Spent 297.00 ms on a formula simplification that was a NOOP. DAG size: 122 [2020-10-21 23:01:31,814 WARN L193 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2020-10-21 23:01:31,933 WARN L193 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2020-10-21 23:01:32,290 WARN L193 SmtUtils]: Spent 327.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 106 [2020-10-21 23:01:32,462 WARN L193 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2020-10-21 23:01:32,467 INFO L131 LiptonReduction]: Checked pairs total: 2926 [2020-10-21 23:01:32,467 INFO L133 LiptonReduction]: Total number of compositions: 85 [2020-10-21 23:01:32,474 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 26 places, 19 transitions, 48 flow [2020-10-21 23:01:32,489 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 162 states. [2020-10-21 23:01:32,492 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states. [2020-10-21 23:01:32,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-10-21 23:01:32,498 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:01:32,499 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-10-21 23:01:32,499 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:01:32,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:01:32,505 INFO L82 PathProgramCache]: Analyzing trace with hash 916373333, now seen corresponding path program 1 times [2020-10-21 23:01:32,513 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:01:32,513 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141942286] [2020-10-21 23:01:32,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:01:32,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:01:32,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 23:01:32,732 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141942286] [2020-10-21 23:01:32,733 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:01:32,733 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-21 23:01:32,734 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272033604] [2020-10-21 23:01:32,738 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-21 23:01:32,739 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:01:32,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-21 23:01:32,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-21 23:01:32,756 INFO L87 Difference]: Start difference. First operand 162 states. Second operand 3 states. [2020-10-21 23:01:32,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:01:32,824 INFO L93 Difference]: Finished difference Result 137 states and 320 transitions. [2020-10-21 23:01:32,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-21 23:01:32,826 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-10-21 23:01:32,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:01:32,839 INFO L225 Difference]: With dead ends: 137 [2020-10-21 23:01:32,839 INFO L226 Difference]: Without dead ends: 112 [2020-10-21 23:01:32,840 INFO L677 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 [2020-10-21 23:01:32,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2020-10-21 23:01:32,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2020-10-21 23:01:32,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2020-10-21 23:01:32,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 255 transitions. [2020-10-21 23:01:32,891 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 255 transitions. Word has length 5 [2020-10-21 23:01:32,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:01:32,891 INFO L481 AbstractCegarLoop]: Abstraction has 112 states and 255 transitions. [2020-10-21 23:01:32,892 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-21 23:01:32,892 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 255 transitions. [2020-10-21 23:01:32,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-10-21 23:01:32,893 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:01:32,893 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:01:32,893 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-21 23:01:32,893 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:01:32,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:01:32,894 INFO L82 PathProgramCache]: Analyzing trace with hash 166530678, now seen corresponding path program 1 times [2020-10-21 23:01:32,894 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:01:32,894 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856668170] [2020-10-21 23:01:32,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:01:32,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:01:33,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 23:01:33,086 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856668170] [2020-10-21 23:01:33,086 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:01:33,086 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-21 23:01:33,087 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102092915] [2020-10-21 23:01:33,088 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-21 23:01:33,088 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:01:33,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-21 23:01:33,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-21 23:01:33,089 INFO L87 Difference]: Start difference. First operand 112 states and 255 transitions. Second operand 4 states. [2020-10-21 23:01:33,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:01:33,135 INFO L93 Difference]: Finished difference Result 110 states and 249 transitions. [2020-10-21 23:01:33,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-21 23:01:33,137 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2020-10-21 23:01:33,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:01:33,142 INFO L225 Difference]: With dead ends: 110 [2020-10-21 23:01:33,142 INFO L226 Difference]: Without dead ends: 110 [2020-10-21 23:01:33,143 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-21 23:01:33,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2020-10-21 23:01:33,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2020-10-21 23:01:33,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2020-10-21 23:01:33,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 249 transitions. [2020-10-21 23:01:33,158 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 249 transitions. Word has length 7 [2020-10-21 23:01:33,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:01:33,158 INFO L481 AbstractCegarLoop]: Abstraction has 110 states and 249 transitions. [2020-10-21 23:01:33,158 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-21 23:01:33,159 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 249 transitions. [2020-10-21 23:01:33,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-10-21 23:01:33,160 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:01:33,160 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:01:33,160 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-21 23:01:33,160 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:01:33,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:01:33,161 INFO L82 PathProgramCache]: Analyzing trace with hash 867482972, now seen corresponding path program 1 times [2020-10-21 23:01:33,161 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:01:33,161 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677679118] [2020-10-21 23:01:33,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:01:33,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:01:33,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 23:01:33,296 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677679118] [2020-10-21 23:01:33,297 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:01:33,297 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-21 23:01:33,297 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069021431] [2020-10-21 23:01:33,297 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-21 23:01:33,298 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:01:33,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-21 23:01:33,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-21 23:01:33,299 INFO L87 Difference]: Start difference. First operand 110 states and 249 transitions. Second operand 5 states. [2020-10-21 23:01:33,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:01:33,351 INFO L93 Difference]: Finished difference Result 106 states and 237 transitions. [2020-10-21 23:01:33,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-21 23:01:33,352 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2020-10-21 23:01:33,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:01:33,353 INFO L225 Difference]: With dead ends: 106 [2020-10-21 23:01:33,353 INFO L226 Difference]: Without dead ends: 106 [2020-10-21 23:01:33,354 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-21 23:01:33,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2020-10-21 23:01:33,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2020-10-21 23:01:33,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2020-10-21 23:01:33,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 237 transitions. [2020-10-21 23:01:33,364 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 237 transitions. Word has length 8 [2020-10-21 23:01:33,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:01:33,364 INFO L481 AbstractCegarLoop]: Abstraction has 106 states and 237 transitions. [2020-10-21 23:01:33,364 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-21 23:01:33,364 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 237 transitions. [2020-10-21 23:01:33,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-21 23:01:33,365 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:01:33,366 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:01:33,366 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-21 23:01:33,366 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:01:33,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:01:33,366 INFO L82 PathProgramCache]: Analyzing trace with hash 1731741799, now seen corresponding path program 1 times [2020-10-21 23:01:33,367 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:01:33,367 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718910659] [2020-10-21 23:01:33,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:01:33,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:01:33,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 23:01:33,478 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718910659] [2020-10-21 23:01:33,478 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:01:33,478 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-21 23:01:33,478 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516276570] [2020-10-21 23:01:33,479 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-21 23:01:33,483 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:01:33,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-21 23:01:33,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-21 23:01:33,484 INFO L87 Difference]: Start difference. First operand 106 states and 237 transitions. Second operand 5 states. [2020-10-21 23:01:33,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:01:33,557 INFO L93 Difference]: Finished difference Result 104 states and 231 transitions. [2020-10-21 23:01:33,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-21 23:01:33,558 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2020-10-21 23:01:33,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:01:33,561 INFO L225 Difference]: With dead ends: 104 [2020-10-21 23:01:33,562 INFO L226 Difference]: Without dead ends: 104 [2020-10-21 23:01:33,562 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-21 23:01:33,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2020-10-21 23:01:33,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 103. [2020-10-21 23:01:33,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2020-10-21 23:01:33,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 229 transitions. [2020-10-21 23:01:33,571 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 229 transitions. Word has length 9 [2020-10-21 23:01:33,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:01:33,602 INFO L481 AbstractCegarLoop]: Abstraction has 103 states and 229 transitions. [2020-10-21 23:01:33,602 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-21 23:01:33,602 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 229 transitions. [2020-10-21 23:01:33,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-10-21 23:01:33,604 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:01:33,605 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:01:33,605 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-21 23:01:33,605 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:01:33,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:01:33,606 INFO L82 PathProgramCache]: Analyzing trace with hash 2144387467, now seen corresponding path program 1 times [2020-10-21 23:01:33,606 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:01:33,608 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19669125] [2020-10-21 23:01:33,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:01:33,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:01:33,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 23:01:33,772 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19669125] [2020-10-21 23:01:33,772 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:01:33,773 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-21 23:01:33,774 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795006504] [2020-10-21 23:01:33,774 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-21 23:01:33,775 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:01:33,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-21 23:01:33,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-10-21 23:01:33,776 INFO L87 Difference]: Start difference. First operand 103 states and 229 transitions. Second operand 6 states. [2020-10-21 23:01:33,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:01:33,897 INFO L93 Difference]: Finished difference Result 113 states and 249 transitions. [2020-10-21 23:01:33,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-21 23:01:33,898 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2020-10-21 23:01:33,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:01:33,900 INFO L225 Difference]: With dead ends: 113 [2020-10-21 23:01:33,900 INFO L226 Difference]: Without dead ends: 113 [2020-10-21 23:01:33,900 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2020-10-21 23:01:33,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2020-10-21 23:01:33,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2020-10-21 23:01:33,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2020-10-21 23:01:33,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 249 transitions. [2020-10-21 23:01:33,927 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 249 transitions. Word has length 10 [2020-10-21 23:01:33,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:01:33,928 INFO L481 AbstractCegarLoop]: Abstraction has 113 states and 249 transitions. [2020-10-21 23:01:33,928 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-21 23:01:33,928 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 249 transitions. [2020-10-21 23:01:33,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-10-21 23:01:33,932 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:01:33,932 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:01:33,933 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-21 23:01:33,933 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:01:33,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:01:33,933 INFO L82 PathProgramCache]: Analyzing trace with hash 427426939, now seen corresponding path program 1 times [2020-10-21 23:01:33,934 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:01:33,934 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179432449] [2020-10-21 23:01:33,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:01:34,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:01:34,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 23:01:34,043 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179432449] [2020-10-21 23:01:34,043 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:01:34,043 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-21 23:01:34,043 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607227488] [2020-10-21 23:01:34,044 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-21 23:01:34,044 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:01:34,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-21 23:01:34,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-21 23:01:34,045 INFO L87 Difference]: Start difference. First operand 113 states and 249 transitions. Second operand 4 states. [2020-10-21 23:01:34,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:01:34,071 INFO L93 Difference]: Finished difference Result 100 states and 187 transitions. [2020-10-21 23:01:34,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-21 23:01:34,072 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2020-10-21 23:01:34,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:01:34,073 INFO L225 Difference]: With dead ends: 100 [2020-10-21 23:01:34,073 INFO L226 Difference]: Without dead ends: 71 [2020-10-21 23:01:34,074 INFO L677 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 [2020-10-21 23:01:34,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2020-10-21 23:01:34,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2020-10-21 23:01:34,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2020-10-21 23:01:34,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 123 transitions. [2020-10-21 23:01:34,078 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 123 transitions. Word has length 10 [2020-10-21 23:01:34,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:01:34,078 INFO L481 AbstractCegarLoop]: Abstraction has 71 states and 123 transitions. [2020-10-21 23:01:34,079 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-21 23:01:34,079 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 123 transitions. [2020-10-21 23:01:34,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-21 23:01:34,079 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:01:34,080 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:01:34,080 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-21 23:01:34,080 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:01:34,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:01:34,080 INFO L82 PathProgramCache]: Analyzing trace with hash 859195324, now seen corresponding path program 1 times [2020-10-21 23:01:34,081 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:01:34,081 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567379887] [2020-10-21 23:01:34,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:01:34,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:01:34,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 23:01:34,156 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567379887] [2020-10-21 23:01:34,157 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:01:34,157 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-21 23:01:34,157 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90683344] [2020-10-21 23:01:34,157 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-21 23:01:34,158 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:01:34,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-21 23:01:34,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-21 23:01:34,158 INFO L87 Difference]: Start difference. First operand 71 states and 123 transitions. Second operand 5 states. [2020-10-21 23:01:34,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:01:34,194 INFO L93 Difference]: Finished difference Result 55 states and 89 transitions. [2020-10-21 23:01:34,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-21 23:01:34,194 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2020-10-21 23:01:34,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:01:34,195 INFO L225 Difference]: With dead ends: 55 [2020-10-21 23:01:34,195 INFO L226 Difference]: Without dead ends: 44 [2020-10-21 23:01:34,196 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-21 23:01:34,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2020-10-21 23:01:34,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 40. [2020-10-21 23:01:34,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2020-10-21 23:01:34,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 63 transitions. [2020-10-21 23:01:34,198 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 63 transitions. Word has length 11 [2020-10-21 23:01:34,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:01:34,199 INFO L481 AbstractCegarLoop]: Abstraction has 40 states and 63 transitions. [2020-10-21 23:01:34,199 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-21 23:01:34,199 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 63 transitions. [2020-10-21 23:01:34,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-21 23:01:34,200 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:01:34,200 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:01:34,200 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-21 23:01:34,200 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:01:34,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:01:34,201 INFO L82 PathProgramCache]: Analyzing trace with hash 1015613484, now seen corresponding path program 1 times [2020-10-21 23:01:34,201 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:01:34,201 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47810978] [2020-10-21 23:01:34,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:01:34,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:01:34,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 23:01:34,289 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47810978] [2020-10-21 23:01:34,289 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:01:34,290 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-21 23:01:34,290 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296138672] [2020-10-21 23:01:34,290 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-21 23:01:34,291 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:01:34,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-21 23:01:34,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-10-21 23:01:34,291 INFO L87 Difference]: Start difference. First operand 40 states and 63 transitions. Second operand 7 states. [2020-10-21 23:01:34,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:01:34,381 INFO L93 Difference]: Finished difference Result 68 states and 100 transitions. [2020-10-21 23:01:34,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-21 23:01:34,382 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2020-10-21 23:01:34,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:01:34,383 INFO L225 Difference]: With dead ends: 68 [2020-10-21 23:01:34,383 INFO L226 Difference]: Without dead ends: 31 [2020-10-21 23:01:34,384 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-10-21 23:01:34,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2020-10-21 23:01:34,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 24. [2020-10-21 23:01:34,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-10-21 23:01:34,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. [2020-10-21 23:01:34,386 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 31 transitions. Word has length 15 [2020-10-21 23:01:34,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:01:34,386 INFO L481 AbstractCegarLoop]: Abstraction has 24 states and 31 transitions. [2020-10-21 23:01:34,386 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-21 23:01:34,386 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 31 transitions. [2020-10-21 23:01:34,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-21 23:01:34,387 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:01:34,387 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:01:34,387 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-21 23:01:34,388 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:01:34,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:01:34,388 INFO L82 PathProgramCache]: Analyzing trace with hash 1062004012, now seen corresponding path program 2 times [2020-10-21 23:01:34,388 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:01:34,388 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689106114] [2020-10-21 23:01:34,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:01:34,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-21 23:01:34,427 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-21 23:01:34,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-21 23:01:34,466 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-21 23:01:34,501 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-21 23:01:34,502 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-21 23:01:34,502 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-21 23:01:34,503 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-21 23:01:34,513 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [916] [916] L799-->L806: Formula: (let ((.cse7 (= (mod ~x$w_buff0_used~0_In668013993 256) 0)) (.cse6 (= (mod ~x$r_buff0_thd0~0_In668013993 256) 0)) (.cse9 (= (mod ~x$r_buff1_thd0~0_In668013993 256) 0)) (.cse8 (= (mod ~x$w_buff1_used~0_In668013993 256) 0))) (let ((.cse0 (not .cse8)) (.cse1 (not .cse9)) (.cse2 (or .cse8 .cse9)) (.cse5 (or .cse7 .cse6)) (.cse3 (not .cse7)) (.cse4 (not .cse6))) (and (or (and (= ~x$w_buff1_used~0_Out668013993 0) .cse0 .cse1) (and .cse2 (= ~x$w_buff1_used~0_Out668013993 ~x$w_buff1_used~0_In668013993))) (= ~x$r_buff1_thd0~0_In668013993 ~x$r_buff1_thd0~0_Out668013993) (= ~x$r_buff0_thd0~0_In668013993 ~x$r_buff0_thd0~0_Out668013993) (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out668013993 0)) (= ULTIMATE.start_assume_abort_if_not_~cond_Out668013993 |ULTIMATE.start_assume_abort_if_not_#in~cond_In668013993|) (or (and (= ~x$w_buff0_used~0_Out668013993 0) .cse3 .cse4) (and (= ~x$w_buff0_used~0_Out668013993 ~x$w_buff0_used~0_In668013993) .cse5)) (or (and (or (and .cse0 (= ~x$w_buff1~0_In668013993 ~x~0_Out668013993) .cse1) (and (= ~x~0_Out668013993 ~x~0_In668013993) .cse2)) .cse5) (and .cse3 (= ~x~0_Out668013993 ~x$w_buff0~0_In668013993) .cse4))))) InVars {~x$w_buff0~0=~x$w_buff0~0_In668013993, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In668013993, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In668013993|, ~x$w_buff1~0=~x$w_buff1~0_In668013993, ~x$w_buff1_used~0=~x$w_buff1_used~0_In668013993, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In668013993, ~x~0=~x~0_In668013993, ~x$w_buff0_used~0=~x$w_buff0_used~0_In668013993} OutVars{~x$w_buff0~0=~x$w_buff0~0_In668013993, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_Out668013993, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out668013993|, ~x$w_buff1~0=~x$w_buff1~0_In668013993, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out668013993|, ~x$w_buff1_used~0=~x$w_buff1_used~0_Out668013993, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_Out668013993, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out668013993|, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out668013993|, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out668013993|, ~x$w_buff0_used~0=~x$w_buff0_used~0_Out668013993, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out668013993|, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In668013993|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out668013993, ~x~0=~x~0_Out668013993} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start_assume_abort_if_not_~cond, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~ite24, ~x$w_buff1_used~0, ~x$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite21, ~x~0, ULTIMATE.start_main_#t~ite22, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2020-10-21 23:01:34,518 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:01:34,519 WARN L224 RCFGBacktranslator]: unable to determine which branch was taken at C: __VERIFIER_atomic_begin() [755] [2020-10-21 23:01:34,520 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:01:34,520 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:01:34,521 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:01:34,521 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:01:34,521 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:01:34,521 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:01:34,521 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:01:34,522 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:01:34,522 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:01:34,522 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:01:34,522 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:01:34,522 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:01:34,523 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:01:34,523 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:01:34,523 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:01:34,524 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:01:34,524 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:01:34,524 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:01:34,524 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:01:34,524 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:01:34,524 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:01:34,525 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:01:34,525 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:01:34,525 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:01:34,526 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:01:34,526 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:01:34,526 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:01:34,526 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:01:34,527 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:01:34,527 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:01:34,527 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:01:34,527 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:01:34,527 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:01:34,528 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:01:34,528 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:01:34,528 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:01:34,528 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:01:34,528 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:01:34,528 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:01:34,529 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:01:34,529 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:01:34,529 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:01:34,529 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:01:34,529 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:01:34,530 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:01:34,530 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:01:34,530 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:01:34,530 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:01:34,578 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.10 11:01:34 BasicIcfg [2020-10-21 23:01:34,579 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-21 23:01:34,584 INFO L168 Benchmark]: Toolchain (without parser) took 13294.59 ms. Allocated memory was 140.5 MB in the beginning and 364.4 MB in the end (delta: 223.9 MB). Free memory was 101.6 MB in the beginning and 203.0 MB in the end (delta: -101.4 MB). Peak memory consumption was 122.5 MB. Max. memory is 7.1 GB. [2020-10-21 23:01:34,584 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 140.5 MB. Free memory was 122.0 MB in the beginning and 121.6 MB in the end (delta: 419.7 kB). Peak memory consumption was 419.7 kB. Max. memory is 7.1 GB. [2020-10-21 23:01:34,585 INFO L168 Benchmark]: CACSL2BoogieTranslator took 932.70 ms. Allocated memory was 140.5 MB in the beginning and 203.9 MB in the end (delta: 63.4 MB). Free memory was 100.7 MB in the beginning and 155.1 MB in the end (delta: -54.4 MB). Peak memory consumption was 22.6 MB. Max. memory is 7.1 GB. [2020-10-21 23:01:34,586 INFO L168 Benchmark]: Boogie Procedure Inliner took 72.44 ms. Allocated memory is still 203.9 MB. Free memory was 155.1 MB in the beginning and 152.2 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2020-10-21 23:01:34,587 INFO L168 Benchmark]: Boogie Preprocessor took 38.70 ms. Allocated memory is still 203.9 MB. Free memory was 152.2 MB in the beginning and 150.3 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2020-10-21 23:01:34,587 INFO L168 Benchmark]: RCFGBuilder took 2000.74 ms. Allocated memory was 203.9 MB in the beginning and 248.0 MB in the end (delta: 44.0 MB). Free memory was 150.3 MB in the beginning and 193.5 MB in the end (delta: -43.2 MB). Peak memory consumption was 101.1 MB. Max. memory is 7.1 GB. [2020-10-21 23:01:34,588 INFO L168 Benchmark]: TraceAbstraction took 10236.27 ms. Allocated memory was 248.0 MB in the beginning and 364.4 MB in the end (delta: 116.4 MB). Free memory was 191.6 MB in the beginning and 203.0 MB in the end (delta: -11.4 MB). Peak memory consumption was 105.0 MB. Max. memory is 7.1 GB. [2020-10-21 23:01:34,592 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25 ms. Allocated memory is still 140.5 MB. Free memory was 122.0 MB in the beginning and 121.6 MB in the end (delta: 419.7 kB). Peak memory consumption was 419.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 932.70 ms. Allocated memory was 140.5 MB in the beginning and 203.9 MB in the end (delta: 63.4 MB). Free memory was 100.7 MB in the beginning and 155.1 MB in the end (delta: -54.4 MB). Peak memory consumption was 22.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 72.44 ms. Allocated memory is still 203.9 MB. Free memory was 155.1 MB in the beginning and 152.2 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 38.70 ms. Allocated memory is still 203.9 MB. Free memory was 152.2 MB in the beginning and 150.3 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2000.74 ms. Allocated memory was 203.9 MB in the beginning and 248.0 MB in the end (delta: 44.0 MB). Free memory was 150.3 MB in the beginning and 193.5 MB in the end (delta: -43.2 MB). Peak memory consumption was 101.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 10236.27 ms. Allocated memory was 248.0 MB in the beginning and 364.4 MB in the end (delta: 116.4 MB). Free memory was 191.6 MB in the beginning and 203.0 MB in the end (delta: -11.4 MB). Peak memory consumption was 105.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 546 VarBasedMoverChecksPositive, 32 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 36 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 7.9s, 88 PlacesBefore, 26 PlacesAfterwards, 84 TransitionsBefore, 19 TransitionsAfterwards, 1038 CoEnabledTransitionPairs, 7 FixpointIterations, 32 TrivialSequentialCompositions, 40 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 3 ChoiceCompositions, 85 TotalNumberOfCompositions, 2926 MoverChecksTotal - CounterExampleResult [Line: 17]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L708] 0 int __unbuffered_cnt = 0; [L710] 0 int __unbuffered_p1_EAX = 0; [L711] 0 _Bool main$tmp_guard0; [L712] 0 _Bool main$tmp_guard1; [L714] 0 int x = 0; [L715] 0 _Bool x$flush_delayed; [L716] 0 int x$mem_tmp; [L717] 0 _Bool x$r_buff0_thd0; [L718] 0 _Bool x$r_buff0_thd1; [L719] 0 _Bool x$r_buff0_thd2; [L720] 0 _Bool x$r_buff1_thd0; [L721] 0 _Bool x$r_buff1_thd1; [L722] 0 _Bool x$r_buff1_thd2; [L723] 0 _Bool x$read_delayed; [L724] 0 int *x$read_delayed_var; [L725] 0 int x$w_buff0; [L726] 0 _Bool x$w_buff0_used; [L727] 0 int x$w_buff1; [L728] 0 _Bool x$w_buff1_used; [L730] 0 int y = 0; [L731] 0 _Bool weak$$choice0; [L732] 0 _Bool weak$$choice2; [L792] 0 pthread_t t1447; [L793] FCALL, FORK 0 pthread_create(&t1447, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L794] 0 pthread_t t1448; [L795] FCALL, FORK 0 pthread_create(&t1448, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L756] 2 x$w_buff1 = x$w_buff0 [L757] 2 x$w_buff0 = 2 [L758] 2 x$w_buff1_used = x$w_buff0_used [L759] 2 x$w_buff0_used = (_Bool)1 [L18] COND FALSE 2 !(!expression) [L761] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L762] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L763] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L764] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L767] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L736] 1 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L739] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L742] 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) [L742] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L742] 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) [L742] 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) [L743] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L743] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L744] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L744] 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 [L745] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L745] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L746] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L746] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L749] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L751] 1 return 0; [L770] 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) [L770] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L770] 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) [L770] 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) [L771] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L771] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L772] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L772] 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 [L773] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L773] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L774] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L774] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L777] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L779] 2 return 0; [L797] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L808] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L809] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L810] 0 x$flush_delayed = weak$$choice2 [L811] 0 x$mem_tmp = x [L812] 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) [L812] 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) [L813] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L813] EXPR 0 !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) [L813] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0 [L813] EXPR 0 !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) [L813] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L813] 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)) [L814] EXPR 0 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)) [L814] EXPR 0 !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) [L814] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1 [L814] EXPR 0 !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) [L814] EXPR 0 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)) [L814] 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)) [L815] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L815] 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)) [L816] 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)) [L816] 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)) [L817] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L817] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L818] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L818] 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)) [L819] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0) [L820] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L820] 0 x = x$flush_delayed ? x$mem_tmp : x [L821] 0 x$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "mix054_pso.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 82 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 10.0s, OverallIterations: 9, TraceHistogramMax: 1, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 8.0s, HoareTripleCheckerStatistics: 124 SDtfs, 142 SDslu, 157 SDs, 0 SdLazy, 148 SolverSat, 52 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=162occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 12 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 90 NumberOfCodeBlocks, 90 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 67 ConstructedInterpolants, 0 QuantifiedInterpolants, 4232 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...