/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/mix030_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-1d1d2b5 [2020-10-21 22:57:46,875 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-21 22:57:46,878 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-21 22:57:46,918 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-21 22:57:46,919 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-21 22:57:46,926 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-21 22:57:46,929 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-21 22:57:46,933 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-21 22:57:46,935 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-21 22:57:46,938 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-21 22:57:46,939 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-21 22:57:46,940 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-21 22:57:46,940 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-21 22:57:46,943 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-21 22:57:46,945 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-21 22:57:46,946 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-21 22:57:46,948 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-21 22:57:46,949 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-21 22:57:46,950 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-21 22:57:46,957 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-21 22:57:46,960 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-21 22:57:46,961 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-21 22:57:46,962 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-21 22:57:46,963 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-21 22:57:46,975 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-21 22:57:46,975 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-21 22:57:46,976 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-21 22:57:46,982 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-21 22:57:46,982 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-21 22:57:46,987 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-21 22:57:46,988 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-21 22:57:46,988 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-21 22:57:46,989 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-21 22:57:46,990 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-21 22:57:46,990 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-21 22:57:46,991 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-21 22:57:46,991 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-21 22:57:46,991 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-21 22:57:46,992 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-21 22:57:46,994 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-21 22:57:46,995 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-21 22:57:46,996 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 22:57:47,033 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-21 22:57:47,033 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-21 22:57:47,035 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-21 22:57:47,035 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-21 22:57:47,036 INFO L138 SettingsManager]: * Use SBE=true [2020-10-21 22:57:47,036 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-21 22:57:47,037 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-21 22:57:47,037 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-21 22:57:47,037 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-21 22:57:47,038 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-21 22:57:47,039 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-21 22:57:47,039 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-21 22:57:47,039 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-21 22:57:47,039 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-21 22:57:47,040 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-21 22:57:47,040 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-21 22:57:47,040 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-21 22:57:47,040 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-21 22:57:47,041 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-21 22:57:47,041 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-21 22:57:47,041 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-21 22:57:47,041 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-21 22:57:47,042 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-21 22:57:47,042 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2020-10-21 22:57:47,042 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-21 22:57:47,042 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-21 22:57:47,042 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-21 22:57:47,043 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-10-21 22:57:47,043 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-21 22:57:47,366 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-21 22:57:47,387 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-21 22:57:47,391 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-21 22:57:47,393 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-21 22:57:47,395 INFO L275 PluginConnector]: CDTParser initialized [2020-10-21 22:57:47,396 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix030_pso.opt.i [2020-10-21 22:57:47,471 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/76d878040/15b2c2f34e8f4836aaaf433a978754e8/FLAGe68437641 [2020-10-21 22:57:47,995 INFO L306 CDTParser]: Found 1 translation units. [2020-10-21 22:57:47,996 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix030_pso.opt.i [2020-10-21 22:57:48,023 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/76d878040/15b2c2f34e8f4836aaaf433a978754e8/FLAGe68437641 [2020-10-21 22:57:48,309 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/76d878040/15b2c2f34e8f4836aaaf433a978754e8 [2020-10-21 22:57:48,319 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-21 22:57:48,326 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-21 22:57:48,328 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-21 22:57:48,328 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-21 22:57:48,331 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-21 22:57:48,332 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.10 10:57:48" (1/1) ... [2020-10-21 22:57:48,335 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6149eaa5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 10:57:48, skipping insertion in model container [2020-10-21 22:57:48,336 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.10 10:57:48" (1/1) ... [2020-10-21 22:57:48,343 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-21 22:57:48,388 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-21 22:57:48,957 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-21 22:57:48,972 INFO L203 MainTranslator]: Completed pre-run [2020-10-21 22:57:49,081 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-21 22:57:49,161 INFO L208 MainTranslator]: Completed translation [2020-10-21 22:57:49,162 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 10:57:49 WrapperNode [2020-10-21 22:57:49,162 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-21 22:57:49,163 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-21 22:57:49,163 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-21 22:57:49,163 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-21 22:57:49,171 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 10:57:49" (1/1) ... [2020-10-21 22:57:49,192 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 10:57:49" (1/1) ... [2020-10-21 22:57:49,227 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-21 22:57:49,228 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-21 22:57:49,228 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-21 22:57:49,228 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-21 22:57:49,237 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 10:57:49" (1/1) ... [2020-10-21 22:57:49,238 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 10:57:49" (1/1) ... [2020-10-21 22:57:49,243 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 10:57:49" (1/1) ... [2020-10-21 22:57:49,243 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 10:57:49" (1/1) ... [2020-10-21 22:57:49,255 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 10:57:49" (1/1) ... [2020-10-21 22:57:49,260 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 10:57:49" (1/1) ... [2020-10-21 22:57:49,264 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 10:57:49" (1/1) ... [2020-10-21 22:57:49,269 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-21 22:57:49,270 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-21 22:57:49,270 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-21 22:57:49,270 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-21 22:57:49,271 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 10:57:49" (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 22:57:49,350 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-21 22:57:49,351 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-21 22:57:49,351 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-21 22:57:49,351 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-21 22:57:49,352 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-21 22:57:49,352 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-21 22:57:49,352 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-21 22:57:49,352 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-21 22:57:49,352 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-21 22:57:49,353 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-21 22:57:49,353 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2020-10-21 22:57:49,353 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2020-10-21 22:57:49,353 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-21 22:57:49,354 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-21 22:57:49,354 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-21 22:57:49,354 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-21 22:57:49,357 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 22:57:51,471 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-21 22:57:51,471 INFO L298 CfgBuilder]: Removed 14 assume(true) statements. [2020-10-21 22:57:51,474 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.10 10:57:51 BoogieIcfgContainer [2020-10-21 22:57:51,474 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-21 22:57:51,476 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-21 22:57:51,476 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-21 22:57:51,480 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-21 22:57:51,481 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.10 10:57:48" (1/3) ... [2020-10-21 22:57:51,481 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a4e3f44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.10 10:57:51, skipping insertion in model container [2020-10-21 22:57:51,482 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 10:57:49" (2/3) ... [2020-10-21 22:57:51,482 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a4e3f44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.10 10:57:51, skipping insertion in model container [2020-10-21 22:57:51,482 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.10 10:57:51" (3/3) ... [2020-10-21 22:57:51,484 INFO L111 eAbstractionObserver]: Analyzing ICFG mix030_pso.opt.i [2020-10-21 22:57:51,497 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-21 22:57:51,498 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-21 22:57:51,508 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-21 22:57:51,509 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-21 22:57:51,542 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:57:51,542 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:57:51,543 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:57:51,543 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:57:51,543 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:57:51,543 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:57:51,544 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:57:51,544 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:57:51,544 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:57:51,544 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:57:51,544 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:57:51,545 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:57:51,545 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:57:51,545 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:57:51,545 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:57:51,545 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:57:51,545 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:57:51,546 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:57:51,546 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:57:51,547 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:57:51,547 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:57:51,547 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:57:51,547 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:57:51,547 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:57:51,548 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:57:51,548 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:57:51,548 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:57:51,548 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:57:51,548 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:57:51,549 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:57:51,549 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:57:51,549 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:57:51,549 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:57:51,549 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:57:51,549 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:57:51,550 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:57:51,550 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:57:51,550 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:57:51,550 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:57:51,550 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:57:51,551 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:57:51,551 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:57:51,552 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:57:51,552 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:57:51,552 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:57:51,552 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:57:51,552 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:57:51,553 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:57:51,553 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:57:51,553 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:57:51,553 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:57:51,553 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:57:51,553 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:57:51,554 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:57:51,554 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:57:51,558 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:57:51,558 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:57:51,558 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:57:51,559 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:57:51,563 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:57:51,563 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:57:51,563 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:57:51,563 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:57:51,563 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:57:51,564 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:57:51,564 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:57:51,564 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:57:51,564 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:57:51,564 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:57:51,566 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:57:51,566 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:57:51,566 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:57:51,566 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:57:51,567 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:57:51,567 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:57:51,567 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:57:51,567 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:57:51,567 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:57:51,568 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:57:51,568 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:57:51,568 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:57:51,568 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:57:51,568 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:57:51,570 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:57:51,570 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:57:51,570 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:57:51,570 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:57:51,571 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:57:51,571 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:57:51,571 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:57:51,571 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:57:51,571 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:57:51,572 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:57:51,573 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-10-21 22:57:51,587 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-10-21 22:57:51,610 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-21 22:57:51,610 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-21 22:57:51,610 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-21 22:57:51,610 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-21 22:57:51,610 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-21 22:57:51,611 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-21 22:57:51,611 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-21 22:57:51,611 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-21 22:57:51,627 INFO L137 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2020-10-21 22:57:51,628 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 129 places, 119 transitions, 258 flow [2020-10-21 22:57:51,631 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 129 places, 119 transitions, 258 flow [2020-10-21 22:57:51,633 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 129 places, 119 transitions, 258 flow [2020-10-21 22:57:51,692 INFO L129 PetriNetUnfolder]: 3/115 cut-off events. [2020-10-21 22:57:51,692 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-21 22:57:51,698 INFO L80 FinitePrefix]: Finished finitePrefix Result has 128 conditions, 115 events. 3/115 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 92 event pairs, 0 based on Foata normal form. 0/110 useless extension candidates. Maximal degree in co-relation 80. Up to 2 conditions per place. [2020-10-21 22:57:51,703 INFO L116 LiptonReduction]: Number of co-enabled transitions 2862 [2020-10-21 22:57:53,094 WARN L193 SmtUtils]: Spent 1.20 s on a formula simplification. DAG size of input: 230 DAG size of output: 190 [2020-10-21 22:57:53,137 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 2, 1] term [2020-10-21 22:57:53,138 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:57:53,140 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-21 22:57:53,141 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:57:54,398 WARN L193 SmtUtils]: Spent 1.24 s on a formula simplification. DAG size of input: 148 DAG size of output: 128 [2020-10-21 22:57:54,779 WARN L193 SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-10-21 22:57:54,886 WARN L193 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2020-10-21 22:57:56,002 WARN L193 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2020-10-21 22:57:56,112 WARN L193 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2020-10-21 22:57:56,869 WARN L193 SmtUtils]: Spent 371.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2020-10-21 22:57:57,259 WARN L193 SmtUtils]: Spent 387.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2020-10-21 22:57:58,570 WARN L193 SmtUtils]: Spent 1.06 s on a formula simplification. DAG size of input: 147 DAG size of output: 137 [2020-10-21 22:57:58,903 WARN L193 SmtUtils]: Spent 329.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2020-10-21 22:57:59,589 WARN L193 SmtUtils]: Spent 683.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 112 [2020-10-21 22:57:59,926 WARN L193 SmtUtils]: Spent 334.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2020-10-21 22:58:00,181 WARN L193 SmtUtils]: Spent 164.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2020-10-21 22:58:00,337 WARN L193 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2020-10-21 22:58:00,809 WARN L193 SmtUtils]: Spent 449.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 120 [2020-10-21 22:58:01,026 WARN L193 SmtUtils]: Spent 214.00 ms on a formula simplification that was a NOOP. DAG size: 116 [2020-10-21 22:58:01,040 INFO L131 LiptonReduction]: Checked pairs total: 8274 [2020-10-21 22:58:01,040 INFO L133 LiptonReduction]: Total number of compositions: 102 [2020-10-21 22:58:01,049 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 46 places, 33 transitions, 86 flow [2020-10-21 22:58:01,357 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 3890 states. [2020-10-21 22:58:01,359 INFO L276 IsEmpty]: Start isEmpty. Operand 3890 states. [2020-10-21 22:58:01,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-10-21 22:58:01,371 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 22:58:01,372 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-10-21 22:58:01,372 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 22:58:01,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 22:58:01,383 INFO L82 PathProgramCache]: Analyzing trace with hash -162394625, now seen corresponding path program 1 times [2020-10-21 22:58:01,395 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 22:58:01,396 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958202188] [2020-10-21 22:58:01,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 22:58:01,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 22:58:01,762 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 22:58:01,763 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958202188] [2020-10-21 22:58:01,764 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 22:58:01,765 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-21 22:58:01,766 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096501532] [2020-10-21 22:58:01,771 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-21 22:58:01,772 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 22:58:01,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-21 22:58:01,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-21 22:58:01,791 INFO L87 Difference]: Start difference. First operand 3890 states. Second operand 3 states. [2020-10-21 22:58:01,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 22:58:01,947 INFO L93 Difference]: Finished difference Result 3250 states and 12738 transitions. [2020-10-21 22:58:01,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-21 22:58:01,950 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2020-10-21 22:58:01,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 22:58:01,997 INFO L225 Difference]: With dead ends: 3250 [2020-10-21 22:58:01,997 INFO L226 Difference]: Without dead ends: 2650 [2020-10-21 22:58:01,999 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 22:58:02,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2650 states. [2020-10-21 22:58:02,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2650 to 2650. [2020-10-21 22:58:02,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2650 states. [2020-10-21 22:58:02,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2650 states to 2650 states and 10228 transitions. [2020-10-21 22:58:02,185 INFO L78 Accepts]: Start accepts. Automaton has 2650 states and 10228 transitions. Word has length 7 [2020-10-21 22:58:02,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 22:58:02,186 INFO L481 AbstractCegarLoop]: Abstraction has 2650 states and 10228 transitions. [2020-10-21 22:58:02,186 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-21 22:58:02,187 INFO L276 IsEmpty]: Start isEmpty. Operand 2650 states and 10228 transitions. [2020-10-21 22:58:02,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-21 22:58:02,190 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 22:58:02,190 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 22:58:02,190 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-21 22:58:02,191 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 22:58:02,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 22:58:02,191 INFO L82 PathProgramCache]: Analyzing trace with hash 1169447099, now seen corresponding path program 1 times [2020-10-21 22:58:02,191 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 22:58:02,192 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916116290] [2020-10-21 22:58:02,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 22:58:02,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 22:58:02,312 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 22:58:02,313 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916116290] [2020-10-21 22:58:02,313 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 22:58:02,313 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-21 22:58:02,314 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328985097] [2020-10-21 22:58:02,315 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-21 22:58:02,316 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 22:58:02,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-21 22:58:02,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-21 22:58:02,316 INFO L87 Difference]: Start difference. First operand 2650 states and 10228 transitions. Second operand 3 states. [2020-10-21 22:58:02,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 22:58:02,352 INFO L93 Difference]: Finished difference Result 2450 states and 9358 transitions. [2020-10-21 22:58:02,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-21 22:58:02,354 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2020-10-21 22:58:02,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 22:58:02,376 INFO L225 Difference]: With dead ends: 2450 [2020-10-21 22:58:02,376 INFO L226 Difference]: Without dead ends: 2450 [2020-10-21 22:58:02,377 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 22:58:02,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2450 states. [2020-10-21 22:58:02,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2450 to 2450. [2020-10-21 22:58:02,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2450 states. [2020-10-21 22:58:02,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2450 states to 2450 states and 9358 transitions. [2020-10-21 22:58:02,481 INFO L78 Accepts]: Start accepts. Automaton has 2450 states and 9358 transitions. Word has length 11 [2020-10-21 22:58:02,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 22:58:02,481 INFO L481 AbstractCegarLoop]: Abstraction has 2450 states and 9358 transitions. [2020-10-21 22:58:02,481 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-21 22:58:02,482 INFO L276 IsEmpty]: Start isEmpty. Operand 2450 states and 9358 transitions. [2020-10-21 22:58:02,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-21 22:58:02,492 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 22:58:02,493 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 22:58:02,493 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-21 22:58:02,493 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 22:58:02,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 22:58:02,494 INFO L82 PathProgramCache]: Analyzing trace with hash -1430917360, now seen corresponding path program 1 times [2020-10-21 22:58:02,494 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 22:58:02,495 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987498263] [2020-10-21 22:58:02,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 22:58:02,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 22:58:02,659 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 22:58:02,660 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987498263] [2020-10-21 22:58:02,660 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 22:58:02,660 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-21 22:58:02,660 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551730782] [2020-10-21 22:58:02,661 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-21 22:58:02,661 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 22:58:02,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-21 22:58:02,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-21 22:58:02,662 INFO L87 Difference]: Start difference. First operand 2450 states and 9358 transitions. Second operand 3 states. [2020-10-21 22:58:02,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 22:58:02,728 INFO L93 Difference]: Finished difference Result 2442 states and 9320 transitions. [2020-10-21 22:58:02,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-21 22:58:02,730 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2020-10-21 22:58:02,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 22:58:02,751 INFO L225 Difference]: With dead ends: 2442 [2020-10-21 22:58:02,751 INFO L226 Difference]: Without dead ends: 2442 [2020-10-21 22:58:02,751 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 22:58:02,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2442 states. [2020-10-21 22:58:02,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2442 to 2442. [2020-10-21 22:58:02,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2442 states. [2020-10-21 22:58:02,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2442 states to 2442 states and 9320 transitions. [2020-10-21 22:58:02,833 INFO L78 Accepts]: Start accepts. Automaton has 2442 states and 9320 transitions. Word has length 13 [2020-10-21 22:58:02,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 22:58:02,833 INFO L481 AbstractCegarLoop]: Abstraction has 2442 states and 9320 transitions. [2020-10-21 22:58:02,833 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-21 22:58:02,833 INFO L276 IsEmpty]: Start isEmpty. Operand 2442 states and 9320 transitions. [2020-10-21 22:58:02,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-21 22:58:02,836 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 22:58:02,836 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 22:58:02,836 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-21 22:58:02,836 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 22:58:02,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 22:58:02,837 INFO L82 PathProgramCache]: Analyzing trace with hash 2047578604, now seen corresponding path program 1 times [2020-10-21 22:58:02,837 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 22:58:02,837 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243828644] [2020-10-21 22:58:02,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 22:58:02,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 22:58:02,915 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 22:58:02,916 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243828644] [2020-10-21 22:58:02,916 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 22:58:02,916 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-21 22:58:02,917 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678341782] [2020-10-21 22:58:02,917 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-21 22:58:02,917 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 22:58:02,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-21 22:58:02,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-21 22:58:02,918 INFO L87 Difference]: Start difference. First operand 2442 states and 9320 transitions. Second operand 4 states. [2020-10-21 22:58:02,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 22:58:02,989 INFO L93 Difference]: Finished difference Result 2418 states and 9214 transitions. [2020-10-21 22:58:02,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-21 22:58:02,990 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2020-10-21 22:58:02,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 22:58:03,083 INFO L225 Difference]: With dead ends: 2418 [2020-10-21 22:58:03,083 INFO L226 Difference]: Without dead ends: 2418 [2020-10-21 22:58:03,084 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 22:58:03,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2418 states. [2020-10-21 22:58:03,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2418 to 2418. [2020-10-21 22:58:03,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2418 states. [2020-10-21 22:58:03,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2418 states to 2418 states and 9214 transitions. [2020-10-21 22:58:03,156 INFO L78 Accepts]: Start accepts. Automaton has 2418 states and 9214 transitions. Word has length 14 [2020-10-21 22:58:03,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 22:58:03,156 INFO L481 AbstractCegarLoop]: Abstraction has 2418 states and 9214 transitions. [2020-10-21 22:58:03,156 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-21 22:58:03,157 INFO L276 IsEmpty]: Start isEmpty. Operand 2418 states and 9214 transitions. [2020-10-21 22:58:03,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-21 22:58:03,159 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 22:58:03,159 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 22:58:03,159 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-21 22:58:03,159 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 22:58:03,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 22:58:03,160 INFO L82 PathProgramCache]: Analyzing trace with hash 1434906241, now seen corresponding path program 1 times [2020-10-21 22:58:03,160 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 22:58:03,160 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546281473] [2020-10-21 22:58:03,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 22:58:03,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 22:58:03,230 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 22:58:03,231 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546281473] [2020-10-21 22:58:03,231 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 22:58:03,231 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-21 22:58:03,231 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914823757] [2020-10-21 22:58:03,232 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-21 22:58:03,232 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 22:58:03,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-21 22:58:03,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-21 22:58:03,232 INFO L87 Difference]: Start difference. First operand 2418 states and 9214 transitions. Second operand 4 states. [2020-10-21 22:58:03,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 22:58:03,265 INFO L93 Difference]: Finished difference Result 2386 states and 9070 transitions. [2020-10-21 22:58:03,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-21 22:58:03,266 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2020-10-21 22:58:03,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 22:58:03,285 INFO L225 Difference]: With dead ends: 2386 [2020-10-21 22:58:03,286 INFO L226 Difference]: Without dead ends: 2386 [2020-10-21 22:58:03,286 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-21 22:58:03,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2386 states. [2020-10-21 22:58:03,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2386 to 2386. [2020-10-21 22:58:03,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2386 states. [2020-10-21 22:58:03,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2386 states to 2386 states and 9070 transitions. [2020-10-21 22:58:03,363 INFO L78 Accepts]: Start accepts. Automaton has 2386 states and 9070 transitions. Word has length 14 [2020-10-21 22:58:03,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 22:58:03,364 INFO L481 AbstractCegarLoop]: Abstraction has 2386 states and 9070 transitions. [2020-10-21 22:58:03,364 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-21 22:58:03,364 INFO L276 IsEmpty]: Start isEmpty. Operand 2386 states and 9070 transitions. [2020-10-21 22:58:03,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-21 22:58:03,367 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 22:58:03,367 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 22:58:03,367 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-21 22:58:03,368 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 22:58:03,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 22:58:03,368 INFO L82 PathProgramCache]: Analyzing trace with hash 233598470, now seen corresponding path program 1 times [2020-10-21 22:58:03,368 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 22:58:03,368 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086162604] [2020-10-21 22:58:03,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 22:58:03,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 22:58:03,447 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 22:58:03,447 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086162604] [2020-10-21 22:58:03,448 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 22:58:03,448 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-21 22:58:03,448 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639413956] [2020-10-21 22:58:03,448 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-21 22:58:03,449 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 22:58:03,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-21 22:58:03,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-21 22:58:03,449 INFO L87 Difference]: Start difference. First operand 2386 states and 9070 transitions. Second operand 5 states. [2020-10-21 22:58:03,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 22:58:03,565 INFO L93 Difference]: Finished difference Result 2378 states and 9024 transitions. [2020-10-21 22:58:03,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-21 22:58:03,566 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2020-10-21 22:58:03,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 22:58:03,586 INFO L225 Difference]: With dead ends: 2378 [2020-10-21 22:58:03,586 INFO L226 Difference]: Without dead ends: 2378 [2020-10-21 22:58:03,587 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 22:58:03,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2378 states. [2020-10-21 22:58:03,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2378 to 2338. [2020-10-21 22:58:03,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2338 states. [2020-10-21 22:58:03,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2338 states to 2338 states and 8870 transitions. [2020-10-21 22:58:03,665 INFO L78 Accepts]: Start accepts. Automaton has 2338 states and 8870 transitions. Word has length 15 [2020-10-21 22:58:03,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 22:58:03,665 INFO L481 AbstractCegarLoop]: Abstraction has 2338 states and 8870 transitions. [2020-10-21 22:58:03,665 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-21 22:58:03,665 INFO L276 IsEmpty]: Start isEmpty. Operand 2338 states and 8870 transitions. [2020-10-21 22:58:03,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-21 22:58:03,669 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 22:58:03,669 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 22:58:03,669 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-21 22:58:03,669 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 22:58:03,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 22:58:03,670 INFO L82 PathProgramCache]: Analyzing trace with hash 1894098725, now seen corresponding path program 1 times [2020-10-21 22:58:03,670 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 22:58:03,670 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682674711] [2020-10-21 22:58:03,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 22:58:03,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 22:58:03,769 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 22:58:03,770 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682674711] [2020-10-21 22:58:03,770 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 22:58:03,770 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-21 22:58:03,770 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798661821] [2020-10-21 22:58:03,771 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-21 22:58:03,771 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 22:58:03,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-21 22:58:03,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-21 22:58:03,772 INFO L87 Difference]: Start difference. First operand 2338 states and 8870 transitions. Second operand 4 states. [2020-10-21 22:58:03,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 22:58:03,860 INFO L93 Difference]: Finished difference Result 2410 states and 9134 transitions. [2020-10-21 22:58:03,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-21 22:58:03,863 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2020-10-21 22:58:03,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 22:58:03,875 INFO L225 Difference]: With dead ends: 2410 [2020-10-21 22:58:03,875 INFO L226 Difference]: Without dead ends: 2410 [2020-10-21 22:58:03,876 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 1 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 22:58:03,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2410 states. [2020-10-21 22:58:03,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2410 to 2410. [2020-10-21 22:58:03,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2410 states. [2020-10-21 22:58:03,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2410 states to 2410 states and 9134 transitions. [2020-10-21 22:58:03,959 INFO L78 Accepts]: Start accepts. Automaton has 2410 states and 9134 transitions. Word has length 15 [2020-10-21 22:58:03,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 22:58:03,959 INFO L481 AbstractCegarLoop]: Abstraction has 2410 states and 9134 transitions. [2020-10-21 22:58:03,960 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-21 22:58:03,960 INFO L276 IsEmpty]: Start isEmpty. Operand 2410 states and 9134 transitions. [2020-10-21 22:58:03,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-21 22:58:03,964 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 22:58:03,964 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 22:58:03,964 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-21 22:58:03,964 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 22:58:03,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 22:58:03,965 INFO L82 PathProgramCache]: Analyzing trace with hash 1495289419, now seen corresponding path program 1 times [2020-10-21 22:58:03,965 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 22:58:03,965 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221629435] [2020-10-21 22:58:03,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 22:58:03,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 22:58:04,059 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 22:58:04,060 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221629435] [2020-10-21 22:58:04,060 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 22:58:04,060 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-21 22:58:04,060 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132831081] [2020-10-21 22:58:04,061 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-21 22:58:04,061 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 22:58:04,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-21 22:58:04,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-21 22:58:04,062 INFO L87 Difference]: Start difference. First operand 2410 states and 9134 transitions. Second operand 6 states. [2020-10-21 22:58:04,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 22:58:04,198 INFO L93 Difference]: Finished difference Result 2610 states and 9960 transitions. [2020-10-21 22:58:04,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-21 22:58:04,199 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2020-10-21 22:58:04,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 22:58:04,214 INFO L225 Difference]: With dead ends: 2610 [2020-10-21 22:58:04,214 INFO L226 Difference]: Without dead ends: 2610 [2020-10-21 22:58:04,214 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-21 22:58:04,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2610 states. [2020-10-21 22:58:04,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2610 to 2610. [2020-10-21 22:58:04,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2610 states. [2020-10-21 22:58:04,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2610 states to 2610 states and 9960 transitions. [2020-10-21 22:58:04,374 INFO L78 Accepts]: Start accepts. Automaton has 2610 states and 9960 transitions. Word has length 16 [2020-10-21 22:58:04,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 22:58:04,375 INFO L481 AbstractCegarLoop]: Abstraction has 2610 states and 9960 transitions. [2020-10-21 22:58:04,375 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-21 22:58:04,375 INFO L276 IsEmpty]: Start isEmpty. Operand 2610 states and 9960 transitions. [2020-10-21 22:58:04,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-21 22:58:04,380 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 22:58:04,380 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 22:58:04,380 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-21 22:58:04,380 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 22:58:04,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 22:58:04,381 INFO L82 PathProgramCache]: Analyzing trace with hash -1348382509, now seen corresponding path program 2 times [2020-10-21 22:58:04,381 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 22:58:04,381 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521760230] [2020-10-21 22:58:04,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 22:58:04,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 22:58:04,492 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 22:58:04,492 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521760230] [2020-10-21 22:58:04,492 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 22:58:04,493 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-21 22:58:04,493 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687556317] [2020-10-21 22:58:04,493 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-21 22:58:04,493 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 22:58:04,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-21 22:58:04,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-10-21 22:58:04,494 INFO L87 Difference]: Start difference. First operand 2610 states and 9960 transitions. Second operand 6 states. [2020-10-21 22:58:04,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 22:58:04,661 INFO L93 Difference]: Finished difference Result 2970 states and 11282 transitions. [2020-10-21 22:58:04,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-21 22:58:04,662 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2020-10-21 22:58:04,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 22:58:04,675 INFO L225 Difference]: With dead ends: 2970 [2020-10-21 22:58:04,675 INFO L226 Difference]: Without dead ends: 2970 [2020-10-21 22:58:04,676 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2020-10-21 22:58:04,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2970 states. [2020-10-21 22:58:04,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2970 to 2762. [2020-10-21 22:58:04,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2762 states. [2020-10-21 22:58:04,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2762 states to 2762 states and 10430 transitions. [2020-10-21 22:58:04,767 INFO L78 Accepts]: Start accepts. Automaton has 2762 states and 10430 transitions. Word has length 16 [2020-10-21 22:58:04,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 22:58:04,767 INFO L481 AbstractCegarLoop]: Abstraction has 2762 states and 10430 transitions. [2020-10-21 22:58:04,767 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-21 22:58:04,767 INFO L276 IsEmpty]: Start isEmpty. Operand 2762 states and 10430 transitions. [2020-10-21 22:58:04,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-21 22:58:04,773 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 22:58:04,773 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 22:58:04,773 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-21 22:58:04,773 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 22:58:04,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 22:58:04,774 INFO L82 PathProgramCache]: Analyzing trace with hash 1533933320, now seen corresponding path program 1 times [2020-10-21 22:58:04,774 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 22:58:04,774 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372180290] [2020-10-21 22:58:04,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 22:58:04,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 22:58:04,908 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 22:58:04,909 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372180290] [2020-10-21 22:58:04,909 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 22:58:04,909 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-21 22:58:04,909 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098094311] [2020-10-21 22:58:04,910 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-21 22:58:04,910 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 22:58:04,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-21 22:58:04,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-21 22:58:04,910 INFO L87 Difference]: Start difference. First operand 2762 states and 10430 transitions. Second operand 7 states. [2020-10-21 22:58:05,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 22:58:05,104 INFO L93 Difference]: Finished difference Result 3266 states and 12380 transitions. [2020-10-21 22:58:05,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-21 22:58:05,105 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2020-10-21 22:58:05,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 22:58:05,121 INFO L225 Difference]: With dead ends: 3266 [2020-10-21 22:58:05,121 INFO L226 Difference]: Without dead ends: 3266 [2020-10-21 22:58:05,122 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2020-10-21 22:58:05,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3266 states. [2020-10-21 22:58:05,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3266 to 2946. [2020-10-21 22:58:05,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2946 states. [2020-10-21 22:58:05,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2946 states to 2946 states and 11196 transitions. [2020-10-21 22:58:05,224 INFO L78 Accepts]: Start accepts. Automaton has 2946 states and 11196 transitions. Word has length 17 [2020-10-21 22:58:05,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 22:58:05,225 INFO L481 AbstractCegarLoop]: Abstraction has 2946 states and 11196 transitions. [2020-10-21 22:58:05,225 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-21 22:58:05,225 INFO L276 IsEmpty]: Start isEmpty. Operand 2946 states and 11196 transitions. [2020-10-21 22:58:05,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-21 22:58:05,232 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 22:58:05,232 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 22:58:05,232 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-21 22:58:05,233 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 22:58:05,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 22:58:05,233 INFO L82 PathProgramCache]: Analyzing trace with hash 1615625476, now seen corresponding path program 1 times [2020-10-21 22:58:05,233 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 22:58:05,234 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235383048] [2020-10-21 22:58:05,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 22:58:05,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 22:58:05,361 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 22:58:05,362 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235383048] [2020-10-21 22:58:05,362 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 22:58:05,362 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-21 22:58:05,362 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671085655] [2020-10-21 22:58:05,363 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-21 22:58:05,363 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 22:58:05,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-21 22:58:05,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-21 22:58:05,364 INFO L87 Difference]: Start difference. First operand 2946 states and 11196 transitions. Second operand 4 states. [2020-10-21 22:58:05,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 22:58:05,405 INFO L93 Difference]: Finished difference Result 3042 states and 10557 transitions. [2020-10-21 22:58:05,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-21 22:58:05,405 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2020-10-21 22:58:05,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 22:58:05,414 INFO L225 Difference]: With dead ends: 3042 [2020-10-21 22:58:05,414 INFO L226 Difference]: Without dead ends: 2242 [2020-10-21 22:58:05,414 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 22:58:05,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2242 states. [2020-10-21 22:58:05,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2242 to 2242. [2020-10-21 22:58:05,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2242 states. [2020-10-21 22:58:05,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2242 states to 2242 states and 7676 transitions. [2020-10-21 22:58:05,480 INFO L78 Accepts]: Start accepts. Automaton has 2242 states and 7676 transitions. Word has length 17 [2020-10-21 22:58:05,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 22:58:05,481 INFO L481 AbstractCegarLoop]: Abstraction has 2242 states and 7676 transitions. [2020-10-21 22:58:05,481 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-21 22:58:05,481 INFO L276 IsEmpty]: Start isEmpty. Operand 2242 states and 7676 transitions. [2020-10-21 22:58:05,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-21 22:58:05,486 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 22:58:05,486 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 22:58:05,486 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-21 22:58:05,487 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 22:58:05,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 22:58:05,487 INFO L82 PathProgramCache]: Analyzing trace with hash -667234984, now seen corresponding path program 1 times [2020-10-21 22:58:05,487 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 22:58:05,488 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779841490] [2020-10-21 22:58:05,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 22:58:05,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 22:58:05,674 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 22:58:05,674 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779841490] [2020-10-21 22:58:05,675 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 22:58:05,675 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-21 22:58:05,676 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575857217] [2020-10-21 22:58:05,676 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-21 22:58:05,676 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 22:58:05,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-21 22:58:05,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-21 22:58:05,677 INFO L87 Difference]: Start difference. First operand 2242 states and 7676 transitions. Second operand 5 states. [2020-10-21 22:58:05,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 22:58:05,739 INFO L93 Difference]: Finished difference Result 1934 states and 6142 transitions. [2020-10-21 22:58:05,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-21 22:58:05,740 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2020-10-21 22:58:05,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 22:58:05,746 INFO L225 Difference]: With dead ends: 1934 [2020-10-21 22:58:05,746 INFO L226 Difference]: Without dead ends: 1455 [2020-10-21 22:58:05,750 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-10-21 22:58:05,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1455 states. [2020-10-21 22:58:05,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1455 to 1455. [2020-10-21 22:58:05,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1455 states. [2020-10-21 22:58:05,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1455 states to 1455 states and 4528 transitions. [2020-10-21 22:58:05,804 INFO L78 Accepts]: Start accepts. Automaton has 1455 states and 4528 transitions. Word has length 18 [2020-10-21 22:58:05,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 22:58:05,804 INFO L481 AbstractCegarLoop]: Abstraction has 1455 states and 4528 transitions. [2020-10-21 22:58:05,805 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-21 22:58:05,805 INFO L276 IsEmpty]: Start isEmpty. Operand 1455 states and 4528 transitions. [2020-10-21 22:58:05,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-21 22:58:05,809 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 22:58:05,809 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 22:58:05,810 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-21 22:58:05,810 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 22:58:05,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 22:58:05,811 INFO L82 PathProgramCache]: Analyzing trace with hash 1868355780, now seen corresponding path program 1 times [2020-10-21 22:58:05,811 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 22:58:05,812 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911324549] [2020-10-21 22:58:05,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 22:58:05,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 22:58:05,901 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 22:58:05,902 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911324549] [2020-10-21 22:58:05,902 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 22:58:05,903 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-21 22:58:05,903 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421026314] [2020-10-21 22:58:05,903 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-21 22:58:05,904 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 22:58:05,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-21 22:58:05,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-21 22:58:05,906 INFO L87 Difference]: Start difference. First operand 1455 states and 4528 transitions. Second operand 5 states. [2020-10-21 22:58:06,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 22:58:06,022 INFO L93 Difference]: Finished difference Result 2195 states and 6688 transitions. [2020-10-21 22:58:06,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-21 22:58:06,023 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2020-10-21 22:58:06,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 22:58:06,028 INFO L225 Difference]: With dead ends: 2195 [2020-10-21 22:58:06,028 INFO L226 Difference]: Without dead ends: 1551 [2020-10-21 22:58:06,029 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-21 22:58:06,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1551 states. [2020-10-21 22:58:06,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1551 to 1551. [2020-10-21 22:58:06,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1551 states. [2020-10-21 22:58:06,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1551 states to 1551 states and 4778 transitions. [2020-10-21 22:58:06,081 INFO L78 Accepts]: Start accepts. Automaton has 1551 states and 4778 transitions. Word has length 20 [2020-10-21 22:58:06,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 22:58:06,081 INFO L481 AbstractCegarLoop]: Abstraction has 1551 states and 4778 transitions. [2020-10-21 22:58:06,082 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-21 22:58:06,082 INFO L276 IsEmpty]: Start isEmpty. Operand 1551 states and 4778 transitions. [2020-10-21 22:58:06,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-21 22:58:06,087 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 22:58:06,088 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 22:58:06,088 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-21 22:58:06,088 INFO L429 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 22:58:06,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 22:58:06,089 INFO L82 PathProgramCache]: Analyzing trace with hash 263694188, now seen corresponding path program 2 times [2020-10-21 22:58:06,089 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 22:58:06,089 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951933478] [2020-10-21 22:58:06,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 22:58:06,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 22:58:06,169 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 22:58:06,170 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951933478] [2020-10-21 22:58:06,170 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 22:58:06,170 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-21 22:58:06,170 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11835645] [2020-10-21 22:58:06,171 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-21 22:58:06,171 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 22:58:06,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-21 22:58:06,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-21 22:58:06,172 INFO L87 Difference]: Start difference. First operand 1551 states and 4778 transitions. Second operand 3 states. [2020-10-21 22:58:06,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 22:58:06,194 INFO L93 Difference]: Finished difference Result 2101 states and 6337 transitions. [2020-10-21 22:58:06,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-21 22:58:06,196 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2020-10-21 22:58:06,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 22:58:06,201 INFO L225 Difference]: With dead ends: 2101 [2020-10-21 22:58:06,201 INFO L226 Difference]: Without dead ends: 1563 [2020-10-21 22:58:06,202 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-21 22:58:06,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1563 states. [2020-10-21 22:58:06,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1563 to 1359. [2020-10-21 22:58:06,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1359 states. [2020-10-21 22:58:06,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1359 states to 1359 states and 3973 transitions. [2020-10-21 22:58:06,251 INFO L78 Accepts]: Start accepts. Automaton has 1359 states and 3973 transitions. Word has length 20 [2020-10-21 22:58:06,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 22:58:06,251 INFO L481 AbstractCegarLoop]: Abstraction has 1359 states and 3973 transitions. [2020-10-21 22:58:06,251 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-21 22:58:06,251 INFO L276 IsEmpty]: Start isEmpty. Operand 1359 states and 3973 transitions. [2020-10-21 22:58:06,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-21 22:58:06,255 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 22:58:06,255 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, 1] [2020-10-21 22:58:06,255 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-21 22:58:06,255 INFO L429 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 22:58:06,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 22:58:06,256 INFO L82 PathProgramCache]: Analyzing trace with hash 1472992942, now seen corresponding path program 1 times [2020-10-21 22:58:06,256 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 22:58:06,256 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830198422] [2020-10-21 22:58:06,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 22:58:06,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 22:58:06,360 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 22:58:06,360 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830198422] [2020-10-21 22:58:06,361 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 22:58:06,362 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-21 22:58:06,362 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927451031] [2020-10-21 22:58:06,362 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-21 22:58:06,362 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 22:58:06,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-21 22:58:06,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-21 22:58:06,363 INFO L87 Difference]: Start difference. First operand 1359 states and 3973 transitions. Second operand 6 states. [2020-10-21 22:58:06,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 22:58:06,427 INFO L93 Difference]: Finished difference Result 1202 states and 3476 transitions. [2020-10-21 22:58:06,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-21 22:58:06,428 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2020-10-21 22:58:06,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 22:58:06,432 INFO L225 Difference]: With dead ends: 1202 [2020-10-21 22:58:06,432 INFO L226 Difference]: Without dead ends: 1061 [2020-10-21 22:58:06,434 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-10-21 22:58:06,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1061 states. [2020-10-21 22:58:06,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1061 to 929. [2020-10-21 22:58:06,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 929 states. [2020-10-21 22:58:06,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 929 states to 929 states and 2703 transitions. [2020-10-21 22:58:06,460 INFO L78 Accepts]: Start accepts. Automaton has 929 states and 2703 transitions. Word has length 21 [2020-10-21 22:58:06,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 22:58:06,460 INFO L481 AbstractCegarLoop]: Abstraction has 929 states and 2703 transitions. [2020-10-21 22:58:06,461 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-21 22:58:06,461 INFO L276 IsEmpty]: Start isEmpty. Operand 929 states and 2703 transitions. [2020-10-21 22:58:06,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-21 22:58:06,467 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 22:58:06,467 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, 1, 1, 1, 1] [2020-10-21 22:58:06,467 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-21 22:58:06,467 INFO L429 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 22:58:06,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 22:58:06,468 INFO L82 PathProgramCache]: Analyzing trace with hash -1449693238, now seen corresponding path program 1 times [2020-10-21 22:58:06,468 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 22:58:06,468 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003285713] [2020-10-21 22:58:06,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 22:58:06,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 22:58:06,608 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 22:58:06,608 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003285713] [2020-10-21 22:58:06,608 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 22:58:06,608 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-21 22:58:06,609 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378972890] [2020-10-21 22:58:06,611 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-21 22:58:06,611 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 22:58:06,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-21 22:58:06,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-21 22:58:06,612 INFO L87 Difference]: Start difference. First operand 929 states and 2703 transitions. Second operand 7 states. [2020-10-21 22:58:06,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 22:58:06,720 INFO L93 Difference]: Finished difference Result 900 states and 2644 transitions. [2020-10-21 22:58:06,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-21 22:58:06,721 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2020-10-21 22:58:06,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 22:58:06,723 INFO L225 Difference]: With dead ends: 900 [2020-10-21 22:58:06,724 INFO L226 Difference]: Without dead ends: 545 [2020-10-21 22:58:06,724 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2020-10-21 22:58:06,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2020-10-21 22:58:06,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 517. [2020-10-21 22:58:06,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 517 states. [2020-10-21 22:58:06,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 517 states and 1477 transitions. [2020-10-21 22:58:06,738 INFO L78 Accepts]: Start accepts. Automaton has 517 states and 1477 transitions. Word has length 24 [2020-10-21 22:58:06,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 22:58:06,739 INFO L481 AbstractCegarLoop]: Abstraction has 517 states and 1477 transitions. [2020-10-21 22:58:06,739 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-21 22:58:06,739 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 1477 transitions. [2020-10-21 22:58:06,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-10-21 22:58:06,741 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 22:58:06,741 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, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 22:58:06,741 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-21 22:58:06,742 INFO L429 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 22:58:06,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 22:58:06,742 INFO L82 PathProgramCache]: Analyzing trace with hash -1532231772, now seen corresponding path program 1 times [2020-10-21 22:58:06,742 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 22:58:06,743 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078656508] [2020-10-21 22:58:06,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 22:58:06,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 22:58:06,862 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 22:58:06,863 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078656508] [2020-10-21 22:58:06,863 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 22:58:06,863 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-21 22:58:06,864 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118249655] [2020-10-21 22:58:06,868 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-21 22:58:06,868 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 22:58:06,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-21 22:58:06,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-10-21 22:58:06,869 INFO L87 Difference]: Start difference. First operand 517 states and 1477 transitions. Second operand 6 states. [2020-10-21 22:58:06,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 22:58:06,979 INFO L93 Difference]: Finished difference Result 1006 states and 2857 transitions. [2020-10-21 22:58:06,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-21 22:58:06,980 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2020-10-21 22:58:06,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 22:58:06,982 INFO L225 Difference]: With dead ends: 1006 [2020-10-21 22:58:06,982 INFO L226 Difference]: Without dead ends: 652 [2020-10-21 22:58:06,982 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-21 22:58:06,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 652 states. [2020-10-21 22:58:06,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 652 to 517. [2020-10-21 22:58:06,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 517 states. [2020-10-21 22:58:06,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 517 states and 1422 transitions. [2020-10-21 22:58:06,995 INFO L78 Accepts]: Start accepts. Automaton has 517 states and 1422 transitions. Word has length 27 [2020-10-21 22:58:06,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 22:58:06,996 INFO L481 AbstractCegarLoop]: Abstraction has 517 states and 1422 transitions. [2020-10-21 22:58:06,996 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-21 22:58:06,997 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 1422 transitions. [2020-10-21 22:58:06,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-10-21 22:58:06,998 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 22:58:06,998 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, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 22:58:06,998 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-10-21 22:58:06,999 INFO L429 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 22:58:06,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 22:58:06,999 INFO L82 PathProgramCache]: Analyzing trace with hash -2006577588, now seen corresponding path program 2 times [2020-10-21 22:58:06,999 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 22:58:07,001 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530432190] [2020-10-21 22:58:07,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 22:58:07,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 22:58:07,150 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 22:58:07,151 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530432190] [2020-10-21 22:58:07,151 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 22:58:07,151 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-21 22:58:07,151 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375379642] [2020-10-21 22:58:07,152 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-21 22:58:07,152 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 22:58:07,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-21 22:58:07,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2020-10-21 22:58:07,153 INFO L87 Difference]: Start difference. First operand 517 states and 1422 transitions. Second operand 10 states. [2020-10-21 22:58:07,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 22:58:07,446 INFO L93 Difference]: Finished difference Result 846 states and 2276 transitions. [2020-10-21 22:58:07,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-21 22:58:07,447 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 27 [2020-10-21 22:58:07,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 22:58:07,449 INFO L225 Difference]: With dead ends: 846 [2020-10-21 22:58:07,449 INFO L226 Difference]: Without dead ends: 572 [2020-10-21 22:58:07,449 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2020-10-21 22:58:07,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2020-10-21 22:58:07,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 542. [2020-10-21 22:58:07,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 542 states. [2020-10-21 22:58:07,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 1447 transitions. [2020-10-21 22:58:07,461 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 1447 transitions. Word has length 27 [2020-10-21 22:58:07,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 22:58:07,462 INFO L481 AbstractCegarLoop]: Abstraction has 542 states and 1447 transitions. [2020-10-21 22:58:07,462 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-21 22:58:07,462 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 1447 transitions. [2020-10-21 22:58:07,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-10-21 22:58:07,463 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 22:58:07,464 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, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 22:58:07,464 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-10-21 22:58:07,464 INFO L429 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 22:58:07,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 22:58:07,464 INFO L82 PathProgramCache]: Analyzing trace with hash -1672999218, now seen corresponding path program 3 times [2020-10-21 22:58:07,465 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 22:58:07,465 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016877981] [2020-10-21 22:58:07,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 22:58:07,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 22:58:07,658 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 22:58:07,658 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016877981] [2020-10-21 22:58:07,658 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 22:58:07,659 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-21 22:58:07,659 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950002275] [2020-10-21 22:58:07,659 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-21 22:58:07,659 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 22:58:07,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-21 22:58:07,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2020-10-21 22:58:07,661 INFO L87 Difference]: Start difference. First operand 542 states and 1447 transitions. Second operand 10 states. [2020-10-21 22:58:07,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 22:58:07,936 INFO L93 Difference]: Finished difference Result 664 states and 1699 transitions. [2020-10-21 22:58:07,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-21 22:58:07,937 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 27 [2020-10-21 22:58:07,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 22:58:07,939 INFO L225 Difference]: With dead ends: 664 [2020-10-21 22:58:07,939 INFO L226 Difference]: Without dead ends: 549 [2020-10-21 22:58:07,939 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2020-10-21 22:58:07,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2020-10-21 22:58:07,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 484. [2020-10-21 22:58:07,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 484 states. [2020-10-21 22:58:07,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 1305 transitions. [2020-10-21 22:58:07,950 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 1305 transitions. Word has length 27 [2020-10-21 22:58:07,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 22:58:07,951 INFO L481 AbstractCegarLoop]: Abstraction has 484 states and 1305 transitions. [2020-10-21 22:58:07,951 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-21 22:58:07,951 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 1305 transitions. [2020-10-21 22:58:07,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-10-21 22:58:07,953 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 22:58:07,953 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, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 22:58:07,953 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-10-21 22:58:07,954 INFO L429 AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 22:58:07,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 22:58:07,954 INFO L82 PathProgramCache]: Analyzing trace with hash 985986504, now seen corresponding path program 4 times [2020-10-21 22:58:07,954 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 22:58:07,955 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213009553] [2020-10-21 22:58:07,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 22:58:07,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 22:58:08,016 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 22:58:08,016 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213009553] [2020-10-21 22:58:08,016 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 22:58:08,016 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-21 22:58:08,017 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080419797] [2020-10-21 22:58:08,018 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-21 22:58:08,018 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 22:58:08,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-21 22:58:08,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-21 22:58:08,018 INFO L87 Difference]: Start difference. First operand 484 states and 1305 transitions. Second operand 4 states. [2020-10-21 22:58:08,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 22:58:08,036 INFO L93 Difference]: Finished difference Result 519 states and 1371 transitions. [2020-10-21 22:58:08,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-21 22:58:08,037 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2020-10-21 22:58:08,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 22:58:08,037 INFO L225 Difference]: With dead ends: 519 [2020-10-21 22:58:08,038 INFO L226 Difference]: Without dead ends: 214 [2020-10-21 22:58:08,038 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 22:58:08,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2020-10-21 22:58:08,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 214. [2020-10-21 22:58:08,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2020-10-21 22:58:08,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 543 transitions. [2020-10-21 22:58:08,043 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 543 transitions. Word has length 27 [2020-10-21 22:58:08,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 22:58:08,043 INFO L481 AbstractCegarLoop]: Abstraction has 214 states and 543 transitions. [2020-10-21 22:58:08,043 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-21 22:58:08,043 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 543 transitions. [2020-10-21 22:58:08,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-10-21 22:58:08,044 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 22:58:08,045 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, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 22:58:08,045 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-10-21 22:58:08,045 INFO L429 AbstractCegarLoop]: === Iteration 21 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 22:58:08,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 22:58:08,045 INFO L82 PathProgramCache]: Analyzing trace with hash -165311702, now seen corresponding path program 5 times [2020-10-21 22:58:08,045 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 22:58:08,046 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405651160] [2020-10-21 22:58:08,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 22:58:08,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 22:58:08,190 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 22:58:08,190 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405651160] [2020-10-21 22:58:08,190 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 22:58:08,190 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-21 22:58:08,191 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804277734] [2020-10-21 22:58:08,191 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-21 22:58:08,191 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 22:58:08,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-21 22:58:08,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-21 22:58:08,193 INFO L87 Difference]: Start difference. First operand 214 states and 543 transitions. Second operand 7 states. [2020-10-21 22:58:08,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 22:58:08,283 INFO L93 Difference]: Finished difference Result 300 states and 761 transitions. [2020-10-21 22:58:08,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-21 22:58:08,285 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2020-10-21 22:58:08,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 22:58:08,286 INFO L225 Difference]: With dead ends: 300 [2020-10-21 22:58:08,286 INFO L226 Difference]: Without dead ends: 250 [2020-10-21 22:58:08,286 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-10-21 22:58:08,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2020-10-21 22:58:08,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 190. [2020-10-21 22:58:08,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2020-10-21 22:58:08,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 463 transitions. [2020-10-21 22:58:08,291 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 463 transitions. Word has length 27 [2020-10-21 22:58:08,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 22:58:08,292 INFO L481 AbstractCegarLoop]: Abstraction has 190 states and 463 transitions. [2020-10-21 22:58:08,292 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-21 22:58:08,292 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 463 transitions. [2020-10-21 22:58:08,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-10-21 22:58:08,293 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 22:58:08,293 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, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 22:58:08,293 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-10-21 22:58:08,293 INFO L429 AbstractCegarLoop]: === Iteration 22 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 22:58:08,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 22:58:08,294 INFO L82 PathProgramCache]: Analyzing trace with hash 56148650, now seen corresponding path program 6 times [2020-10-21 22:58:08,294 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 22:58:08,294 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680383424] [2020-10-21 22:58:08,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 22:58:08,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 22:58:08,428 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 22:58:08,428 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680383424] [2020-10-21 22:58:08,429 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 22:58:08,429 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-21 22:58:08,429 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930734605] [2020-10-21 22:58:08,429 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-21 22:58:08,429 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 22:58:08,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-21 22:58:08,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-21 22:58:08,430 INFO L87 Difference]: Start difference. First operand 190 states and 463 transitions. Second operand 7 states. [2020-10-21 22:58:08,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 22:58:08,593 INFO L93 Difference]: Finished difference Result 240 states and 585 transitions. [2020-10-21 22:58:08,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-21 22:58:08,594 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2020-10-21 22:58:08,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 22:58:08,594 INFO L225 Difference]: With dead ends: 240 [2020-10-21 22:58:08,594 INFO L226 Difference]: Without dead ends: 180 [2020-10-21 22:58:08,595 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2020-10-21 22:58:08,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2020-10-21 22:58:08,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 168. [2020-10-21 22:58:08,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2020-10-21 22:58:08,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 415 transitions. [2020-10-21 22:58:08,599 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 415 transitions. Word has length 27 [2020-10-21 22:58:08,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 22:58:08,599 INFO L481 AbstractCegarLoop]: Abstraction has 168 states and 415 transitions. [2020-10-21 22:58:08,600 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-21 22:58:08,600 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 415 transitions. [2020-10-21 22:58:08,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-10-21 22:58:08,600 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 22:58:08,600 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, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 22:58:08,601 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-10-21 22:58:08,601 INFO L429 AbstractCegarLoop]: === Iteration 23 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 22:58:08,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 22:58:08,601 INFO L82 PathProgramCache]: Analyzing trace with hash 1947413876, now seen corresponding path program 7 times [2020-10-21 22:58:08,601 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 22:58:08,602 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640101206] [2020-10-21 22:58:08,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 22:58:08,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-21 22:58:08,636 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-21 22:58:08,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-21 22:58:08,675 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-21 22:58:08,718 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-21 22:58:08,719 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-21 22:58:08,719 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-10-21 22:58:08,720 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-21 22:58:08,746 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [1112] [1112] L854-->L862: Formula: (let ((.cse7 (= (mod ~y$w_buff1_used~0_In951945128 256) 0)) (.cse6 (= (mod ~y$r_buff1_thd0~0_In951945128 256) 0)) (.cse8 (= (mod ~y$r_buff0_thd0~0_In951945128 256) 0)) (.cse9 (= (mod ~y$w_buff0_used~0_In951945128 256) 0))) (let ((.cse0 (not .cse9)) (.cse1 (not .cse8)) (.cse2 (or .cse8 .cse9)) (.cse3 (not .cse6)) (.cse4 (not .cse7)) (.cse5 (or .cse6 .cse7))) (and (= ~y$r_buff0_thd0~0_In951945128 ~y$r_buff0_thd0~0_Out951945128) (= ~y$r_buff1_thd0~0_In951945128 ~y$r_buff1_thd0~0_Out951945128) (or (and (= ~y$w_buff0_used~0_Out951945128 0) .cse0 .cse1) (and .cse2 (= ~y$w_buff0_used~0_Out951945128 ~y$w_buff0_used~0_In951945128))) (not (= 0 ULTIMATE.start_assume_abort_if_not_~cond_Out951945128)) (or (and .cse0 .cse1 (= ~y~0_Out951945128 ~y$w_buff0~0_In951945128)) (and .cse2 (or (and .cse3 .cse4 (= ~y~0_Out951945128 ~y$w_buff1~0_In951945128)) (and (= ~y~0_Out951945128 ~y~0_In951945128) .cse5)))) (= (mod ~main$tmp_guard0~0_In951945128 256) |ULTIMATE.start_assume_abort_if_not_#in~cond_Out951945128|) (or (and .cse3 .cse4 (= ~y$w_buff1_used~0_Out951945128 0)) (and .cse5 (= ~y$w_buff1_used~0_Out951945128 ~y$w_buff1_used~0_In951945128))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond_Out951945128| ULTIMATE.start_assume_abort_if_not_~cond_Out951945128)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In951945128, ~y$w_buff1~0=~y$w_buff1~0_In951945128, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In951945128, ~y$w_buff0~0=~y$w_buff0~0_In951945128, ~main$tmp_guard0~0=~main$tmp_guard0~0_In951945128, ~y~0=~y~0_In951945128, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In951945128, ~y$w_buff1_used~0=~y$w_buff1_used~0_In951945128} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_Out951945128, ULTIMATE.start_main_#t~ite28=|ULTIMATE.start_main_#t~ite28_Out951945128|, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_Out951945128|, ULTIMATE.start_main_#t~ite27=|ULTIMATE.start_main_#t~ite27_Out951945128|, ~main$tmp_guard0~0=~main$tmp_guard0~0_In951945128, ULTIMATE.start_main_#t~ite31=|ULTIMATE.start_main_#t~ite31_Out951945128|, ULTIMATE.start_main_#t~ite32=|ULTIMATE.start_main_#t~ite32_Out951945128|, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_Out951945128|, ULTIMATE.start_main_#t~ite30=|ULTIMATE.start_main_#t~ite30_Out951945128|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out951945128, ~y$w_buff1~0=~y$w_buff1~0_In951945128, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_Out951945128, ~y$w_buff0~0=~y$w_buff0~0_In951945128, ~y~0=~y~0_Out951945128, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out951945128, ~y$w_buff1_used~0=~y$w_buff1_used~0_Out951945128} AuxVars[] AssignedVars[~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite28, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite32, ULTIMATE.start_assume_abort_if_not_#in~cond, ULTIMATE.start_main_#t~ite30, ULTIMATE.start_assume_abort_if_not_~cond, ~y$r_buff0_thd0~0, ~y~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] because there is no mapped edge [2020-10-21 22:58:08,753 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 22:58:08,754 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:58:08,754 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 22:58:08,754 WARN L224 RCFGBacktranslator]: unable to determine which branch was taken at C: __VERIFIER_atomic_begin() [782] [2020-10-21 22:58:08,756 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 22:58:08,757 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:58:08,757 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 22:58:08,757 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:58:08,757 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 22:58:08,757 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:58:08,757 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 22:58:08,758 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:58:08,758 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 22:58:08,758 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:58:08,758 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 22:58:08,758 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:58:08,759 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 22:58:08,759 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:58:08,760 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 22:58:08,760 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:58:08,760 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 22:58:08,760 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:58:08,760 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 22:58:08,760 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:58:08,761 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 22:58:08,761 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:58:08,761 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 22:58:08,762 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:58:08,762 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 22:58:08,762 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:58:08,762 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 22:58:08,762 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:58:08,763 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 22:58:08,763 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:58:08,763 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 22:58:08,763 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:58:08,764 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 22:58:08,764 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:58:08,764 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 22:58:08,764 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:58:08,765 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 22:58:08,765 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:58:08,765 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 22:58:08,765 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:58:08,765 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 22:58:08,766 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:58:08,766 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 22:58:08,766 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:58:08,766 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 22:58:08,766 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:58:08,766 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 22:58:08,767 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:58:08,767 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 22:58:08,767 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:58:08,767 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 22:58:08,767 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:58:08,768 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 22:58:08,768 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:58:08,768 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 22:58:08,768 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:58:08,769 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 22:58:08,769 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:58:08,769 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 22:58:08,769 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:58:08,769 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 22:58:08,769 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:58:08,856 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.10 10:58:08 BasicIcfg [2020-10-21 22:58:08,857 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-21 22:58:08,858 INFO L168 Benchmark]: Toolchain (without parser) took 20537.63 ms. Allocated memory was 141.0 MB in the beginning and 482.3 MB in the end (delta: 341.3 MB). Free memory was 102.3 MB in the beginning and 196.7 MB in the end (delta: -94.4 MB). Peak memory consumption was 246.9 MB. Max. memory is 7.1 GB. [2020-10-21 22:58:08,859 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 141.0 MB. Free memory was 122.5 MB in the beginning and 122.3 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2020-10-21 22:58:08,860 INFO L168 Benchmark]: CACSL2BoogieTranslator took 835.01 ms. Allocated memory was 141.0 MB in the beginning and 203.4 MB in the end (delta: 62.4 MB). Free memory was 101.4 MB in the beginning and 153.3 MB in the end (delta: -51.9 MB). Peak memory consumption was 23.3 MB. Max. memory is 7.1 GB. [2020-10-21 22:58:08,860 INFO L168 Benchmark]: Boogie Procedure Inliner took 64.34 ms. Allocated memory is still 203.4 MB. Free memory was 153.3 MB in the beginning and 149.9 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. [2020-10-21 22:58:08,861 INFO L168 Benchmark]: Boogie Preprocessor took 42.08 ms. Allocated memory is still 203.4 MB. Free memory was 149.9 MB in the beginning and 147.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2020-10-21 22:58:08,861 INFO L168 Benchmark]: RCFGBuilder took 2204.23 ms. Allocated memory was 203.4 MB in the beginning and 246.4 MB in the end (delta: 43.0 MB). Free memory was 147.3 MB in the beginning and 146.4 MB in the end (delta: 922.7 kB). Peak memory consumption was 96.3 MB. Max. memory is 7.1 GB. [2020-10-21 22:58:08,862 INFO L168 Benchmark]: TraceAbstraction took 17380.70 ms. Allocated memory was 246.4 MB in the beginning and 482.3 MB in the end (delta: 235.9 MB). Free memory was 146.4 MB in the beginning and 196.7 MB in the end (delta: -50.3 MB). Peak memory consumption was 185.6 MB. Max. memory is 7.1 GB. [2020-10-21 22:58:08,865 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.21 ms. Allocated memory is still 141.0 MB. Free memory was 122.5 MB in the beginning and 122.3 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 835.01 ms. Allocated memory was 141.0 MB in the beginning and 203.4 MB in the end (delta: 62.4 MB). Free memory was 101.4 MB in the beginning and 153.3 MB in the end (delta: -51.9 MB). Peak memory consumption was 23.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 64.34 ms. Allocated memory is still 203.4 MB. Free memory was 153.3 MB in the beginning and 149.9 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 42.08 ms. Allocated memory is still 203.4 MB. Free memory was 149.9 MB in the beginning and 147.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2204.23 ms. Allocated memory was 203.4 MB in the beginning and 246.4 MB in the end (delta: 43.0 MB). Free memory was 147.3 MB in the beginning and 146.4 MB in the end (delta: 922.7 kB). Peak memory consumption was 96.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 17380.70 ms. Allocated memory was 246.4 MB in the beginning and 482.3 MB in the end (delta: 235.9 MB). Free memory was 146.4 MB in the beginning and 196.7 MB in the end (delta: -50.3 MB). Peak memory consumption was 185.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1550 VarBasedMoverChecksPositive, 51 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 132 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 9.4s, 129 PlacesBefore, 46 PlacesAfterwards, 119 TransitionsBefore, 33 TransitionsAfterwards, 2862 CoEnabledTransitionPairs, 7 FixpointIterations, 39 TrivialSequentialCompositions, 48 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 12 ConcurrentYvCompositions, 3 ChoiceCompositions, 102 TotalNumberOfCompositions, 8274 MoverChecksTotal - CounterExampleResult [Line: 17]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p3_EAX = 0; [L714] 0 int __unbuffered_p3_EBX = 0; [L716] 0 int a = 0; [L717] 0 _Bool main$tmp_guard0; [L718] 0 _Bool main$tmp_guard1; [L720] 0 int x = 0; [L722] 0 int y = 0; [L723] 0 _Bool y$flush_delayed; [L724] 0 int y$mem_tmp; [L725] 0 _Bool y$r_buff0_thd0; [L726] 0 _Bool y$r_buff0_thd1; [L727] 0 _Bool y$r_buff0_thd2; [L728] 0 _Bool y$r_buff0_thd3; [L729] 0 _Bool y$r_buff0_thd4; [L730] 0 _Bool y$r_buff1_thd0; [L731] 0 _Bool y$r_buff1_thd1; [L732] 0 _Bool y$r_buff1_thd2; [L733] 0 _Bool y$r_buff1_thd3; [L734] 0 _Bool y$r_buff1_thd4; [L735] 0 _Bool y$read_delayed; [L736] 0 int *y$read_delayed_var; [L737] 0 int y$w_buff0; [L738] 0 _Bool y$w_buff0_used; [L739] 0 int y$w_buff1; [L740] 0 _Bool y$w_buff1_used; [L742] 0 int z = 0; [L743] 0 _Bool weak$$choice0; [L744] 0 _Bool weak$$choice2; [L844] 0 pthread_t t813; [L845] FCALL, FORK 0 pthread_create(&t813, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L846] 0 pthread_t t814; [L847] FCALL, FORK 0 pthread_create(&t814, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L848] 0 pthread_t t815; [L849] FCALL, FORK 0 pthread_create(&t815, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L783] 3 y$w_buff1 = y$w_buff0 [L784] 3 y$w_buff0 = 2 [L785] 3 y$w_buff1_used = y$w_buff0_used [L786] 3 y$w_buff0_used = (_Bool)1 [L18] COND TRUE 3 !expression [L17] COND FALSE 3 !(0) [L17] 3 __assert_fail ("0", "mix030_pso.opt.c", 8, __extension__ __PRETTY_FUNCTION__) [L788] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L789] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L790] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L791] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L792] 3 y$r_buff1_thd4 = y$r_buff0_thd4 [L793] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L796] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L850] 0 pthread_t t816; [L851] FCALL, FORK 0 pthread_create(&t816, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L813] 4 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, 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=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L816] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, 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=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L819] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, 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=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L748] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, 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=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L751] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, 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=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L822] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L822] EXPR 4 y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y [L822] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L822] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L823] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L823] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L824] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L824] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L825] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L825] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L826] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 [L826] 4 y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 [L829] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L831] 4 return 0; [L763] 2 x = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, 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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L766] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, 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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L799] 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) [L799] 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) [L800] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L800] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L801] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L801] 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 [L802] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L802] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L803] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L803] 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 [L806] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L808] 3 return 0; [L769] 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) [L769] 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) [L770] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L770] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L771] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L771] 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 [L772] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L772] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L773] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L773] 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 [L776] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L778] 2 return 0; [L756] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L758] 1 return 0; [L853] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, 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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L864] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L865] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L866] 0 y$flush_delayed = weak$$choice2 [L867] 0 y$mem_tmp = y [L868] 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) [L868] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1 [L868] 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) [L868] 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) [L869] 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)) [L869] EXPR 0 !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) [L869] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0 [L869] EXPR 0 !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) [L869] 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)) [L869] 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)) [L870] 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)) [L870] 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)) [L871] 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)) [L871] 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)) [L872] 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)) [L872] 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) [L872] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0 [L872] 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) [L872] 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)) [L872] 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)) [L873] 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)) [L873] 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) [L873] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L873] 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) [L873] 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)) [L873] 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)) [L874] 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)) [L874] 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)) [L875] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0) [L876] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L876] 0 y = y$flush_delayed ? y$mem_tmp : y [L877] 0 y$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "mix030_pso.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, 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=255, 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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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 5 procedures, 117 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 17.1s, OverallIterations: 23, TraceHistogramMax: 1, AutomataDifference: 2.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 9.7s, HoareTripleCheckerStatistics: 809 SDtfs, 1159 SDslu, 1977 SDs, 0 SdLazy, 900 SolverSat, 230 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 109 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3890occurred 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: 1.3s AutomataMinimizationTime, 22 MinimizatonAttempts, 1234 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 447 NumberOfCodeBlocks, 447 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 398 ConstructedInterpolants, 0 QuantifiedInterpolants, 61556 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 22 InterpolantComputations, 22 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...