/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/safe030_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-1d1d2b5 [2020-10-21 23:08:34,920 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-21 23:08:34,922 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-21 23:08:34,950 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-21 23:08:34,950 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-21 23:08:34,951 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-21 23:08:34,952 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-21 23:08:34,954 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-21 23:08:34,956 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-21 23:08:34,957 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-21 23:08:34,958 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-21 23:08:34,959 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-21 23:08:34,959 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-21 23:08:34,960 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-21 23:08:34,961 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-21 23:08:34,962 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-21 23:08:34,963 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-21 23:08:34,964 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-21 23:08:34,966 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-21 23:08:34,968 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-21 23:08:34,970 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-21 23:08:34,971 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-21 23:08:34,972 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-21 23:08:34,973 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-21 23:08:34,976 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-21 23:08:34,976 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-21 23:08:34,976 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-21 23:08:34,977 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-21 23:08:34,978 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-21 23:08:34,979 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-21 23:08:34,979 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-21 23:08:34,980 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-21 23:08:34,981 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-21 23:08:34,982 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-21 23:08:34,985 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-21 23:08:34,985 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-21 23:08:34,986 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-21 23:08:34,986 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-21 23:08:34,987 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-21 23:08:34,989 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-21 23:08:34,989 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-21 23:08:34,991 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:08:35,030 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-21 23:08:35,030 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-21 23:08:35,032 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-21 23:08:35,033 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-21 23:08:35,033 INFO L138 SettingsManager]: * Use SBE=true [2020-10-21 23:08:35,033 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-21 23:08:35,034 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-21 23:08:35,035 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-21 23:08:35,035 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-21 23:08:35,035 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-21 23:08:35,036 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-21 23:08:35,036 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-21 23:08:35,036 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-21 23:08:35,037 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-21 23:08:35,037 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-21 23:08:35,037 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-21 23:08:35,037 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-21 23:08:35,038 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-21 23:08:35,038 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-21 23:08:35,038 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-21 23:08:35,038 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-21 23:08:35,038 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-21 23:08:35,039 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-21 23:08:35,039 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2020-10-21 23:08:35,039 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-21 23:08:35,039 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-21 23:08:35,039 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-21 23:08:35,040 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-10-21 23:08:35,040 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-21 23:08:35,365 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-21 23:08:35,379 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-21 23:08:35,382 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-21 23:08:35,383 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-21 23:08:35,383 INFO L275 PluginConnector]: CDTParser initialized [2020-10-21 23:08:35,384 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe030_rmo.opt.i [2020-10-21 23:08:35,454 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/43b174222/595eabc4fe294e6c99ae90f2c4f23024/FLAGc81693ccf [2020-10-21 23:08:36,035 INFO L306 CDTParser]: Found 1 translation units. [2020-10-21 23:08:36,036 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe030_rmo.opt.i [2020-10-21 23:08:36,052 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/43b174222/595eabc4fe294e6c99ae90f2c4f23024/FLAGc81693ccf [2020-10-21 23:08:36,281 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/43b174222/595eabc4fe294e6c99ae90f2c4f23024 [2020-10-21 23:08:36,290 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-21 23:08:36,297 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-21 23:08:36,300 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-21 23:08:36,301 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-21 23:08:36,304 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-21 23:08:36,305 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.10 11:08:36" (1/1) ... [2020-10-21 23:08:36,308 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@792afed1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:08:36, skipping insertion in model container [2020-10-21 23:08:36,309 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.10 11:08:36" (1/1) ... [2020-10-21 23:08:36,318 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-21 23:08:36,388 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-21 23:08:37,006 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-21 23:08:37,022 INFO L203 MainTranslator]: Completed pre-run [2020-10-21 23:08:37,099 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-21 23:08:37,178 INFO L208 MainTranslator]: Completed translation [2020-10-21 23:08:37,178 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:08:37 WrapperNode [2020-10-21 23:08:37,179 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-21 23:08:37,180 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-21 23:08:37,180 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-21 23:08:37,180 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-21 23:08:37,189 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:08:37" (1/1) ... [2020-10-21 23:08:37,209 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:08:37" (1/1) ... [2020-10-21 23:08:37,256 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-21 23:08:37,256 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-21 23:08:37,256 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-21 23:08:37,257 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-21 23:08:37,267 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:08:37" (1/1) ... [2020-10-21 23:08:37,268 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:08:37" (1/1) ... [2020-10-21 23:08:37,272 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:08:37" (1/1) ... [2020-10-21 23:08:37,273 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:08:37" (1/1) ... [2020-10-21 23:08:37,285 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:08:37" (1/1) ... [2020-10-21 23:08:37,289 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:08:37" (1/1) ... [2020-10-21 23:08:37,293 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:08:37" (1/1) ... [2020-10-21 23:08:37,298 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-21 23:08:37,299 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-21 23:08:37,299 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-21 23:08:37,299 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-21 23:08:37,300 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:08:37" (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:08:37,396 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-21 23:08:37,396 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-21 23:08:37,397 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-21 23:08:37,397 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-21 23:08:37,397 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-21 23:08:37,397 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-21 23:08:37,398 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-21 23:08:37,398 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-21 23:08:37,398 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-21 23:08:37,398 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-21 23:08:37,399 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-21 23:08:37,399 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-21 23:08:37,399 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-21 23:08:37,399 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-21 23:08:37,402 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:08:39,444 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-21 23:08:39,444 INFO L298 CfgBuilder]: Removed 14 assume(true) statements. [2020-10-21 23:08:39,449 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.10 11:08:39 BoogieIcfgContainer [2020-10-21 23:08:39,450 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-21 23:08:39,451 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-21 23:08:39,451 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-21 23:08:39,455 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-21 23:08:39,455 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.10 11:08:36" (1/3) ... [2020-10-21 23:08:39,456 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7dcfa46b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.10 11:08:39, skipping insertion in model container [2020-10-21 23:08:39,456 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:08:37" (2/3) ... [2020-10-21 23:08:39,457 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7dcfa46b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.10 11:08:39, skipping insertion in model container [2020-10-21 23:08:39,457 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.10 11:08:39" (3/3) ... [2020-10-21 23:08:39,459 INFO L111 eAbstractionObserver]: Analyzing ICFG safe030_rmo.opt.i [2020-10-21 23:08:39,471 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-21 23:08:39,471 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-21 23:08:39,479 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-21 23:08:39,480 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-21 23:08:39,513 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:08:39,514 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:08:39,514 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:08:39,514 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:08:39,515 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:08:39,515 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:08:39,515 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:08:39,515 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:08:39,515 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:08:39,516 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:08:39,516 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:08:39,516 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:08:39,516 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:08:39,516 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:08:39,517 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:08:39,517 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:08:39,517 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:08:39,517 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:08:39,518 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:08:39,518 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:08:39,518 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:08:39,519 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:08:39,519 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:08:39,519 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:08:39,519 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:08:39,519 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:08:39,520 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:08:39,520 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:08:39,520 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:08:39,520 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:08:39,520 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:08:39,520 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:08:39,521 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:08:39,521 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:08:39,521 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:08:39,521 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:08:39,522 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:08:39,522 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:08:39,522 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:08:39,522 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:08:39,523 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:08:39,523 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:08:39,527 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:08:39,527 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:08:39,527 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:08:39,527 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:08:39,528 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:08:39,528 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:08:39,528 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:08:39,528 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:08:39,528 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:08:39,529 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:08:39,529 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:08:39,529 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:08:39,529 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:08:39,529 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:08:39,532 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:08:39,532 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:08:39,532 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:08:39,532 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:08:39,536 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:08:39,537 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:08:39,537 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:08:39,537 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:08:39,537 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:08:39,538 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:08:39,538 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:08:39,538 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:08:39,538 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:08:39,538 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:08:39,540 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-10-21 23:08:39,555 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-10-21 23:08:39,577 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-21 23:08:39,577 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-21 23:08:39,578 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-21 23:08:39,578 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-21 23:08:39,578 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-21 23:08:39,578 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-21 23:08:39,578 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-21 23:08:39,578 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-21 23:08:39,594 INFO L137 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2020-10-21 23:08:39,594 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 106 places, 99 transitions, 213 flow [2020-10-21 23:08:39,597 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 106 places, 99 transitions, 213 flow [2020-10-21 23:08:39,600 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 106 places, 99 transitions, 213 flow [2020-10-21 23:08:39,650 INFO L129 PetriNetUnfolder]: 3/96 cut-off events. [2020-10-21 23:08:39,651 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-21 23:08:39,656 INFO L80 FinitePrefix]: Finished finitePrefix Result has 106 conditions, 96 events. 3/96 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 75 event pairs, 0 based on Foata normal form. 0/91 useless extension candidates. Maximal degree in co-relation 64. Up to 2 conditions per place. [2020-10-21 23:08:39,660 INFO L116 LiptonReduction]: Number of co-enabled transitions 1746 [2020-10-21 23:08:41,158 WARN L193 SmtUtils]: Spent 1.35 s on a formula simplification. DAG size of input: 226 DAG size of output: 186 [2020-10-21 23:08:41,199 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 2, 2, 1] term [2020-10-21 23:08:41,199 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 23:08:41,202 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-21 23:08:41,203 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 23:08:42,064 WARN L193 SmtUtils]: Spent 833.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 122 [2020-10-21 23:08:42,694 WARN L193 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-10-21 23:08:44,665 WARN L193 SmtUtils]: Spent 828.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 124 [2020-10-21 23:08:45,303 WARN L193 SmtUtils]: Spent 633.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 120 [2020-10-21 23:08:45,913 WARN L193 SmtUtils]: Spent 607.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 107 [2020-10-21 23:08:46,210 WARN L193 SmtUtils]: Spent 293.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2020-10-21 23:08:46,851 WARN L193 SmtUtils]: Spent 637.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 107 [2020-10-21 23:08:47,158 WARN L193 SmtUtils]: Spent 304.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2020-10-21 23:08:47,593 WARN L193 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 101 [2020-10-21 23:08:47,733 WARN L193 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2020-10-21 23:08:48,152 WARN L193 SmtUtils]: Spent 414.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2020-10-21 23:08:48,485 WARN L193 SmtUtils]: Spent 329.00 ms on a formula simplification that was a NOOP. DAG size: 132 [2020-10-21 23:08:48,932 WARN L193 SmtUtils]: Spent 425.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 110 [2020-10-21 23:08:49,123 WARN L193 SmtUtils]: Spent 186.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2020-10-21 23:08:49,129 INFO L131 LiptonReduction]: Checked pairs total: 4589 [2020-10-21 23:08:49,130 INFO L133 LiptonReduction]: Total number of compositions: 92 [2020-10-21 23:08:49,137 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 35 places, 25 transitions, 65 flow [2020-10-21 23:08:49,184 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 650 states. [2020-10-21 23:08:49,187 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states. [2020-10-21 23:08:49,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-10-21 23:08:49,194 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:08:49,195 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:08:49,196 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:08:49,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:08:49,202 INFO L82 PathProgramCache]: Analyzing trace with hash -1733301844, now seen corresponding path program 1 times [2020-10-21 23:08:49,213 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:08:49,213 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056255405] [2020-10-21 23:08:49,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:08:49,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:08:49,493 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:08:49,494 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056255405] [2020-10-21 23:08:49,495 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:08:49,495 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-21 23:08:49,496 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436568690] [2020-10-21 23:08:49,506 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-21 23:08:49,506 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:08:49,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-21 23:08:49,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-21 23:08:49,524 INFO L87 Difference]: Start difference. First operand 650 states. Second operand 3 states. [2020-10-21 23:08:49,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:08:49,623 INFO L93 Difference]: Finished difference Result 550 states and 1693 transitions. [2020-10-21 23:08:49,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-21 23:08:49,626 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2020-10-21 23:08:49,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:08:49,652 INFO L225 Difference]: With dead ends: 550 [2020-10-21 23:08:49,653 INFO L226 Difference]: Without dead ends: 450 [2020-10-21 23:08:49,654 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:08:49,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2020-10-21 23:08:49,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 450. [2020-10-21 23:08:49,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 450 states. [2020-10-21 23:08:49,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 1358 transitions. [2020-10-21 23:08:49,775 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 1358 transitions. Word has length 7 [2020-10-21 23:08:49,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:08:49,777 INFO L481 AbstractCegarLoop]: Abstraction has 450 states and 1358 transitions. [2020-10-21 23:08:49,777 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-21 23:08:49,777 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 1358 transitions. [2020-10-21 23:08:49,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-21 23:08:49,778 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:08:49,779 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:08:49,779 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-21 23:08:49,779 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:08:49,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:08:49,780 INFO L82 PathProgramCache]: Analyzing trace with hash 744298320, now seen corresponding path program 1 times [2020-10-21 23:08:49,780 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:08:49,780 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682175039] [2020-10-21 23:08:49,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:08:49,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:08:49,913 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:08:49,913 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682175039] [2020-10-21 23:08:49,914 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:08:49,914 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-21 23:08:49,914 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872875706] [2020-10-21 23:08:49,916 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-21 23:08:49,916 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:08:49,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-21 23:08:49,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-21 23:08:49,917 INFO L87 Difference]: Start difference. First operand 450 states and 1358 transitions. Second operand 3 states. [2020-10-21 23:08:49,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:08:49,950 INFO L93 Difference]: Finished difference Result 445 states and 1339 transitions. [2020-10-21 23:08:49,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-21 23:08:49,951 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-10-21 23:08:49,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:08:49,956 INFO L225 Difference]: With dead ends: 445 [2020-10-21 23:08:49,956 INFO L226 Difference]: Without dead ends: 445 [2020-10-21 23:08:49,957 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:08:49,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2020-10-21 23:08:49,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 445. [2020-10-21 23:08:49,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 445 states. [2020-10-21 23:08:49,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 1339 transitions. [2020-10-21 23:08:49,985 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 1339 transitions. Word has length 9 [2020-10-21 23:08:49,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:08:49,985 INFO L481 AbstractCegarLoop]: Abstraction has 445 states and 1339 transitions. [2020-10-21 23:08:49,985 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-21 23:08:49,986 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 1339 transitions. [2020-10-21 23:08:49,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-10-21 23:08:49,987 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:08:49,987 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:08:49,987 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-21 23:08:49,988 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:08:49,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:08:49,988 INFO L82 PathProgramCache]: Analyzing trace with hash -116742298, now seen corresponding path program 1 times [2020-10-21 23:08:49,988 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:08:49,989 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117818597] [2020-10-21 23:08:49,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:08:50,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:08:50,069 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:08:50,069 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117818597] [2020-10-21 23:08:50,069 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:08:50,070 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-21 23:08:50,070 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189637179] [2020-10-21 23:08:50,070 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-21 23:08:50,071 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:08:50,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-21 23:08:50,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-21 23:08:50,071 INFO L87 Difference]: Start difference. First operand 445 states and 1339 transitions. Second operand 3 states. [2020-10-21 23:08:50,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:08:50,098 INFO L93 Difference]: Finished difference Result 444 states and 1335 transitions. [2020-10-21 23:08:50,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-21 23:08:50,103 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2020-10-21 23:08:50,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:08:50,108 INFO L225 Difference]: With dead ends: 444 [2020-10-21 23:08:50,108 INFO L226 Difference]: Without dead ends: 444 [2020-10-21 23:08:50,108 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:08:50,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2020-10-21 23:08:50,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 444. [2020-10-21 23:08:50,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 444 states. [2020-10-21 23:08:50,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 1335 transitions. [2020-10-21 23:08:50,127 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 1335 transitions. Word has length 10 [2020-10-21 23:08:50,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:08:50,127 INFO L481 AbstractCegarLoop]: Abstraction has 444 states and 1335 transitions. [2020-10-21 23:08:50,128 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-21 23:08:50,128 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 1335 transitions. [2020-10-21 23:08:50,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-10-21 23:08:50,129 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:08:50,130 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:08:50,130 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-21 23:08:50,130 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:08:50,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:08:50,131 INFO L82 PathProgramCache]: Analyzing trace with hash 1598410391, now seen corresponding path program 1 times [2020-10-21 23:08:50,131 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:08:50,131 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490775781] [2020-10-21 23:08:50,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:08:50,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:08:50,197 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:08:50,197 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490775781] [2020-10-21 23:08:50,198 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:08:50,198 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-21 23:08:50,198 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294737887] [2020-10-21 23:08:50,198 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-21 23:08:50,198 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:08:50,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-21 23:08:50,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-21 23:08:50,199 INFO L87 Difference]: Start difference. First operand 444 states and 1335 transitions. Second operand 3 states. [2020-10-21 23:08:50,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:08:50,216 INFO L93 Difference]: Finished difference Result 436 states and 1305 transitions. [2020-10-21 23:08:50,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-21 23:08:50,217 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2020-10-21 23:08:50,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:08:50,221 INFO L225 Difference]: With dead ends: 436 [2020-10-21 23:08:50,221 INFO L226 Difference]: Without dead ends: 436 [2020-10-21 23:08:50,221 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:08:50,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2020-10-21 23:08:50,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 436. [2020-10-21 23:08:50,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 436 states. [2020-10-21 23:08:50,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 1305 transitions. [2020-10-21 23:08:50,237 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 1305 transitions. Word has length 10 [2020-10-21 23:08:50,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:08:50,238 INFO L481 AbstractCegarLoop]: Abstraction has 436 states and 1305 transitions. [2020-10-21 23:08:50,238 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-21 23:08:50,238 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 1305 transitions. [2020-10-21 23:08:50,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-21 23:08:50,239 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:08:50,240 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:08:50,240 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-21 23:08:50,240 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:08:50,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:08:50,240 INFO L82 PathProgramCache]: Analyzing trace with hash 675955071, now seen corresponding path program 1 times [2020-10-21 23:08:50,241 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:08:50,241 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342226037] [2020-10-21 23:08:50,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:08:50,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:08:50,350 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:08:50,350 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342226037] [2020-10-21 23:08:50,350 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:08:50,350 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-21 23:08:50,351 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664366784] [2020-10-21 23:08:50,351 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-21 23:08:50,351 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:08:50,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-21 23:08:50,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-21 23:08:50,352 INFO L87 Difference]: Start difference. First operand 436 states and 1305 transitions. Second operand 4 states. [2020-10-21 23:08:50,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:08:50,394 INFO L93 Difference]: Finished difference Result 431 states and 1287 transitions. [2020-10-21 23:08:50,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-21 23:08:50,395 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2020-10-21 23:08:50,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:08:50,399 INFO L225 Difference]: With dead ends: 431 [2020-10-21 23:08:50,399 INFO L226 Difference]: Without dead ends: 431 [2020-10-21 23:08:50,400 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:08:50,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2020-10-21 23:08:50,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 431. [2020-10-21 23:08:50,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 431 states. [2020-10-21 23:08:50,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 1287 transitions. [2020-10-21 23:08:50,414 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 1287 transitions. Word has length 11 [2020-10-21 23:08:50,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:08:50,414 INFO L481 AbstractCegarLoop]: Abstraction has 431 states and 1287 transitions. [2020-10-21 23:08:50,414 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-21 23:08:50,415 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 1287 transitions. [2020-10-21 23:08:50,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-21 23:08:50,416 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:08:50,416 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:08:50,416 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-21 23:08:50,416 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:08:50,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:08:50,417 INFO L82 PathProgramCache]: Analyzing trace with hash -1988886418, now seen corresponding path program 1 times [2020-10-21 23:08:50,417 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:08:50,417 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183855902] [2020-10-21 23:08:50,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:08:50,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:08:50,458 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:08:50,459 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183855902] [2020-10-21 23:08:50,459 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:08:50,459 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-21 23:08:50,460 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356034992] [2020-10-21 23:08:50,460 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-21 23:08:50,460 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:08:50,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-21 23:08:50,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-21 23:08:50,461 INFO L87 Difference]: Start difference. First operand 431 states and 1287 transitions. Second operand 3 states. [2020-10-21 23:08:50,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:08:50,477 INFO L93 Difference]: Finished difference Result 427 states and 1272 transitions. [2020-10-21 23:08:50,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-21 23:08:50,478 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2020-10-21 23:08:50,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:08:50,481 INFO L225 Difference]: With dead ends: 427 [2020-10-21 23:08:50,481 INFO L226 Difference]: Without dead ends: 427 [2020-10-21 23:08:50,482 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:08:50,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2020-10-21 23:08:50,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 427. [2020-10-21 23:08:50,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 427 states. [2020-10-21 23:08:50,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 1272 transitions. [2020-10-21 23:08:50,496 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 1272 transitions. Word has length 11 [2020-10-21 23:08:50,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:08:50,496 INFO L481 AbstractCegarLoop]: Abstraction has 427 states and 1272 transitions. [2020-10-21 23:08:50,496 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-21 23:08:50,496 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 1272 transitions. [2020-10-21 23:08:50,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-21 23:08:50,497 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:08:50,498 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:08:50,498 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-21 23:08:50,498 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:08:50,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:08:50,498 INFO L82 PathProgramCache]: Analyzing trace with hash -520232188, now seen corresponding path program 1 times [2020-10-21 23:08:50,499 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:08:50,499 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15580175] [2020-10-21 23:08:50,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:08:50,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:08:50,609 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:08:50,610 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15580175] [2020-10-21 23:08:50,610 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:08:50,610 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-21 23:08:50,610 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384566460] [2020-10-21 23:08:50,611 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-21 23:08:50,611 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:08:50,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-21 23:08:50,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-21 23:08:50,612 INFO L87 Difference]: Start difference. First operand 427 states and 1272 transitions. Second operand 5 states. [2020-10-21 23:08:50,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:08:50,704 INFO L93 Difference]: Finished difference Result 406 states and 1195 transitions. [2020-10-21 23:08:50,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-21 23:08:50,706 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-10-21 23:08:50,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:08:50,709 INFO L225 Difference]: With dead ends: 406 [2020-10-21 23:08:50,710 INFO L226 Difference]: Without dead ends: 406 [2020-10-21 23:08:50,710 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2020-10-21 23:08:50,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2020-10-21 23:08:50,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 406. [2020-10-21 23:08:50,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 406 states. [2020-10-21 23:08:50,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 1195 transitions. [2020-10-21 23:08:50,726 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 1195 transitions. Word has length 12 [2020-10-21 23:08:50,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:08:50,726 INFO L481 AbstractCegarLoop]: Abstraction has 406 states and 1195 transitions. [2020-10-21 23:08:50,726 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-21 23:08:50,727 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 1195 transitions. [2020-10-21 23:08:50,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-21 23:08:50,728 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:08:50,728 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:08:50,728 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-21 23:08:50,728 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:08:50,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:08:50,729 INFO L82 PathProgramCache]: Analyzing trace with hash 1052695262, now seen corresponding path program 1 times [2020-10-21 23:08:50,762 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:08:50,762 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909118862] [2020-10-21 23:08:50,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:08:50,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:08:50,912 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:08:50,912 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909118862] [2020-10-21 23:08:50,913 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:08:50,914 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-21 23:08:50,914 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469863243] [2020-10-21 23:08:50,915 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-21 23:08:50,915 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:08:50,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-21 23:08:50,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-21 23:08:50,916 INFO L87 Difference]: Start difference. First operand 406 states and 1195 transitions. Second operand 5 states. [2020-10-21 23:08:50,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:08:50,996 INFO L93 Difference]: Finished difference Result 404 states and 1187 transitions. [2020-10-21 23:08:50,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-21 23:08:50,997 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-10-21 23:08:50,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:08:51,000 INFO L225 Difference]: With dead ends: 404 [2020-10-21 23:08:51,001 INFO L226 Difference]: Without dead ends: 404 [2020-10-21 23:08:51,001 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2020-10-21 23:08:51,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2020-10-21 23:08:51,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 400. [2020-10-21 23:08:51,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 400 states. [2020-10-21 23:08:51,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 1176 transitions. [2020-10-21 23:08:51,016 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 1176 transitions. Word has length 13 [2020-10-21 23:08:51,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:08:51,016 INFO L481 AbstractCegarLoop]: Abstraction has 400 states and 1176 transitions. [2020-10-21 23:08:51,016 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-21 23:08:51,017 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 1176 transitions. [2020-10-21 23:08:51,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-21 23:08:51,018 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:08:51,018 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:08:51,018 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-21 23:08:51,018 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:08:51,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:08:51,019 INFO L82 PathProgramCache]: Analyzing trace with hash -59459315, now seen corresponding path program 1 times [2020-10-21 23:08:51,019 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:08:51,019 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523670268] [2020-10-21 23:08:51,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:08:51,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:08:51,078 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:08:51,079 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523670268] [2020-10-21 23:08:51,079 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:08:51,079 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-21 23:08:51,080 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984771645] [2020-10-21 23:08:51,080 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-21 23:08:51,080 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:08:51,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-21 23:08:51,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-21 23:08:51,081 INFO L87 Difference]: Start difference. First operand 400 states and 1176 transitions. Second operand 5 states. [2020-10-21 23:08:51,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:08:51,152 INFO L93 Difference]: Finished difference Result 543 states and 1554 transitions. [2020-10-21 23:08:51,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-21 23:08:51,153 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-10-21 23:08:51,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:08:51,157 INFO L225 Difference]: With dead ends: 543 [2020-10-21 23:08:51,157 INFO L226 Difference]: Without dead ends: 408 [2020-10-21 23:08:51,157 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-21 23:08:51,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2020-10-21 23:08:51,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 390. [2020-10-21 23:08:51,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-10-21 23:08:51,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1098 transitions. [2020-10-21 23:08:51,173 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1098 transitions. Word has length 13 [2020-10-21 23:08:51,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:08:51,173 INFO L481 AbstractCegarLoop]: Abstraction has 390 states and 1098 transitions. [2020-10-21 23:08:51,173 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-21 23:08:51,173 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1098 transitions. [2020-10-21 23:08:51,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-21 23:08:51,175 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:08:51,175 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:08:51,175 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-21 23:08:51,175 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:08:51,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:08:51,176 INFO L82 PathProgramCache]: Analyzing trace with hash -1726992605, now seen corresponding path program 1 times [2020-10-21 23:08:51,176 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:08:51,176 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908052238] [2020-10-21 23:08:51,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:08:51,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:08:51,297 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:08:51,297 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908052238] [2020-10-21 23:08:51,297 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:08:51,298 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-21 23:08:51,298 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943703643] [2020-10-21 23:08:51,298 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-21 23:08:51,298 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:08:51,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-21 23:08:51,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-10-21 23:08:51,299 INFO L87 Difference]: Start difference. First operand 390 states and 1098 transitions. Second operand 6 states. [2020-10-21 23:08:51,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:08:51,371 INFO L93 Difference]: Finished difference Result 468 states and 1279 transitions. [2020-10-21 23:08:51,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-21 23:08:51,372 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2020-10-21 23:08:51,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:08:51,374 INFO L225 Difference]: With dead ends: 468 [2020-10-21 23:08:51,375 INFO L226 Difference]: Without dead ends: 270 [2020-10-21 23:08:51,375 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-10-21 23:08:51,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2020-10-21 23:08:51,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 252. [2020-10-21 23:08:51,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2020-10-21 23:08:51,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 673 transitions. [2020-10-21 23:08:51,384 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 673 transitions. Word has length 14 [2020-10-21 23:08:51,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:08:51,384 INFO L481 AbstractCegarLoop]: Abstraction has 252 states and 673 transitions. [2020-10-21 23:08:51,384 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-21 23:08:51,385 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 673 transitions. [2020-10-21 23:08:51,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-21 23:08:51,385 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:08:51,386 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:08:51,386 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-21 23:08:51,386 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:08:51,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:08:51,387 INFO L82 PathProgramCache]: Analyzing trace with hash -1843206923, now seen corresponding path program 1 times [2020-10-21 23:08:51,387 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:08:51,387 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825045384] [2020-10-21 23:08:51,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:08:51,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:08:51,488 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:08:51,489 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825045384] [2020-10-21 23:08:51,489 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:08:51,489 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-21 23:08:51,489 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731894607] [2020-10-21 23:08:51,490 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-21 23:08:51,490 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:08:51,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-21 23:08:51,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-21 23:08:51,491 INFO L87 Difference]: Start difference. First operand 252 states and 673 transitions. Second operand 4 states. [2020-10-21 23:08:51,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:08:51,534 INFO L93 Difference]: Finished difference Result 251 states and 586 transitions. [2020-10-21 23:08:51,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-21 23:08:51,535 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2020-10-21 23:08:51,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:08:51,536 INFO L225 Difference]: With dead ends: 251 [2020-10-21 23:08:51,536 INFO L226 Difference]: Without dead ends: 181 [2020-10-21 23:08:51,537 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:08:51,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2020-10-21 23:08:51,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2020-10-21 23:08:51,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2020-10-21 23:08:51,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 411 transitions. [2020-10-21 23:08:51,543 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 411 transitions. Word has length 14 [2020-10-21 23:08:51,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:08:51,543 INFO L481 AbstractCegarLoop]: Abstraction has 181 states and 411 transitions. [2020-10-21 23:08:51,543 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-21 23:08:51,543 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 411 transitions. [2020-10-21 23:08:51,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-21 23:08:51,544 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:08:51,544 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:08:51,544 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-21 23:08:51,544 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:08:51,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:08:51,545 INFO L82 PathProgramCache]: Analyzing trace with hash -1437373817, now seen corresponding path program 1 times [2020-10-21 23:08:51,545 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:08:51,545 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413067143] [2020-10-21 23:08:51,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:08:51,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:08:51,670 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:08:51,671 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413067143] [2020-10-21 23:08:51,671 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:08:51,671 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-21 23:08:51,671 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405481880] [2020-10-21 23:08:51,672 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-21 23:08:51,672 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:08:51,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-21 23:08:51,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-21 23:08:51,672 INFO L87 Difference]: Start difference. First operand 181 states and 411 transitions. Second operand 5 states. [2020-10-21 23:08:51,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:08:51,716 INFO L93 Difference]: Finished difference Result 150 states and 302 transitions. [2020-10-21 23:08:51,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-21 23:08:51,717 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2020-10-21 23:08:51,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:08:51,718 INFO L225 Difference]: With dead ends: 150 [2020-10-21 23:08:51,718 INFO L226 Difference]: Without dead ends: 112 [2020-10-21 23:08:51,719 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:08:51,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2020-10-21 23:08:51,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2020-10-21 23:08:51,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2020-10-21 23:08:51,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 216 transitions. [2020-10-21 23:08:51,725 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 216 transitions. Word has length 15 [2020-10-21 23:08:51,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:08:51,726 INFO L481 AbstractCegarLoop]: Abstraction has 112 states and 216 transitions. [2020-10-21 23:08:51,726 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-21 23:08:51,726 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 216 transitions. [2020-10-21 23:08:51,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-21 23:08:51,727 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:08:51,727 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:08:51,727 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-21 23:08:51,727 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:08:51,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:08:51,728 INFO L82 PathProgramCache]: Analyzing trace with hash -890637055, now seen corresponding path program 1 times [2020-10-21 23:08:51,728 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:08:51,729 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558805] [2020-10-21 23:08:51,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:08:51,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:08:51,842 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:08:51,842 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558805] [2020-10-21 23:08:51,843 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:08:51,843 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-21 23:08:51,844 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670987999] [2020-10-21 23:08:51,845 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-21 23:08:51,845 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:08:51,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-21 23:08:51,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-21 23:08:51,846 INFO L87 Difference]: Start difference. First operand 112 states and 216 transitions. Second operand 5 states. [2020-10-21 23:08:51,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:08:51,871 INFO L93 Difference]: Finished difference Result 151 states and 281 transitions. [2020-10-21 23:08:51,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-21 23:08:51,872 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-10-21 23:08:51,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:08:51,872 INFO L225 Difference]: With dead ends: 151 [2020-10-21 23:08:51,873 INFO L226 Difference]: Without dead ends: 109 [2020-10-21 23:08:51,873 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-21 23:08:51,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2020-10-21 23:08:51,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 107. [2020-10-21 23:08:51,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2020-10-21 23:08:51,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 190 transitions. [2020-10-21 23:08:51,877 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 190 transitions. Word has length 16 [2020-10-21 23:08:51,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:08:51,878 INFO L481 AbstractCegarLoop]: Abstraction has 107 states and 190 transitions. [2020-10-21 23:08:51,878 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-21 23:08:51,878 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 190 transitions. [2020-10-21 23:08:51,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-21 23:08:51,879 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:08:51,879 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:08:51,879 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-21 23:08:51,879 INFO L429 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:08:51,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:08:51,879 INFO L82 PathProgramCache]: Analyzing trace with hash -1839945916, now seen corresponding path program 1 times [2020-10-21 23:08:51,880 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:08:51,881 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764018652] [2020-10-21 23:08:51,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:08:51,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:08:51,989 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:08:51,990 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764018652] [2020-10-21 23:08:51,990 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:08:51,991 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-21 23:08:51,991 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51115673] [2020-10-21 23:08:51,991 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-21 23:08:51,991 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:08:51,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-21 23:08:51,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-21 23:08:51,992 INFO L87 Difference]: Start difference. First operand 107 states and 190 transitions. Second operand 6 states. [2020-10-21 23:08:52,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:08:52,055 INFO L93 Difference]: Finished difference Result 93 states and 162 transitions. [2020-10-21 23:08:52,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-21 23:08:52,056 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2020-10-21 23:08:52,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:08:52,057 INFO L225 Difference]: With dead ends: 93 [2020-10-21 23:08:52,057 INFO L226 Difference]: Without dead ends: 35 [2020-10-21 23:08:52,057 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-10-21 23:08:52,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2020-10-21 23:08:52,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2020-10-21 23:08:52,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-10-21 23:08:52,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 52 transitions. [2020-10-21 23:08:52,060 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 52 transitions. Word has length 17 [2020-10-21 23:08:52,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:08:52,060 INFO L481 AbstractCegarLoop]: Abstraction has 35 states and 52 transitions. [2020-10-21 23:08:52,060 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-21 23:08:52,060 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 52 transitions. [2020-10-21 23:08:52,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-21 23:08:52,061 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:08:52,061 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:08:52,061 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-21 23:08:52,061 INFO L429 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:08:52,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:08:52,062 INFO L82 PathProgramCache]: Analyzing trace with hash -1539901826, now seen corresponding path program 1 times [2020-10-21 23:08:52,062 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:08:52,062 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045916394] [2020-10-21 23:08:52,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:08:52,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-21 23:08:52,109 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-21 23:08:52,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-21 23:08:52,165 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-21 23:08:52,222 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-21 23:08:52,223 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-21 23:08:52,223 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-21 23:08:52,224 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-21 23:08:52,244 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [960] [960] L820-->L827: Formula: (let ((.cse7 (= (mod ~y$w_buff0_used~0_In1245822505 256) 0)) (.cse6 (= (mod ~y$r_buff0_thd0~0_In1245822505 256) 0)) (.cse9 (= (mod ~y$w_buff1_used~0_In1245822505 256) 0)) (.cse8 (= (mod ~y$r_buff1_thd0~0_In1245822505 256) 0))) (let ((.cse5 (or .cse9 .cse8)) (.cse3 (not .cse9)) (.cse4 (not .cse8)) (.cse2 (or .cse7 .cse6)) (.cse0 (not .cse7)) (.cse1 (not .cse6))) (and (or (and (= ~y$w_buff0~0_In1245822505 ~y~0_Out1245822505) .cse0 .cse1) (and .cse2 (or (and (= ~y$w_buff1~0_In1245822505 ~y~0_Out1245822505) .cse3 .cse4) (and .cse5 (= ~y~0_In1245822505 ~y~0_Out1245822505))))) (or (and .cse5 (= ~y$w_buff1_used~0_Out1245822505 ~y$w_buff1_used~0_In1245822505)) (and .cse3 (= ~y$w_buff1_used~0_Out1245822505 0) .cse4)) (= ~y$r_buff0_thd0~0_Out1245822505 ~y$r_buff0_thd0~0_In1245822505) (= ULTIMATE.start_assume_abort_if_not_~cond_Out1245822505 |ULTIMATE.start_assume_abort_if_not_#in~cond_In1245822505|) (= ~y$r_buff1_thd0~0_In1245822505 ~y$r_buff1_thd0~0_Out1245822505) (or (and .cse2 (= ~y$w_buff0_used~0_In1245822505 ~y$w_buff0_used~0_Out1245822505)) (and .cse0 (= ~y$w_buff0_used~0_Out1245822505 0) .cse1)) (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out1245822505 0))))) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In1245822505|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1245822505, ~y$w_buff1~0=~y$w_buff1~0_In1245822505, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1245822505, ~y$w_buff0~0=~y$w_buff0~0_In1245822505, ~y~0=~y~0_In1245822505, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1245822505, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1245822505} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_Out1245822505, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out1245822505|, ULTIMATE.start_main_#t~ite25=|ULTIMATE.start_main_#t~ite25_Out1245822505|, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out1245822505|, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out1245822505|, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out1245822505|, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out1245822505|, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In1245822505|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out1245822505, ~y$w_buff1~0=~y$w_buff1~0_In1245822505, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_Out1245822505, ~y$w_buff0~0=~y$w_buff0~0_In1245822505, ~y~0=~y~0_Out1245822505, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out1245822505, ~y$w_buff1_used~0=~y$w_buff1_used~0_Out1245822505} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond, ~y$w_buff0_used~0, ~y$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite25, ULTIMATE.start_main_#t~ite20, ~y~0, ULTIMATE.start_main_#t~ite21, ~y$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite23, ~y$w_buff1_used~0] because there is no mapped edge [2020-10-21 23:08:52,257 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:08:52,258 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:08:52,258 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:08:52,258 WARN L224 RCFGBacktranslator]: unable to determine which branch was taken at C: __VERIFIER_atomic_begin() [773] [2020-10-21 23:08:52,260 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:08:52,260 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:08:52,261 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:08:52,261 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:08:52,261 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:08:52,261 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:08:52,262 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:08:52,262 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:08:52,263 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:08:52,263 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:08:52,263 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:08:52,263 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:08:52,264 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:08:52,264 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:08:52,264 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:08:52,264 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:08:52,265 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:08:52,265 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:08:52,265 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:08:52,266 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:08:52,266 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:08:52,266 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:08:52,266 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:08:52,266 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:08:52,268 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:08:52,268 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:08:52,269 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:08:52,269 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:08:52,269 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:08:52,269 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:08:52,269 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:08:52,270 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:08:52,275 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:08:52,275 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:08:52,275 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:08:52,275 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:08:52,275 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:08:52,276 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:08:52,276 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:08:52,276 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:08:52,276 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:08:52,276 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:08:52,276 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:08:52,277 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:08:52,277 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:08:52,277 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:08:52,277 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:08:52,277 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:08:52,386 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.10 11:08:52 BasicIcfg [2020-10-21 23:08:52,386 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-21 23:08:52,388 INFO L168 Benchmark]: Toolchain (without parser) took 16097.29 ms. Allocated memory was 139.5 MB in the beginning and 354.4 MB in the end (delta: 215.0 MB). Free memory was 100.5 MB in the beginning and 108.9 MB in the end (delta: -8.4 MB). Peak memory consumption was 206.6 MB. Max. memory is 7.1 GB. [2020-10-21 23:08:52,391 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 139.5 MB. Free memory was 121.0 MB in the beginning and 120.6 MB in the end (delta: 419.5 kB). Peak memory consumption was 419.5 kB. Max. memory is 7.1 GB. [2020-10-21 23:08:52,392 INFO L168 Benchmark]: CACSL2BoogieTranslator took 878.84 ms. Allocated memory was 139.5 MB in the beginning and 202.4 MB in the end (delta: 62.9 MB). Free memory was 99.7 MB in the beginning and 153.4 MB in the end (delta: -53.7 MB). Peak memory consumption was 22.8 MB. Max. memory is 7.1 GB. [2020-10-21 23:08:52,393 INFO L168 Benchmark]: Boogie Procedure Inliner took 76.53 ms. Allocated memory is still 202.4 MB. Free memory was 153.4 MB in the beginning and 149.4 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 7.1 GB. [2020-10-21 23:08:52,394 INFO L168 Benchmark]: Boogie Preprocessor took 42.14 ms. Allocated memory is still 202.4 MB. Free memory was 149.4 MB in the beginning and 147.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2020-10-21 23:08:52,398 INFO L168 Benchmark]: RCFGBuilder took 2150.85 ms. Allocated memory was 202.4 MB in the beginning and 249.6 MB in the end (delta: 47.2 MB). Free memory was 147.4 MB in the beginning and 189.4 MB in the end (delta: -41.9 MB). Peak memory consumption was 101.7 MB. Max. memory is 7.1 GB. [2020-10-21 23:08:52,399 INFO L168 Benchmark]: TraceAbstraction took 12935.60 ms. Allocated memory was 249.6 MB in the beginning and 354.4 MB in the end (delta: 104.9 MB). Free memory was 189.4 MB in the beginning and 108.9 MB in the end (delta: 80.5 MB). Peak memory consumption was 185.3 MB. Max. memory is 7.1 GB. [2020-10-21 23:08:52,406 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.18 ms. Allocated memory is still 139.5 MB. Free memory was 121.0 MB in the beginning and 120.6 MB in the end (delta: 419.5 kB). Peak memory consumption was 419.5 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 878.84 ms. Allocated memory was 139.5 MB in the beginning and 202.4 MB in the end (delta: 62.9 MB). Free memory was 99.7 MB in the beginning and 153.4 MB in the end (delta: -53.7 MB). Peak memory consumption was 22.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 76.53 ms. Allocated memory is still 202.4 MB. Free memory was 153.4 MB in the beginning and 149.4 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 42.14 ms. Allocated memory is still 202.4 MB. Free memory was 149.4 MB in the beginning and 147.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2150.85 ms. Allocated memory was 202.4 MB in the beginning and 249.6 MB in the end (delta: 47.2 MB). Free memory was 147.4 MB in the beginning and 189.4 MB in the end (delta: -41.9 MB). Peak memory consumption was 101.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 12935.60 ms. Allocated memory was 249.6 MB in the beginning and 354.4 MB in the end (delta: 104.9 MB). Free memory was 189.4 MB in the beginning and 108.9 MB in the end (delta: 80.5 MB). Peak memory consumption was 185.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 932 VarBasedMoverChecksPositive, 39 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 66 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 9.5s, 106 PlacesBefore, 35 PlacesAfterwards, 99 TransitionsBefore, 25 TransitionsAfterwards, 1746 CoEnabledTransitionPairs, 7 FixpointIterations, 34 TrivialSequentialCompositions, 45 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 3 ChoiceCompositions, 92 TotalNumberOfCompositions, 4589 MoverChecksTotal - CounterExampleResult [Line: 17]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L710] 0 _Bool main$tmp_guard0; [L711] 0 _Bool main$tmp_guard1; [L713] 0 int x = 0; [L715] 0 int y = 0; [L716] 0 _Bool y$flush_delayed; [L717] 0 int y$mem_tmp; [L718] 0 _Bool y$r_buff0_thd0; [L719] 0 _Bool y$r_buff0_thd1; [L720] 0 _Bool y$r_buff0_thd2; [L721] 0 _Bool y$r_buff0_thd3; [L722] 0 _Bool y$r_buff1_thd0; [L723] 0 _Bool y$r_buff1_thd1; [L724] 0 _Bool y$r_buff1_thd2; [L725] 0 _Bool y$r_buff1_thd3; [L726] 0 _Bool y$read_delayed; [L727] 0 int *y$read_delayed_var; [L728] 0 int y$w_buff0; [L729] 0 _Bool y$w_buff0_used; [L730] 0 int y$w_buff1; [L731] 0 _Bool y$w_buff1_used; [L733] 0 int z = 0; [L734] 0 _Bool weak$$choice0; [L735] 0 _Bool weak$$choice2; [L811] 0 pthread_t t2504; [L812] FCALL, FORK 0 pthread_create(&t2504, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L813] 0 pthread_t t2505; [L814] FCALL, FORK 0 pthread_create(&t2505, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L815] 0 pthread_t t2506; [L816] FCALL, FORK 0 pthread_create(&t2506, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L774] 3 y$w_buff1 = y$w_buff0 [L775] 3 y$w_buff0 = 2 [L776] 3 y$w_buff1_used = y$w_buff0_used [L777] 3 y$w_buff0_used = (_Bool)1 [L18] COND TRUE 3 !expression [L17] COND FALSE 3 !(0) [L17] 3 __assert_fail ("0", "safe030_rmo.opt.c", 8, __extension__ __PRETTY_FUNCTION__) [L779] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L780] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L781] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L782] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L783] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L786] 3 z = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L739] 1 z = 2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L742] 1 x = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L747] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L749] 1 return 0; [L754] 2 x = 2 VAL [\result={0:0}, __unbuffered_cnt=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L757] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L760] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L760] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L760] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L760] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L761] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L761] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L762] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L762] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L763] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L763] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L764] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L764] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L767] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L769] 2 return 0; [L789] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L789] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L789] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L789] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L790] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L790] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L791] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L791] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L792] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L792] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L793] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L793] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L796] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L798] 3 return 0; [L818] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L829] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L830] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L831] 0 y$flush_delayed = weak$$choice2 [L832] 0 y$mem_tmp = y [L833] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L833] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1 [L833] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L833] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L834] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L834] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L835] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L835] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L836] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L836] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L837] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L837] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L837] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L837] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L838] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L838] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0) [L838] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L838] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0) [L838] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L838] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L839] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L839] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L840] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2) [L841] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L841] 0 y = y$flush_delayed ? y$mem_tmp : y [L842] 0 y$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "safe030_rmo.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 97 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 12.6s, OverallIterations: 15, TraceHistogramMax: 1, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 9.6s, HoareTripleCheckerStatistics: 285 SDtfs, 288 SDslu, 323 SDs, 0 SdLazy, 218 SolverSat, 67 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 44 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=650occurred 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.2s AutomataMinimizationTime, 14 MinimizatonAttempts, 42 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 192 NumberOfCodeBlocks, 192 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 158 ConstructedInterpolants, 0 QuantifiedInterpolants, 11924 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...