/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe017_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-7cd14b8b9f04096d8ddfd3d9cd8a4ac590fe5404-7cd14b8 [2021-03-10 17:31:12,787 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-10 17:31:12,789 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-10 17:31:12,807 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-10 17:31:12,807 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-10 17:31:12,808 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-10 17:31:12,809 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-10 17:31:12,810 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-10 17:31:12,812 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-10 17:31:12,812 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-10 17:31:12,813 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-10 17:31:12,814 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-10 17:31:12,814 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-10 17:31:12,815 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-10 17:31:12,816 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-10 17:31:12,816 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-10 17:31:12,817 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-10 17:31:12,817 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-10 17:31:12,819 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-10 17:31:12,820 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-10 17:31:12,821 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-10 17:31:12,822 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-10 17:31:12,822 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-10 17:31:12,823 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-10 17:31:12,825 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-10 17:31:12,825 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-10 17:31:12,825 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-10 17:31:12,826 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-10 17:31:12,826 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-10 17:31:12,827 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-10 17:31:12,827 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-10 17:31:12,827 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-10 17:31:12,828 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-10 17:31:12,828 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-10 17:31:12,829 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-10 17:31:12,829 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-10 17:31:12,829 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-10 17:31:12,830 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-10 17:31:12,830 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-10 17:31:12,830 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-10 17:31:12,831 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-10 17:31:12,838 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf [2021-03-10 17:31:12,853 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-10 17:31:12,853 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-10 17:31:12,853 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-03-10 17:31:12,853 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-03-10 17:31:12,854 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-10 17:31:12,854 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-10 17:31:12,854 INFO L138 SettingsManager]: * Use SBE=true [2021-03-10 17:31:12,855 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-10 17:31:12,855 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-10 17:31:12,855 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-10 17:31:12,855 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-10 17:31:12,855 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-10 17:31:12,855 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-10 17:31:12,855 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-10 17:31:12,856 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-10 17:31:12,856 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-10 17:31:12,856 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-10 17:31:12,856 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-10 17:31:12,856 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-10 17:31:12,856 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-10 17:31:12,856 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-10 17:31:12,856 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-10 17:31:12,857 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-10 17:31:12,857 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-10 17:31:12,857 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-10 17:31:12,857 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-10 17:31:12,857 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-10 17:31:12,857 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-10 17:31:12,857 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-10 17:31:12,858 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-03-10 17:31:12,858 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-03-10 17:31:12,858 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-03-10 17:31:13,121 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-10 17:31:13,143 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-10 17:31:13,145 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-10 17:31:13,146 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-10 17:31:13,147 INFO L275 PluginConnector]: CDTParser initialized [2021-03-10 17:31:13,148 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe017_power.oepc.i [2021-03-10 17:31:13,196 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/098cfb94a/61339266d55a46b2a735eee3c264872f/FLAG7bf2377e4 [2021-03-10 17:31:13,648 INFO L306 CDTParser]: Found 1 translation units. [2021-03-10 17:31:13,648 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe017_power.oepc.i [2021-03-10 17:31:13,664 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/098cfb94a/61339266d55a46b2a735eee3c264872f/FLAG7bf2377e4 [2021-03-10 17:31:14,169 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/098cfb94a/61339266d55a46b2a735eee3c264872f [2021-03-10 17:31:14,172 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-10 17:31:14,176 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-10 17:31:14,178 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-10 17:31:14,178 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-10 17:31:14,180 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-10 17:31:14,181 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.03 05:31:14" (1/1) ... [2021-03-10 17:31:14,181 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a5feff4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.03 05:31:14, skipping insertion in model container [2021-03-10 17:31:14,181 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.03 05:31:14" (1/1) ... [2021-03-10 17:31:14,186 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-10 17:31:14,211 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-10 17:31:14,304 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe017_power.oepc.i[952,965] [2021-03-10 17:31:14,429 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-10 17:31:14,434 INFO L203 MainTranslator]: Completed pre-run [2021-03-10 17:31:14,441 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe017_power.oepc.i[952,965] [2021-03-10 17:31:14,468 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-10 17:31:14,509 INFO L208 MainTranslator]: Completed translation [2021-03-10 17:31:14,509 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.03 05:31:14 WrapperNode [2021-03-10 17:31:14,509 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-10 17:31:14,510 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-10 17:31:14,510 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-10 17:31:14,510 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-10 17:31:14,514 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.03 05:31:14" (1/1) ... [2021-03-10 17:31:14,525 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.03 05:31:14" (1/1) ... [2021-03-10 17:31:14,545 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-10 17:31:14,545 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-10 17:31:14,545 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-10 17:31:14,546 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-10 17:31:14,551 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.03 05:31:14" (1/1) ... [2021-03-10 17:31:14,552 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.03 05:31:14" (1/1) ... [2021-03-10 17:31:14,555 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.03 05:31:14" (1/1) ... [2021-03-10 17:31:14,555 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.03 05:31:14" (1/1) ... [2021-03-10 17:31:14,570 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.03 05:31:14" (1/1) ... [2021-03-10 17:31:14,573 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.03 05:31:14" (1/1) ... [2021-03-10 17:31:14,575 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.03 05:31:14" (1/1) ... [2021-03-10 17:31:14,578 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-10 17:31:14,578 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-10 17:31:14,578 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-10 17:31:14,578 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-10 17:31:14,579 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.03 05:31:14" (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 [2021-03-10 17:31:14,641 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-10 17:31:14,641 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-10 17:31:14,641 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-10 17:31:14,642 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-10 17:31:14,642 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-10 17:31:14,642 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-10 17:31:14,642 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-10 17:31:14,642 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-10 17:31:14,642 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-03-10 17:31:14,642 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-03-10 17:31:14,642 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-10 17:31:14,642 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-10 17:31:14,642 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-10 17:31:14,643 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-10 17:31:14,648 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-03-10 17:31:16,083 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-10 17:31:16,083 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-10 17:31:16,084 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.03 05:31:16 BoogieIcfgContainer [2021-03-10 17:31:16,084 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-10 17:31:16,085 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-10 17:31:16,086 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-10 17:31:16,087 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-10 17:31:16,087 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.03 05:31:14" (1/3) ... [2021-03-10 17:31:16,088 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51365abc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.03 05:31:16, skipping insertion in model container [2021-03-10 17:31:16,088 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.03 05:31:14" (2/3) ... [2021-03-10 17:31:16,088 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51365abc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.03 05:31:16, skipping insertion in model container [2021-03-10 17:31:16,088 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.03 05:31:16" (3/3) ... [2021-03-10 17:31:16,089 INFO L111 eAbstractionObserver]: Analyzing ICFG safe017_power.oepc.i [2021-03-10 17:31:16,093 WARN L142 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-03-10 17:31:16,094 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-10 17:31:16,096 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-10 17:31:16,097 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-10 17:31:16,118 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:16,119 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:16,119 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:16,119 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:16,119 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:16,119 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:16,119 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:16,119 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:16,119 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:16,119 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:16,120 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:16,120 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:16,120 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:16,120 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:16,120 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:16,120 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:16,120 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:16,120 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:16,121 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:16,121 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:16,121 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:16,121 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:16,121 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:16,121 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:16,121 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:16,121 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:16,121 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:16,122 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:16,122 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:16,122 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:16,122 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:16,122 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:16,122 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:16,122 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:16,123 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:16,123 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:16,123 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:16,123 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:16,123 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:16,123 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:16,123 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:16,123 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:16,123 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:16,123 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:16,123 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:16,124 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:16,124 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:16,124 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:16,124 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:16,124 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:16,124 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:16,124 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:16,124 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:16,124 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:16,124 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:16,125 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:16,125 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:16,125 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:16,125 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:16,125 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:16,125 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:16,125 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:16,125 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:16,126 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:16,126 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:16,126 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:16,126 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:16,126 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:16,126 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:16,126 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:16,126 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:16,126 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:16,126 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:16,126 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:16,127 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:16,127 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:16,127 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:16,127 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:16,127 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:16,127 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:16,127 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:16,127 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:16,128 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:16,128 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:16,128 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:16,128 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:16,129 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:16,129 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:16,130 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:16,130 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:16,130 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:16,130 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:16,130 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:16,130 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:16,130 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:16,130 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:16,132 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:16,132 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:16,132 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:16,132 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:16,132 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:16,132 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:16,132 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:16,132 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:16,133 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:16,133 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:16,134 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:16,134 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:16,134 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:16,134 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:16,134 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:16,134 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:16,134 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:16,134 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:16,134 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:16,135 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:16,135 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:16,135 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:31:16,135 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-10 17:31:16,146 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-03-10 17:31:16,160 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-10 17:31:16,160 INFO L377 AbstractCegarLoop]: Hoare is true [2021-03-10 17:31:16,160 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-10 17:31:16,160 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-10 17:31:16,160 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-10 17:31:16,160 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-10 17:31:16,161 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-10 17:31:16,161 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-10 17:31:16,170 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 103 places, 95 transitions, 205 flow [2021-03-10 17:31:16,793 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 13428 states, 13424 states have (on average 3.6315554231227654) internal successors, (48750), 13427 states have internal predecessors, (48750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:31:16,816 INFO L276 IsEmpty]: Start isEmpty. Operand has 13428 states, 13424 states have (on average 3.6315554231227654) internal successors, (48750), 13427 states have internal predecessors, (48750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:31:16,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-03-10 17:31:16,831 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 17:31:16,832 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 17:31:16,832 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-10 17:31:16,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 17:31:16,840 INFO L82 PathProgramCache]: Analyzing trace with hash -186725599, now seen corresponding path program 1 times [2021-03-10 17:31:16,845 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 17:31:16,846 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227334357] [2021-03-10 17:31:16,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 17:31:16,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 17:31:17,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 17:31:17,009 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227334357] [2021-03-10 17:31:17,010 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-10 17:31:17,010 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-10 17:31:17,011 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129877658] [2021-03-10 17:31:17,014 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-10 17:31:17,014 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 17:31:17,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-10 17:31:17,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-10 17:31:17,046 INFO L87 Difference]: Start difference. First operand has 13428 states, 13424 states have (on average 3.6315554231227654) internal successors, (48750), 13427 states have internal predecessors, (48750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 19.0) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:31:17,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 17:31:17,203 INFO L93 Difference]: Finished difference Result 11492 states and 40660 transitions. [2021-03-10 17:31:17,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-10 17:31:17,204 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 19.0) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-03-10 17:31:17,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 17:31:17,256 INFO L225 Difference]: With dead ends: 11492 [2021-03-10 17:31:17,257 INFO L226 Difference]: Without dead ends: 6564 [2021-03-10 17:31:17,257 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.3ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-10 17:31:17,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6564 states. [2021-03-10 17:31:17,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6564 to 6564. [2021-03-10 17:31:17,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6564 states, 6563 states have (on average 3.4868200518055765) internal successors, (22884), 6563 states have internal predecessors, (22884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:31:17,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6564 states to 6564 states and 22884 transitions. [2021-03-10 17:31:17,609 INFO L78 Accepts]: Start accepts. Automaton has 6564 states and 22884 transitions. Word has length 38 [2021-03-10 17:31:17,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 17:31:17,609 INFO L480 AbstractCegarLoop]: Abstraction has 6564 states and 22884 transitions. [2021-03-10 17:31:17,611 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 2 states have (on average 19.0) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:31:17,611 INFO L276 IsEmpty]: Start isEmpty. Operand 6564 states and 22884 transitions. [2021-03-10 17:31:17,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-03-10 17:31:17,622 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 17:31:17,623 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 17:31:17,623 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-10 17:31:17,623 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-10 17:31:17,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 17:31:17,626 INFO L82 PathProgramCache]: Analyzing trace with hash -1293174682, now seen corresponding path program 1 times [2021-03-10 17:31:17,626 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 17:31:17,627 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119860455] [2021-03-10 17:31:17,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 17:31:17,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 17:31:17,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 17:31:17,858 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119860455] [2021-03-10 17:31:17,859 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-10 17:31:17,859 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-10 17:31:17,859 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081216254] [2021-03-10 17:31:17,860 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-10 17:31:17,860 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 17:31:17,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-10 17:31:17,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-03-10 17:31:17,865 INFO L87 Difference]: Start difference. First operand 6564 states and 22884 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:31:18,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 17:31:18,086 INFO L93 Difference]: Finished difference Result 7684 states and 26504 transitions. [2021-03-10 17:31:18,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-10 17:31:18,086 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2021-03-10 17:31:18,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 17:31:18,118 INFO L225 Difference]: With dead ends: 7684 [2021-03-10 17:31:18,118 INFO L226 Difference]: Without dead ends: 5892 [2021-03-10 17:31:18,119 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 74.2ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-03-10 17:31:18,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5892 states. [2021-03-10 17:31:18,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5892 to 5892. [2021-03-10 17:31:18,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5892 states, 5891 states have (on average 3.4588355117976572) internal successors, (20376), 5891 states have internal predecessors, (20376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:31:18,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5892 states to 5892 states and 20376 transitions. [2021-03-10 17:31:18,305 INFO L78 Accepts]: Start accepts. Automaton has 5892 states and 20376 transitions. Word has length 57 [2021-03-10 17:31:18,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 17:31:18,306 INFO L480 AbstractCegarLoop]: Abstraction has 5892 states and 20376 transitions. [2021-03-10 17:31:18,306 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:31:18,306 INFO L276 IsEmpty]: Start isEmpty. Operand 5892 states and 20376 transitions. [2021-03-10 17:31:18,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-03-10 17:31:18,317 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 17:31:18,317 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 17:31:18,317 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-10 17:31:18,317 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-10 17:31:18,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 17:31:18,318 INFO L82 PathProgramCache]: Analyzing trace with hash 456860895, now seen corresponding path program 1 times [2021-03-10 17:31:18,318 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 17:31:18,318 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225645747] [2021-03-10 17:31:18,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 17:31:18,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 17:31:18,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 17:31:18,507 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225645747] [2021-03-10 17:31:18,507 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-10 17:31:18,507 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-03-10 17:31:18,507 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419132723] [2021-03-10 17:31:18,507 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-10 17:31:18,507 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 17:31:18,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-10 17:31:18,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-03-10 17:31:18,508 INFO L87 Difference]: Start difference. First operand 5892 states and 20376 transitions. Second operand has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:31:18,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 17:31:18,696 INFO L93 Difference]: Finished difference Result 9420 states and 32520 transitions. [2021-03-10 17:31:18,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-03-10 17:31:18,701 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2021-03-10 17:31:18,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 17:31:18,724 INFO L225 Difference]: With dead ends: 9420 [2021-03-10 17:31:18,724 INFO L226 Difference]: Without dead ends: 5388 [2021-03-10 17:31:18,724 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 119.1ms TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2021-03-10 17:31:18,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5388 states. [2021-03-10 17:31:18,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5388 to 5388. [2021-03-10 17:31:18,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5388 states, 5387 states have (on average 3.421570447373306) internal successors, (18432), 5387 states have internal predecessors, (18432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:31:18,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5388 states to 5388 states and 18432 transitions. [2021-03-10 17:31:18,877 INFO L78 Accepts]: Start accepts. Automaton has 5388 states and 18432 transitions. Word has length 59 [2021-03-10 17:31:18,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 17:31:18,879 INFO L480 AbstractCegarLoop]: Abstraction has 5388 states and 18432 transitions. [2021-03-10 17:31:18,879 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:31:18,879 INFO L276 IsEmpty]: Start isEmpty. Operand 5388 states and 18432 transitions. [2021-03-10 17:31:18,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-03-10 17:31:18,886 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 17:31:18,886 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 17:31:18,886 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-10 17:31:18,886 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-10 17:31:18,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 17:31:18,887 INFO L82 PathProgramCache]: Analyzing trace with hash 547779774, now seen corresponding path program 1 times [2021-03-10 17:31:18,887 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 17:31:18,887 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70830330] [2021-03-10 17:31:18,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 17:31:18,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 17:31:19,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 17:31:19,081 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70830330] [2021-03-10 17:31:19,081 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-10 17:31:19,081 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-03-10 17:31:19,081 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763536029] [2021-03-10 17:31:19,081 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-03-10 17:31:19,081 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 17:31:19,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-03-10 17:31:19,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2021-03-10 17:31:19,082 INFO L87 Difference]: Start difference. First operand 5388 states and 18432 transitions. Second operand has 10 states, 10 states have (on average 6.1) internal successors, (61), 10 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:31:19,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 17:31:19,387 INFO L93 Difference]: Finished difference Result 6560 states and 22296 transitions. [2021-03-10 17:31:19,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-03-10 17:31:19,388 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.1) internal successors, (61), 10 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2021-03-10 17:31:19,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 17:31:19,403 INFO L225 Difference]: With dead ends: 6560 [2021-03-10 17:31:19,404 INFO L226 Difference]: Without dead ends: 5568 [2021-03-10 17:31:19,404 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 203.4ms TimeCoverageRelationStatistics Valid=99, Invalid=207, Unknown=0, NotChecked=0, Total=306 [2021-03-10 17:31:19,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5568 states. [2021-03-10 17:31:19,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5568 to 5328. [2021-03-10 17:31:19,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5328 states, 5327 states have (on average 3.4173080533133096) internal successors, (18204), 5327 states have internal predecessors, (18204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:31:19,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5328 states to 5328 states and 18204 transitions. [2021-03-10 17:31:19,526 INFO L78 Accepts]: Start accepts. Automaton has 5328 states and 18204 transitions. Word has length 61 [2021-03-10 17:31:19,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 17:31:19,528 INFO L480 AbstractCegarLoop]: Abstraction has 5328 states and 18204 transitions. [2021-03-10 17:31:19,528 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 6.1) internal successors, (61), 10 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:31:19,528 INFO L276 IsEmpty]: Start isEmpty. Operand 5328 states and 18204 transitions. [2021-03-10 17:31:19,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-03-10 17:31:19,536 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 17:31:19,536 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 17:31:19,536 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-10 17:31:19,536 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-10 17:31:19,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 17:31:19,537 INFO L82 PathProgramCache]: Analyzing trace with hash 327960956, now seen corresponding path program 1 times [2021-03-10 17:31:19,537 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 17:31:19,537 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112419077] [2021-03-10 17:31:19,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 17:31:19,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 17:31:19,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 17:31:19,723 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112419077] [2021-03-10 17:31:19,723 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-10 17:31:19,723 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-03-10 17:31:19,723 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121907730] [2021-03-10 17:31:19,724 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-03-10 17:31:19,724 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 17:31:19,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-03-10 17:31:19,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-03-10 17:31:19,724 INFO L87 Difference]: Start difference. First operand 5328 states and 18204 transitions. Second operand has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 9 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:31:20,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 17:31:20,111 INFO L93 Difference]: Finished difference Result 6226 states and 21144 transitions. [2021-03-10 17:31:20,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-03-10 17:31:20,112 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 9 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2021-03-10 17:31:20,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 17:31:20,125 INFO L225 Difference]: With dead ends: 6226 [2021-03-10 17:31:20,125 INFO L226 Difference]: Without dead ends: 5394 [2021-03-10 17:31:20,126 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 223.8ms TimeCoverageRelationStatistics Valid=114, Invalid=228, Unknown=0, NotChecked=0, Total=342 [2021-03-10 17:31:20,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5394 states. [2021-03-10 17:31:20,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5394 to 5338. [2021-03-10 17:31:20,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5338 states, 5337 states have (on average 3.4161513959153083) internal successors, (18232), 5337 states have internal predecessors, (18232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:31:20,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5338 states to 5338 states and 18232 transitions. [2021-03-10 17:31:20,239 INFO L78 Accepts]: Start accepts. Automaton has 5338 states and 18232 transitions. Word has length 62 [2021-03-10 17:31:20,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 17:31:20,240 INFO L480 AbstractCegarLoop]: Abstraction has 5338 states and 18232 transitions. [2021-03-10 17:31:20,241 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 9 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:31:20,241 INFO L276 IsEmpty]: Start isEmpty. Operand 5338 states and 18232 transitions. [2021-03-10 17:31:20,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-03-10 17:31:20,249 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 17:31:20,249 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 17:31:20,249 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-10 17:31:20,249 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-10 17:31:20,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 17:31:20,249 INFO L82 PathProgramCache]: Analyzing trace with hash -1766176550, now seen corresponding path program 2 times [2021-03-10 17:31:20,249 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 17:31:20,250 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513582575] [2021-03-10 17:31:20,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 17:31:20,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 17:31:20,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 17:31:20,369 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513582575] [2021-03-10 17:31:20,369 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-10 17:31:20,370 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-03-10 17:31:20,370 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404097874] [2021-03-10 17:31:20,370 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-03-10 17:31:20,370 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 17:31:20,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-03-10 17:31:20,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-03-10 17:31:20,371 INFO L87 Difference]: Start difference. First operand 5338 states and 18232 transitions. Second operand has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 9 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:31:20,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 17:31:20,636 INFO L93 Difference]: Finished difference Result 5894 states and 19992 transitions. [2021-03-10 17:31:20,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-03-10 17:31:20,637 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 9 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2021-03-10 17:31:20,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 17:31:20,651 INFO L225 Difference]: With dead ends: 5894 [2021-03-10 17:31:20,652 INFO L226 Difference]: Without dead ends: 5094 [2021-03-10 17:31:20,652 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 110.6ms TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2021-03-10 17:31:20,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5094 states. [2021-03-10 17:31:20,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5094 to 5028. [2021-03-10 17:31:20,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5028 states, 5027 states have (on average 3.4064054107817783) internal successors, (17124), 5027 states have internal predecessors, (17124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:31:20,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5028 states to 5028 states and 17124 transitions. [2021-03-10 17:31:20,765 INFO L78 Accepts]: Start accepts. Automaton has 5028 states and 17124 transitions. Word has length 62 [2021-03-10 17:31:20,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 17:31:20,766 INFO L480 AbstractCegarLoop]: Abstraction has 5028 states and 17124 transitions. [2021-03-10 17:31:20,766 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 9 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:31:20,766 INFO L276 IsEmpty]: Start isEmpty. Operand 5028 states and 17124 transitions. [2021-03-10 17:31:20,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-03-10 17:31:20,773 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 17:31:20,773 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 17:31:20,773 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-10 17:31:20,773 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-10 17:31:20,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 17:31:20,773 INFO L82 PathProgramCache]: Analyzing trace with hash -1010842488, now seen corresponding path program 1 times [2021-03-10 17:31:20,774 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 17:31:20,774 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940427915] [2021-03-10 17:31:20,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 17:31:20,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 17:31:20,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 17:31:20,895 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940427915] [2021-03-10 17:31:20,896 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-10 17:31:20,896 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-03-10 17:31:20,896 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340645372] [2021-03-10 17:31:20,896 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-10 17:31:20,896 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 17:31:20,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-10 17:31:20,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-03-10 17:31:20,897 INFO L87 Difference]: Start difference. First operand 5028 states and 17124 transitions. Second operand has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:31:21,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 17:31:21,089 INFO L93 Difference]: Finished difference Result 11708 states and 39368 transitions. [2021-03-10 17:31:21,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-03-10 17:31:21,090 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2021-03-10 17:31:21,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 17:31:21,101 INFO L225 Difference]: With dead ends: 11708 [2021-03-10 17:31:21,101 INFO L226 Difference]: Without dead ends: 5088 [2021-03-10 17:31:21,102 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 126.8ms TimeCoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2021-03-10 17:31:21,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5088 states. [2021-03-10 17:31:21,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5088 to 4188. [2021-03-10 17:31:21,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4188 states, 4187 states have (on average 3.2748984953427276) internal successors, (13712), 4187 states have internal predecessors, (13712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:31:21,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4188 states to 4188 states and 13712 transitions. [2021-03-10 17:31:21,195 INFO L78 Accepts]: Start accepts. Automaton has 4188 states and 13712 transitions. Word has length 62 [2021-03-10 17:31:21,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 17:31:21,195 INFO L480 AbstractCegarLoop]: Abstraction has 4188 states and 13712 transitions. [2021-03-10 17:31:21,195 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:31:21,195 INFO L276 IsEmpty]: Start isEmpty. Operand 4188 states and 13712 transitions. [2021-03-10 17:31:21,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-03-10 17:31:21,200 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 17:31:21,200 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 17:31:21,201 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-10 17:31:21,201 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-10 17:31:21,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 17:31:21,201 INFO L82 PathProgramCache]: Analyzing trace with hash 448200960, now seen corresponding path program 1 times [2021-03-10 17:31:21,202 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 17:31:21,202 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604651235] [2021-03-10 17:31:21,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 17:31:21,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 17:31:21,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 17:31:21,355 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604651235] [2021-03-10 17:31:21,355 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-10 17:31:21,355 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-03-10 17:31:21,355 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723195449] [2021-03-10 17:31:21,355 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-03-10 17:31:21,356 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 17:31:21,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-03-10 17:31:21,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-03-10 17:31:21,356 INFO L87 Difference]: Start difference. First operand 4188 states and 13712 transitions. Second operand has 9 states, 9 states have (on average 7.0) internal successors, (63), 9 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:31:21,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 17:31:21,625 INFO L93 Difference]: Finished difference Result 4896 states and 15982 transitions. [2021-03-10 17:31:21,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-03-10 17:31:21,627 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 9 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2021-03-10 17:31:21,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 17:31:21,636 INFO L225 Difference]: With dead ends: 4896 [2021-03-10 17:31:21,636 INFO L226 Difference]: Without dead ends: 4176 [2021-03-10 17:31:21,636 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 211.2ms TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2021-03-10 17:31:21,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4176 states. [2021-03-10 17:31:21,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4176 to 4176. [2021-03-10 17:31:21,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4176 states, 4175 states have (on average 3.272814371257485) internal successors, (13664), 4175 states have internal predecessors, (13664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:31:21,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4176 states to 4176 states and 13664 transitions. [2021-03-10 17:31:21,720 INFO L78 Accepts]: Start accepts. Automaton has 4176 states and 13664 transitions. Word has length 63 [2021-03-10 17:31:21,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 17:31:21,721 INFO L480 AbstractCegarLoop]: Abstraction has 4176 states and 13664 transitions. [2021-03-10 17:31:21,721 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 9 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:31:21,721 INFO L276 IsEmpty]: Start isEmpty. Operand 4176 states and 13664 transitions. [2021-03-10 17:31:21,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-03-10 17:31:21,727 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 17:31:21,727 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 17:31:21,727 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-10 17:31:21,727 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-10 17:31:21,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 17:31:21,728 INFO L82 PathProgramCache]: Analyzing trace with hash 1366940332, now seen corresponding path program 1 times [2021-03-10 17:31:21,728 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 17:31:21,728 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076812208] [2021-03-10 17:31:21,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 17:31:21,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 17:31:21,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 17:31:21,908 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076812208] [2021-03-10 17:31:21,908 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-10 17:31:21,908 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-03-10 17:31:21,908 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038076820] [2021-03-10 17:31:21,909 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-03-10 17:31:21,909 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 17:31:21,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-03-10 17:31:21,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2021-03-10 17:31:21,911 INFO L87 Difference]: Start difference. First operand 4176 states and 13664 transitions. Second operand has 11 states, 11 states have (on average 5.818181818181818) internal successors, (64), 11 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:31:22,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 17:31:22,138 INFO L93 Difference]: Finished difference Result 4864 states and 15772 transitions. [2021-03-10 17:31:22,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-03-10 17:31:22,139 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.818181818181818) internal successors, (64), 11 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2021-03-10 17:31:22,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 17:31:22,147 INFO L225 Difference]: With dead ends: 4864 [2021-03-10 17:31:22,147 INFO L226 Difference]: Without dead ends: 4288 [2021-03-10 17:31:22,147 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 191.3ms TimeCoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2021-03-10 17:31:22,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4288 states. [2021-03-10 17:31:22,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4288 to 4288. [2021-03-10 17:31:22,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4288 states, 4287 states have (on average 3.2526242127361793) internal successors, (13944), 4287 states have internal predecessors, (13944), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:31:22,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4288 states to 4288 states and 13944 transitions. [2021-03-10 17:31:22,216 INFO L78 Accepts]: Start accepts. Automaton has 4288 states and 13944 transitions. Word has length 64 [2021-03-10 17:31:22,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 17:31:22,216 INFO L480 AbstractCegarLoop]: Abstraction has 4288 states and 13944 transitions. [2021-03-10 17:31:22,216 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 5.818181818181818) internal successors, (64), 11 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:31:22,216 INFO L276 IsEmpty]: Start isEmpty. Operand 4288 states and 13944 transitions. [2021-03-10 17:31:22,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-03-10 17:31:22,222 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 17:31:22,222 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 17:31:22,222 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-10 17:31:22,223 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-10 17:31:22,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 17:31:22,223 INFO L82 PathProgramCache]: Analyzing trace with hash -344285634, now seen corresponding path program 1 times [2021-03-10 17:31:22,223 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 17:31:22,223 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133178654] [2021-03-10 17:31:22,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 17:31:22,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 17:31:22,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 17:31:22,356 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133178654] [2021-03-10 17:31:22,356 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-10 17:31:22,356 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-03-10 17:31:22,356 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570425205] [2021-03-10 17:31:22,356 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-03-10 17:31:22,356 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 17:31:22,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-03-10 17:31:22,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2021-03-10 17:31:22,357 INFO L87 Difference]: Start difference. First operand 4288 states and 13944 transitions. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:31:22,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 17:31:22,562 INFO L93 Difference]: Finished difference Result 4994 states and 16204 transitions. [2021-03-10 17:31:22,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-10 17:31:22,563 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2021-03-10 17:31:22,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 17:31:22,570 INFO L225 Difference]: With dead ends: 4994 [2021-03-10 17:31:22,570 INFO L226 Difference]: Without dead ends: 4394 [2021-03-10 17:31:22,571 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 138.0ms TimeCoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2021-03-10 17:31:22,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4394 states. [2021-03-10 17:31:22,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4394 to 4303. [2021-03-10 17:31:22,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4303 states, 4302 states have (on average 3.2498837749883775) internal successors, (13981), 4302 states have internal predecessors, (13981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:31:22,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4303 states to 4303 states and 13981 transitions. [2021-03-10 17:31:22,657 INFO L78 Accepts]: Start accepts. Automaton has 4303 states and 13981 transitions. Word has length 64 [2021-03-10 17:31:22,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 17:31:22,657 INFO L480 AbstractCegarLoop]: Abstraction has 4303 states and 13981 transitions. [2021-03-10 17:31:22,657 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:31:22,657 INFO L276 IsEmpty]: Start isEmpty. Operand 4303 states and 13981 transitions. [2021-03-10 17:31:22,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-03-10 17:31:22,663 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 17:31:22,664 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 17:31:22,664 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-10 17:31:22,664 INFO L428 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-10 17:31:22,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 17:31:22,664 INFO L82 PathProgramCache]: Analyzing trace with hash 505930228, now seen corresponding path program 2 times [2021-03-10 17:31:22,664 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 17:31:22,664 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315644895] [2021-03-10 17:31:22,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 17:31:22,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 17:31:22,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 17:31:22,921 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315644895] [2021-03-10 17:31:22,921 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-10 17:31:22,921 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-03-10 17:31:22,921 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910765341] [2021-03-10 17:31:22,921 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-03-10 17:31:22,921 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 17:31:22,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-03-10 17:31:22,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2021-03-10 17:31:22,922 INFO L87 Difference]: Start difference. First operand 4303 states and 13981 transitions. Second operand has 13 states, 13 states have (on average 4.923076923076923) internal successors, (64), 13 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:31:23,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 17:31:23,225 INFO L93 Difference]: Finished difference Result 4831 states and 15633 transitions. [2021-03-10 17:31:23,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-03-10 17:31:23,226 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.923076923076923) internal successors, (64), 13 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2021-03-10 17:31:23,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 17:31:23,232 INFO L225 Difference]: With dead ends: 4831 [2021-03-10 17:31:23,232 INFO L226 Difference]: Without dead ends: 4255 [2021-03-10 17:31:23,233 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 300.4ms TimeCoverageRelationStatistics Valid=106, Invalid=274, Unknown=0, NotChecked=0, Total=380 [2021-03-10 17:31:23,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4255 states. [2021-03-10 17:31:23,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4255 to 4143. [2021-03-10 17:31:23,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4143 states, 4142 states have (on average 3.2643650410429745) internal successors, (13521), 4142 states have internal predecessors, (13521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:31:23,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4143 states to 4143 states and 13521 transitions. [2021-03-10 17:31:23,307 INFO L78 Accepts]: Start accepts. Automaton has 4143 states and 13521 transitions. Word has length 64 [2021-03-10 17:31:23,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 17:31:23,307 INFO L480 AbstractCegarLoop]: Abstraction has 4143 states and 13521 transitions. [2021-03-10 17:31:23,307 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 4.923076923076923) internal successors, (64), 13 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:31:23,307 INFO L276 IsEmpty]: Start isEmpty. Operand 4143 states and 13521 transitions. [2021-03-10 17:31:23,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-03-10 17:31:23,313 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 17:31:23,313 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 17:31:23,313 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-03-10 17:31:23,313 INFO L428 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-10 17:31:23,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 17:31:23,313 INFO L82 PathProgramCache]: Analyzing trace with hash 1535985018, now seen corresponding path program 2 times [2021-03-10 17:31:23,313 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 17:31:23,313 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196097534] [2021-03-10 17:31:23,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 17:31:23,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 17:31:23,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 17:31:23,447 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196097534] [2021-03-10 17:31:23,448 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-10 17:31:23,448 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-03-10 17:31:23,448 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855671188] [2021-03-10 17:31:23,448 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-03-10 17:31:23,448 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 17:31:23,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-03-10 17:31:23,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2021-03-10 17:31:23,449 INFO L87 Difference]: Start difference. First operand 4143 states and 13521 transitions. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:31:23,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 17:31:23,693 INFO L93 Difference]: Finished difference Result 5145 states and 16830 transitions. [2021-03-10 17:31:23,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-03-10 17:31:23,694 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2021-03-10 17:31:23,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 17:31:23,701 INFO L225 Difference]: With dead ends: 5145 [2021-03-10 17:31:23,701 INFO L226 Difference]: Without dead ends: 4545 [2021-03-10 17:31:23,701 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 186.7ms TimeCoverageRelationStatistics Valid=71, Invalid=201, Unknown=0, NotChecked=0, Total=272 [2021-03-10 17:31:23,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4545 states. [2021-03-10 17:31:23,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4545 to 4168. [2021-03-10 17:31:23,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4168 states, 4167 states have (on average 3.2603791696664266) internal successors, (13586), 4167 states have internal predecessors, (13586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:31:23,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4168 states to 4168 states and 13586 transitions. [2021-03-10 17:31:23,768 INFO L78 Accepts]: Start accepts. Automaton has 4168 states and 13586 transitions. Word has length 64 [2021-03-10 17:31:23,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 17:31:23,768 INFO L480 AbstractCegarLoop]: Abstraction has 4168 states and 13586 transitions. [2021-03-10 17:31:23,768 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:31:23,768 INFO L276 IsEmpty]: Start isEmpty. Operand 4168 states and 13586 transitions. [2021-03-10 17:31:23,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-03-10 17:31:23,773 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 17:31:23,774 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 17:31:23,774 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-03-10 17:31:23,774 INFO L428 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-10 17:31:23,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 17:31:23,774 INFO L82 PathProgramCache]: Analyzing trace with hash 1529232924, now seen corresponding path program 3 times [2021-03-10 17:31:23,774 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 17:31:23,774 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363014588] [2021-03-10 17:31:23,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 17:31:23,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 17:31:23,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 17:31:23,899 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363014588] [2021-03-10 17:31:23,899 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-10 17:31:23,899 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-03-10 17:31:23,899 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63734365] [2021-03-10 17:31:23,899 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-03-10 17:31:23,899 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 17:31:23,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-03-10 17:31:23,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2021-03-10 17:31:23,900 INFO L87 Difference]: Start difference. First operand 4168 states and 13586 transitions. Second operand has 11 states, 11 states have (on average 5.818181818181818) internal successors, (64), 11 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:31:24,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 17:31:24,193 INFO L93 Difference]: Finished difference Result 4909 states and 15961 transitions. [2021-03-10 17:31:24,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-03-10 17:31:24,193 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.818181818181818) internal successors, (64), 11 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2021-03-10 17:31:24,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 17:31:24,201 INFO L225 Difference]: With dead ends: 4909 [2021-03-10 17:31:24,201 INFO L226 Difference]: Without dead ends: 4277 [2021-03-10 17:31:24,201 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 210.3ms TimeCoverageRelationStatistics Valid=85, Invalid=221, Unknown=0, NotChecked=0, Total=306 [2021-03-10 17:31:24,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4277 states. [2021-03-10 17:31:24,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4277 to 4257. [2021-03-10 17:31:24,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4257 states, 4256 states have (on average 3.263157894736842) internal successors, (13888), 4256 states have internal predecessors, (13888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:31:24,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4257 states to 4257 states and 13888 transitions. [2021-03-10 17:31:24,269 INFO L78 Accepts]: Start accepts. Automaton has 4257 states and 13888 transitions. Word has length 64 [2021-03-10 17:31:24,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 17:31:24,269 INFO L480 AbstractCegarLoop]: Abstraction has 4257 states and 13888 transitions. [2021-03-10 17:31:24,269 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 5.818181818181818) internal successors, (64), 11 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:31:24,269 INFO L276 IsEmpty]: Start isEmpty. Operand 4257 states and 13888 transitions. [2021-03-10 17:31:24,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-03-10 17:31:24,275 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 17:31:24,275 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 17:31:24,275 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-03-10 17:31:24,275 INFO L428 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-10 17:31:24,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 17:31:24,276 INFO L82 PathProgramCache]: Analyzing trace with hash 218916636, now seen corresponding path program 4 times [2021-03-10 17:31:24,276 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 17:31:24,276 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860195698] [2021-03-10 17:31:24,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 17:31:24,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 17:31:24,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 17:31:24,389 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860195698] [2021-03-10 17:31:24,389 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-10 17:31:24,389 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-03-10 17:31:24,390 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376294134] [2021-03-10 17:31:24,390 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-03-10 17:31:24,390 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 17:31:24,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-03-10 17:31:24,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2021-03-10 17:31:24,390 INFO L87 Difference]: Start difference. First operand 4257 states and 13888 transitions. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:31:24,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 17:31:24,654 INFO L93 Difference]: Finished difference Result 5306 states and 17319 transitions. [2021-03-10 17:31:24,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-03-10 17:31:24,655 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2021-03-10 17:31:24,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 17:31:24,662 INFO L225 Difference]: With dead ends: 5306 [2021-03-10 17:31:24,662 INFO L226 Difference]: Without dead ends: 4594 [2021-03-10 17:31:24,662 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 144.9ms TimeCoverageRelationStatistics Valid=76, Invalid=164, Unknown=0, NotChecked=0, Total=240 [2021-03-10 17:31:24,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4594 states. [2021-03-10 17:31:24,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4594 to 4404. [2021-03-10 17:31:24,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4404 states, 4403 states have (on average 3.2741312741312742) internal successors, (14416), 4403 states have internal predecessors, (14416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:31:24,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4404 states to 4404 states and 14416 transitions. [2021-03-10 17:31:24,734 INFO L78 Accepts]: Start accepts. Automaton has 4404 states and 14416 transitions. Word has length 64 [2021-03-10 17:31:24,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 17:31:24,734 INFO L480 AbstractCegarLoop]: Abstraction has 4404 states and 14416 transitions. [2021-03-10 17:31:24,734 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:31:24,734 INFO L276 IsEmpty]: Start isEmpty. Operand 4404 states and 14416 transitions. [2021-03-10 17:31:24,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-03-10 17:31:24,741 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 17:31:24,741 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 17:31:24,741 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-03-10 17:31:24,741 INFO L428 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-10 17:31:24,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 17:31:24,741 INFO L82 PathProgramCache]: Analyzing trace with hash -1181741382, now seen corresponding path program 1 times [2021-03-10 17:31:24,741 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 17:31:24,741 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794732770] [2021-03-10 17:31:24,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 17:31:24,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 17:31:24,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 17:31:24,909 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794732770] [2021-03-10 17:31:24,909 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-10 17:31:24,909 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-03-10 17:31:24,909 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550406665] [2021-03-10 17:31:24,910 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-03-10 17:31:24,910 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 17:31:24,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-03-10 17:31:24,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2021-03-10 17:31:24,910 INFO L87 Difference]: Start difference. First operand 4404 states and 14416 transitions. Second operand has 12 states, 12 states have (on average 5.416666666666667) internal successors, (65), 12 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:31:25,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 17:31:25,117 INFO L93 Difference]: Finished difference Result 4974 states and 16165 transitions. [2021-03-10 17:31:25,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-03-10 17:31:25,118 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.416666666666667) internal successors, (65), 12 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2021-03-10 17:31:25,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 17:31:25,126 INFO L225 Difference]: With dead ends: 4974 [2021-03-10 17:31:25,126 INFO L226 Difference]: Without dead ends: 4494 [2021-03-10 17:31:25,127 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 162.8ms TimeCoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2021-03-10 17:31:25,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4494 states. [2021-03-10 17:31:25,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4494 to 4407. [2021-03-10 17:31:25,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4407 states, 4406 states have (on average 3.273717657739446) internal successors, (14424), 4406 states have internal predecessors, (14424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:31:25,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4407 states to 4407 states and 14424 transitions. [2021-03-10 17:31:25,204 INFO L78 Accepts]: Start accepts. Automaton has 4407 states and 14424 transitions. Word has length 65 [2021-03-10 17:31:25,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 17:31:25,204 INFO L480 AbstractCegarLoop]: Abstraction has 4407 states and 14424 transitions. [2021-03-10 17:31:25,204 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 5.416666666666667) internal successors, (65), 12 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:31:25,204 INFO L276 IsEmpty]: Start isEmpty. Operand 4407 states and 14424 transitions. [2021-03-10 17:31:25,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-03-10 17:31:25,210 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 17:31:25,210 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 17:31:25,211 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-03-10 17:31:25,211 INFO L428 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-10 17:31:25,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 17:31:25,211 INFO L82 PathProgramCache]: Analyzing trace with hash -668759235, now seen corresponding path program 1 times [2021-03-10 17:31:25,211 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 17:31:25,211 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854961122] [2021-03-10 17:31:25,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 17:31:25,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 17:31:25,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 17:31:25,398 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854961122] [2021-03-10 17:31:25,398 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-10 17:31:25,398 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-03-10 17:31:25,398 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650989319] [2021-03-10 17:31:25,398 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-03-10 17:31:25,398 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 17:31:25,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-03-10 17:31:25,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2021-03-10 17:31:25,399 INFO L87 Difference]: Start difference. First operand 4407 states and 14424 transitions. Second operand has 12 states, 12 states have (on average 5.416666666666667) internal successors, (65), 12 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:31:25,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 17:31:25,761 INFO L93 Difference]: Finished difference Result 5227 states and 16888 transitions. [2021-03-10 17:31:25,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-03-10 17:31:25,761 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.416666666666667) internal successors, (65), 12 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2021-03-10 17:31:25,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 17:31:25,768 INFO L225 Difference]: With dead ends: 5227 [2021-03-10 17:31:25,768 INFO L226 Difference]: Without dead ends: 4455 [2021-03-10 17:31:25,769 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 324.6ms TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2021-03-10 17:31:25,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4455 states. [2021-03-10 17:31:25,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4455 to 4455. [2021-03-10 17:31:25,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4455 states, 4454 states have (on average 3.260215536596318) internal successors, (14521), 4454 states have internal predecessors, (14521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:31:25,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4455 states to 4455 states and 14521 transitions. [2021-03-10 17:31:25,832 INFO L78 Accepts]: Start accepts. Automaton has 4455 states and 14521 transitions. Word has length 65 [2021-03-10 17:31:25,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 17:31:25,832 INFO L480 AbstractCegarLoop]: Abstraction has 4455 states and 14521 transitions. [2021-03-10 17:31:25,832 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 5.416666666666667) internal successors, (65), 12 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:31:25,832 INFO L276 IsEmpty]: Start isEmpty. Operand 4455 states and 14521 transitions. [2021-03-10 17:31:25,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-03-10 17:31:25,838 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 17:31:25,838 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 17:31:25,838 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-03-10 17:31:25,839 INFO L428 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-10 17:31:25,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 17:31:25,839 INFO L82 PathProgramCache]: Analyzing trace with hash -724061313, now seen corresponding path program 2 times [2021-03-10 17:31:25,839 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 17:31:25,839 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885705159] [2021-03-10 17:31:25,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 17:31:25,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 17:31:26,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 17:31:26,034 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885705159] [2021-03-10 17:31:26,034 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-10 17:31:26,034 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-03-10 17:31:26,034 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107530281] [2021-03-10 17:31:26,035 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-03-10 17:31:26,035 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 17:31:26,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-03-10 17:31:26,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2021-03-10 17:31:26,035 INFO L87 Difference]: Start difference. First operand 4455 states and 14521 transitions. Second operand has 13 states, 13 states have (on average 5.0) internal successors, (65), 13 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:31:26,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 17:31:26,261 INFO L93 Difference]: Finished difference Result 5359 states and 17319 transitions. [2021-03-10 17:31:26,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-03-10 17:31:26,261 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.0) internal successors, (65), 13 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2021-03-10 17:31:26,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 17:31:26,269 INFO L225 Difference]: With dead ends: 5359 [2021-03-10 17:31:26,269 INFO L226 Difference]: Without dead ends: 4823 [2021-03-10 17:31:26,269 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 203.2ms TimeCoverageRelationStatistics Valid=63, Invalid=243, Unknown=0, NotChecked=0, Total=306 [2021-03-10 17:31:26,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4823 states. [2021-03-10 17:31:26,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4823 to 4455. [2021-03-10 17:31:26,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4455 states, 4454 states have (on average 3.259317467444993) internal successors, (14517), 4454 states have internal predecessors, (14517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:31:26,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4455 states to 4455 states and 14517 transitions. [2021-03-10 17:31:26,334 INFO L78 Accepts]: Start accepts. Automaton has 4455 states and 14517 transitions. Word has length 65 [2021-03-10 17:31:26,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 17:31:26,335 INFO L480 AbstractCegarLoop]: Abstraction has 4455 states and 14517 transitions. [2021-03-10 17:31:26,335 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 5.0) internal successors, (65), 13 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:31:26,335 INFO L276 IsEmpty]: Start isEmpty. Operand 4455 states and 14517 transitions. [2021-03-10 17:31:26,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-03-10 17:31:26,341 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 17:31:26,341 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 17:31:26,341 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-03-10 17:31:26,341 INFO L428 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-10 17:31:26,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 17:31:26,341 INFO L82 PathProgramCache]: Analyzing trace with hash -132502342, now seen corresponding path program 2 times [2021-03-10 17:31:26,341 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 17:31:26,341 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601023077] [2021-03-10 17:31:26,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 17:31:26,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 17:31:26,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 17:31:26,558 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601023077] [2021-03-10 17:31:26,560 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-10 17:31:26,560 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-03-10 17:31:26,560 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561710410] [2021-03-10 17:31:26,561 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-03-10 17:31:26,561 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 17:31:26,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-03-10 17:31:26,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2021-03-10 17:31:26,562 INFO L87 Difference]: Start difference. First operand 4455 states and 14517 transitions. Second operand has 13 states, 13 states have (on average 5.0) internal successors, (65), 13 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:31:27,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 17:31:27,038 INFO L93 Difference]: Finished difference Result 5284 states and 17180 transitions. [2021-03-10 17:31:27,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-03-10 17:31:27,038 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.0) internal successors, (65), 13 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2021-03-10 17:31:27,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 17:31:27,046 INFO L225 Difference]: With dead ends: 5284 [2021-03-10 17:31:27,046 INFO L226 Difference]: Without dead ends: 4740 [2021-03-10 17:31:27,046 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 435.2ms TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2021-03-10 17:31:27,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4740 states. [2021-03-10 17:31:27,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4740 to 4424. [2021-03-10 17:31:27,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4424 states, 4423 states have (on average 3.255482704047027) internal successors, (14399), 4423 states have internal predecessors, (14399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:31:27,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4424 states to 4424 states and 14399 transitions. [2021-03-10 17:31:27,115 INFO L78 Accepts]: Start accepts. Automaton has 4424 states and 14399 transitions. Word has length 65 [2021-03-10 17:31:27,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 17:31:27,115 INFO L480 AbstractCegarLoop]: Abstraction has 4424 states and 14399 transitions. [2021-03-10 17:31:27,115 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 5.0) internal successors, (65), 13 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:31:27,116 INFO L276 IsEmpty]: Start isEmpty. Operand 4424 states and 14399 transitions. [2021-03-10 17:31:27,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-03-10 17:31:27,121 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 17:31:27,122 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 17:31:27,122 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-03-10 17:31:27,122 INFO L428 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-10 17:31:27,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 17:31:27,122 INFO L82 PathProgramCache]: Analyzing trace with hash 1785056129, now seen corresponding path program 3 times [2021-03-10 17:31:27,122 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 17:31:27,122 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245739229] [2021-03-10 17:31:27,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 17:31:27,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 17:31:27,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 17:31:27,334 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245739229] [2021-03-10 17:31:27,334 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-10 17:31:27,335 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-03-10 17:31:27,335 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545259104] [2021-03-10 17:31:27,336 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-03-10 17:31:27,336 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 17:31:27,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-03-10 17:31:27,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2021-03-10 17:31:27,336 INFO L87 Difference]: Start difference. First operand 4424 states and 14399 transitions. Second operand has 12 states, 12 states have (on average 5.416666666666667) internal successors, (65), 12 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:31:27,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 17:31:27,795 INFO L93 Difference]: Finished difference Result 7150 states and 23027 transitions. [2021-03-10 17:31:27,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-03-10 17:31:27,796 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.416666666666667) internal successors, (65), 12 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2021-03-10 17:31:27,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 17:31:27,804 INFO L225 Difference]: With dead ends: 7150 [2021-03-10 17:31:27,804 INFO L226 Difference]: Without dead ends: 4554 [2021-03-10 17:31:27,804 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 427.4ms TimeCoverageRelationStatistics Valid=147, Invalid=405, Unknown=0, NotChecked=0, Total=552 [2021-03-10 17:31:27,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4554 states. [2021-03-10 17:31:27,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4554 to 3902. [2021-03-10 17:31:27,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3902 states, 3901 states have (on average 3.1886695719046396) internal successors, (12439), 3901 states have internal predecessors, (12439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:31:27,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3902 states to 3902 states and 12439 transitions. [2021-03-10 17:31:27,869 INFO L78 Accepts]: Start accepts. Automaton has 3902 states and 12439 transitions. Word has length 65 [2021-03-10 17:31:27,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 17:31:27,869 INFO L480 AbstractCegarLoop]: Abstraction has 3902 states and 12439 transitions. [2021-03-10 17:31:27,869 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 5.416666666666667) internal successors, (65), 12 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:31:27,869 INFO L276 IsEmpty]: Start isEmpty. Operand 3902 states and 12439 transitions. [2021-03-10 17:31:27,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-03-10 17:31:27,874 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 17:31:27,874 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 17:31:27,874 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-03-10 17:31:27,874 INFO L428 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-10 17:31:27,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 17:31:27,875 INFO L82 PathProgramCache]: Analyzing trace with hash -341817256, now seen corresponding path program 3 times [2021-03-10 17:31:27,875 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 17:31:27,875 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361680315] [2021-03-10 17:31:27,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 17:31:27,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 17:31:28,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 17:31:28,066 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361680315] [2021-03-10 17:31:28,066 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-10 17:31:28,066 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-03-10 17:31:28,066 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915753072] [2021-03-10 17:31:28,066 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-03-10 17:31:28,066 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 17:31:28,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-03-10 17:31:28,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2021-03-10 17:31:28,067 INFO L87 Difference]: Start difference. First operand 3902 states and 12439 transitions. Second operand has 13 states, 13 states have (on average 5.0) internal successors, (65), 13 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:31:28,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 17:31:28,307 INFO L93 Difference]: Finished difference Result 4552 states and 14369 transitions. [2021-03-10 17:31:28,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-03-10 17:31:28,308 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.0) internal successors, (65), 13 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2021-03-10 17:31:28,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 17:31:28,313 INFO L225 Difference]: With dead ends: 4552 [2021-03-10 17:31:28,314 INFO L226 Difference]: Without dead ends: 4044 [2021-03-10 17:31:28,314 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 226.3ms TimeCoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2021-03-10 17:31:28,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4044 states. [2021-03-10 17:31:28,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4044 to 3892. [2021-03-10 17:31:28,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3892 states, 3891 states have (on average 3.189668465690054) internal successors, (12411), 3891 states have internal predecessors, (12411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:31:28,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3892 states to 3892 states and 12411 transitions. [2021-03-10 17:31:28,367 INFO L78 Accepts]: Start accepts. Automaton has 3892 states and 12411 transitions. Word has length 65 [2021-03-10 17:31:28,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 17:31:28,368 INFO L480 AbstractCegarLoop]: Abstraction has 3892 states and 12411 transitions. [2021-03-10 17:31:28,368 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 5.0) internal successors, (65), 13 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:31:28,368 INFO L276 IsEmpty]: Start isEmpty. Operand 3892 states and 12411 transitions. [2021-03-10 17:31:28,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-03-10 17:31:28,375 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 17:31:28,375 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 17:31:28,375 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-03-10 17:31:28,375 INFO L428 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-10 17:31:28,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 17:31:28,375 INFO L82 PathProgramCache]: Analyzing trace with hash -1065781476, now seen corresponding path program 4 times [2021-03-10 17:31:28,375 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 17:31:28,375 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131853157] [2021-03-10 17:31:28,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 17:31:28,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 17:31:28,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 17:31:28,569 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131853157] [2021-03-10 17:31:28,569 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-10 17:31:28,569 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-03-10 17:31:28,569 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205189838] [2021-03-10 17:31:28,570 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-03-10 17:31:28,570 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 17:31:28,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-03-10 17:31:28,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2021-03-10 17:31:28,570 INFO L87 Difference]: Start difference. First operand 3892 states and 12411 transitions. Second operand has 13 states, 13 states have (on average 5.0) internal successors, (65), 13 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:31:28,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 17:31:28,813 INFO L93 Difference]: Finished difference Result 4331 states and 13754 transitions. [2021-03-10 17:31:28,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-03-10 17:31:28,814 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.0) internal successors, (65), 13 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2021-03-10 17:31:28,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 17:31:28,821 INFO L225 Difference]: With dead ends: 4331 [2021-03-10 17:31:28,821 INFO L226 Difference]: Without dead ends: 3851 [2021-03-10 17:31:28,821 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 215.5ms TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2021-03-10 17:31:28,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3851 states. [2021-03-10 17:31:28,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3851 to 3804. [2021-03-10 17:31:28,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3804 states, 3803 states have (on average 3.1890612674204575) internal successors, (12128), 3803 states have internal predecessors, (12128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:31:28,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3804 states to 3804 states and 12128 transitions. [2021-03-10 17:31:28,872 INFO L78 Accepts]: Start accepts. Automaton has 3804 states and 12128 transitions. Word has length 65 [2021-03-10 17:31:28,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 17:31:28,873 INFO L480 AbstractCegarLoop]: Abstraction has 3804 states and 12128 transitions. [2021-03-10 17:31:28,873 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 5.0) internal successors, (65), 13 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:31:28,873 INFO L276 IsEmpty]: Start isEmpty. Operand 3804 states and 12128 transitions. [2021-03-10 17:31:28,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-03-10 17:31:28,876 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 17:31:28,877 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 17:31:28,877 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-03-10 17:31:28,877 INFO L428 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-10 17:31:28,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 17:31:28,877 INFO L82 PathProgramCache]: Analyzing trace with hash -1345615081, now seen corresponding path program 1 times [2021-03-10 17:31:28,877 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 17:31:28,877 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897473561] [2021-03-10 17:31:28,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 17:31:28,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 17:31:28,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 17:31:28,925 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897473561] [2021-03-10 17:31:28,925 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-10 17:31:28,925 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-10 17:31:28,925 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297598821] [2021-03-10 17:31:28,925 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-10 17:31:28,925 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 17:31:28,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-10 17:31:28,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-03-10 17:31:28,926 INFO L87 Difference]: Start difference. First operand 3804 states and 12128 transitions. Second operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:31:29,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 17:31:29,007 INFO L93 Difference]: Finished difference Result 4714 states and 14780 transitions. [2021-03-10 17:31:29,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-10 17:31:29,007 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2021-03-10 17:31:29,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 17:31:29,013 INFO L225 Difference]: With dead ends: 4714 [2021-03-10 17:31:29,013 INFO L226 Difference]: Without dead ends: 3386 [2021-03-10 17:31:29,013 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 60.3ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-03-10 17:31:29,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3386 states. [2021-03-10 17:31:29,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3386 to 3386. [2021-03-10 17:31:29,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3386 states, 3385 states have (on average 3.1438700147710485) internal successors, (10642), 3385 states have internal predecessors, (10642), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:31:29,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3386 states to 3386 states and 10642 transitions. [2021-03-10 17:31:29,058 INFO L78 Accepts]: Start accepts. Automaton has 3386 states and 10642 transitions. Word has length 65 [2021-03-10 17:31:29,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 17:31:29,058 INFO L480 AbstractCegarLoop]: Abstraction has 3386 states and 10642 transitions. [2021-03-10 17:31:29,058 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:31:29,058 INFO L276 IsEmpty]: Start isEmpty. Operand 3386 states and 10642 transitions. [2021-03-10 17:31:29,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-03-10 17:31:29,062 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 17:31:29,062 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 17:31:29,062 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-03-10 17:31:29,062 INFO L428 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-10 17:31:29,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 17:31:29,062 INFO L82 PathProgramCache]: Analyzing trace with hash -1433237926, now seen corresponding path program 1 times [2021-03-10 17:31:29,062 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 17:31:29,062 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338962099] [2021-03-10 17:31:29,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 17:31:29,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 17:31:29,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 17:31:29,117 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338962099] [2021-03-10 17:31:29,117 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-10 17:31:29,117 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-03-10 17:31:29,117 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753707659] [2021-03-10 17:31:29,117 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-10 17:31:29,117 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 17:31:29,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-10 17:31:29,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-03-10 17:31:29,118 INFO L87 Difference]: Start difference. First operand 3386 states and 10642 transitions. Second operand has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:31:29,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 17:31:29,214 INFO L93 Difference]: Finished difference Result 3446 states and 10472 transitions. [2021-03-10 17:31:29,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-03-10 17:31:29,215 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2021-03-10 17:31:29,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 17:31:29,218 INFO L225 Difference]: With dead ends: 3446 [2021-03-10 17:31:29,219 INFO L226 Difference]: Without dead ends: 2366 [2021-03-10 17:31:29,219 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 73.4ms TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2021-03-10 17:31:29,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2366 states. [2021-03-10 17:31:29,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2366 to 2366. [2021-03-10 17:31:29,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2366 states, 2365 states have (on average 2.991966173361522) internal successors, (7076), 2365 states have internal predecessors, (7076), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:31:29,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2366 states to 2366 states and 7076 transitions. [2021-03-10 17:31:29,249 INFO L78 Accepts]: Start accepts. Automaton has 2366 states and 7076 transitions. Word has length 66 [2021-03-10 17:31:29,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 17:31:29,250 INFO L480 AbstractCegarLoop]: Abstraction has 2366 states and 7076 transitions. [2021-03-10 17:31:29,250 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:31:29,250 INFO L276 IsEmpty]: Start isEmpty. Operand 2366 states and 7076 transitions. [2021-03-10 17:31:29,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-03-10 17:31:29,252 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 17:31:29,252 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 17:31:29,253 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-03-10 17:31:29,253 INFO L428 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-10 17:31:29,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 17:31:29,253 INFO L82 PathProgramCache]: Analyzing trace with hash 1999288178, now seen corresponding path program 1 times [2021-03-10 17:31:29,253 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 17:31:29,253 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845614974] [2021-03-10 17:31:29,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 17:31:29,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 17:31:29,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 17:31:29,487 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845614974] [2021-03-10 17:31:29,487 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-10 17:31:29,487 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-03-10 17:31:29,487 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860529420] [2021-03-10 17:31:29,488 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-03-10 17:31:29,488 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 17:31:29,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-03-10 17:31:29,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2021-03-10 17:31:29,488 INFO L87 Difference]: Start difference. First operand 2366 states and 7076 transitions. Second operand has 14 states, 14 states have (on average 4.857142857142857) internal successors, (68), 14 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:31:29,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 17:31:29,717 INFO L93 Difference]: Finished difference Result 2686 states and 7946 transitions. [2021-03-10 17:31:29,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-03-10 17:31:29,718 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.857142857142857) internal successors, (68), 14 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2021-03-10 17:31:29,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 17:31:29,721 INFO L225 Difference]: With dead ends: 2686 [2021-03-10 17:31:29,721 INFO L226 Difference]: Without dead ends: 2366 [2021-03-10 17:31:29,721 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 264.6ms TimeCoverageRelationStatistics Valid=112, Invalid=268, Unknown=0, NotChecked=0, Total=380 [2021-03-10 17:31:29,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2366 states. [2021-03-10 17:31:29,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2366 to 2366. [2021-03-10 17:31:29,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2366 states, 2365 states have (on average 2.991120507399577) internal successors, (7074), 2365 states have internal predecessors, (7074), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:31:29,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2366 states to 2366 states and 7074 transitions. [2021-03-10 17:31:29,750 INFO L78 Accepts]: Start accepts. Automaton has 2366 states and 7074 transitions. Word has length 68 [2021-03-10 17:31:29,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 17:31:29,750 INFO L480 AbstractCegarLoop]: Abstraction has 2366 states and 7074 transitions. [2021-03-10 17:31:29,750 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 4.857142857142857) internal successors, (68), 14 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:31:29,750 INFO L276 IsEmpty]: Start isEmpty. Operand 2366 states and 7074 transitions. [2021-03-10 17:31:29,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-03-10 17:31:29,752 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 17:31:29,752 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 17:31:29,752 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-03-10 17:31:29,752 INFO L428 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-10 17:31:29,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 17:31:29,753 INFO L82 PathProgramCache]: Analyzing trace with hash 1649490768, now seen corresponding path program 2 times [2021-03-10 17:31:29,753 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 17:31:29,753 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038929592] [2021-03-10 17:31:29,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 17:31:29,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 17:31:29,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 17:31:29,910 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038929592] [2021-03-10 17:31:29,910 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-10 17:31:29,910 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-03-10 17:31:29,910 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616097791] [2021-03-10 17:31:29,911 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-03-10 17:31:29,911 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 17:31:29,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-03-10 17:31:29,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2021-03-10 17:31:29,911 INFO L87 Difference]: Start difference. First operand 2366 states and 7074 transitions. Second operand has 14 states, 14 states have (on average 4.857142857142857) internal successors, (68), 14 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:31:30,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 17:31:30,146 INFO L93 Difference]: Finished difference Result 2730 states and 8092 transitions. [2021-03-10 17:31:30,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-03-10 17:31:30,147 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.857142857142857) internal successors, (68), 14 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2021-03-10 17:31:30,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 17:31:30,150 INFO L225 Difference]: With dead ends: 2730 [2021-03-10 17:31:30,151 INFO L226 Difference]: Without dead ends: 2400 [2021-03-10 17:31:30,151 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 182.9ms TimeCoverageRelationStatistics Valid=105, Invalid=275, Unknown=0, NotChecked=0, Total=380 [2021-03-10 17:31:30,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2400 states. [2021-03-10 17:31:30,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2400 to 2346. [2021-03-10 17:31:30,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2346 states, 2345 states have (on average 2.9961620469083154) internal successors, (7026), 2345 states have internal predecessors, (7026), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:31:30,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2346 states to 2346 states and 7026 transitions. [2021-03-10 17:31:30,186 INFO L78 Accepts]: Start accepts. Automaton has 2346 states and 7026 transitions. Word has length 68 [2021-03-10 17:31:30,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 17:31:30,186 INFO L480 AbstractCegarLoop]: Abstraction has 2346 states and 7026 transitions. [2021-03-10 17:31:30,186 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 4.857142857142857) internal successors, (68), 14 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:31:30,186 INFO L276 IsEmpty]: Start isEmpty. Operand 2346 states and 7026 transitions. [2021-03-10 17:31:30,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-03-10 17:31:30,189 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 17:31:30,189 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 17:31:30,189 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-03-10 17:31:30,189 INFO L428 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-10 17:31:30,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 17:31:30,190 INFO L82 PathProgramCache]: Analyzing trace with hash -1896709202, now seen corresponding path program 3 times [2021-03-10 17:31:30,190 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 17:31:30,190 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901211366] [2021-03-10 17:31:30,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 17:31:30,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 17:31:30,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 17:31:30,449 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901211366] [2021-03-10 17:31:30,449 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-10 17:31:30,450 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-03-10 17:31:30,450 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009492394] [2021-03-10 17:31:30,450 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-03-10 17:31:30,450 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 17:31:30,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-03-10 17:31:30,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2021-03-10 17:31:30,451 INFO L87 Difference]: Start difference. First operand 2346 states and 7026 transitions. Second operand has 15 states, 15 states have (on average 4.533333333333333) internal successors, (68), 15 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:31:30,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 17:31:30,723 INFO L93 Difference]: Finished difference Result 3392 states and 10177 transitions. [2021-03-10 17:31:30,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-03-10 17:31:30,724 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.533333333333333) internal successors, (68), 15 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2021-03-10 17:31:30,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 17:31:30,728 INFO L225 Difference]: With dead ends: 3392 [2021-03-10 17:31:30,728 INFO L226 Difference]: Without dead ends: 2194 [2021-03-10 17:31:30,728 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 332.2ms TimeCoverageRelationStatistics Valid=125, Invalid=295, Unknown=0, NotChecked=0, Total=420 [2021-03-10 17:31:30,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2194 states. [2021-03-10 17:31:30,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2194 to 1830. [2021-03-10 17:31:30,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1830 states, 1829 states have (on average 2.989611809732094) internal successors, (5468), 1829 states have internal predecessors, (5468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:31:30,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1830 states to 1830 states and 5468 transitions. [2021-03-10 17:31:30,759 INFO L78 Accepts]: Start accepts. Automaton has 1830 states and 5468 transitions. Word has length 68 [2021-03-10 17:31:30,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 17:31:30,759 INFO L480 AbstractCegarLoop]: Abstraction has 1830 states and 5468 transitions. [2021-03-10 17:31:30,759 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 4.533333333333333) internal successors, (68), 15 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:31:30,759 INFO L276 IsEmpty]: Start isEmpty. Operand 1830 states and 5468 transitions. [2021-03-10 17:31:30,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-03-10 17:31:30,761 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 17:31:30,761 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 17:31:30,761 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-03-10 17:31:30,761 INFO L428 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-10 17:31:30,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 17:31:30,762 INFO L82 PathProgramCache]: Analyzing trace with hash 2765265, now seen corresponding path program 1 times [2021-03-10 17:31:30,762 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 17:31:30,762 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446010660] [2021-03-10 17:31:30,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 17:31:30,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 17:31:30,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 17:31:30,840 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446010660] [2021-03-10 17:31:30,840 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-10 17:31:30,840 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-03-10 17:31:30,840 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495020489] [2021-03-10 17:31:30,840 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-03-10 17:31:30,840 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 17:31:30,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-03-10 17:31:30,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-03-10 17:31:30,841 INFO L87 Difference]: Start difference. First operand 1830 states and 5468 transitions. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:31:30,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 17:31:30,958 INFO L93 Difference]: Finished difference Result 1452 states and 4163 transitions. [2021-03-10 17:31:30,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-03-10 17:31:30,959 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2021-03-10 17:31:30,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 17:31:30,960 INFO L225 Difference]: With dead ends: 1452 [2021-03-10 17:31:30,960 INFO L226 Difference]: Without dead ends: 740 [2021-03-10 17:31:30,960 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 95.8ms TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2021-03-10 17:31:30,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 740 states. [2021-03-10 17:31:30,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 740 to 740. [2021-03-10 17:31:30,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 740 states, 739 states have (on average 2.7307171853856564) internal successors, (2018), 739 states have internal predecessors, (2018), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:31:30,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 740 states to 740 states and 2018 transitions. [2021-03-10 17:31:30,969 INFO L78 Accepts]: Start accepts. Automaton has 740 states and 2018 transitions. Word has length 68 [2021-03-10 17:31:30,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 17:31:30,969 INFO L480 AbstractCegarLoop]: Abstraction has 740 states and 2018 transitions. [2021-03-10 17:31:30,969 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:31:30,970 INFO L276 IsEmpty]: Start isEmpty. Operand 740 states and 2018 transitions. [2021-03-10 17:31:30,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-03-10 17:31:30,970 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 17:31:30,971 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 17:31:30,971 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-03-10 17:31:30,971 INFO L428 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-10 17:31:30,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 17:31:30,971 INFO L82 PathProgramCache]: Analyzing trace with hash -421554612, now seen corresponding path program 1 times [2021-03-10 17:31:30,971 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 17:31:30,971 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228318826] [2021-03-10 17:31:30,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 17:31:31,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-10 17:31:31,008 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-10 17:31:31,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-10 17:31:31,045 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-10 17:31:31,083 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-10 17:31:31,083 INFO L620 BasicCegarLoop]: Counterexample might be feasible [2021-03-10 17:31:31,083 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-03-10 17:31:31,166 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.03 05:31:31 BasicIcfg [2021-03-10 17:31:31,166 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-10 17:31:31,167 INFO L168 Benchmark]: Toolchain (without parser) took 16993.78 ms. Allocated memory was 255.9 MB in the beginning and 1.7 GB in the end (delta: 1.4 GB). Free memory was 232.0 MB in the beginning and 1.0 GB in the end (delta: -785.5 MB). Peak memory consumption was 620.5 MB. Max. memory is 16.0 GB. [2021-03-10 17:31:31,167 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 255.9 MB. Free memory is still 237.6 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-03-10 17:31:31,167 INFO L168 Benchmark]: CACSL2BoogieTranslator took 331.74 ms. Allocated memory was 255.9 MB in the beginning and 375.4 MB in the end (delta: 119.5 MB). Free memory was 231.3 MB in the beginning and 334.8 MB in the end (delta: -103.5 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.0 GB. [2021-03-10 17:31:31,167 INFO L168 Benchmark]: Boogie Procedure Inliner took 35.10 ms. Allocated memory is still 375.4 MB. Free memory was 334.8 MB in the beginning and 332.0 MB in the end (delta: 2.8 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. [2021-03-10 17:31:31,167 INFO L168 Benchmark]: Boogie Preprocessor took 32.27 ms. Allocated memory is still 375.4 MB. Free memory was 332.0 MB in the beginning and 329.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-10 17:31:31,167 INFO L168 Benchmark]: RCFGBuilder took 1506.29 ms. Allocated memory is still 375.4 MB. Free memory was 329.9 MB in the beginning and 244.1 MB in the end (delta: 85.8 MB). Peak memory consumption was 86.6 MB. Max. memory is 16.0 GB. [2021-03-10 17:31:31,167 INFO L168 Benchmark]: TraceAbstraction took 15080.77 ms. Allocated memory was 375.4 MB in the beginning and 1.7 GB in the end (delta: 1.3 GB). Free memory was 244.1 MB in the beginning and 1.0 GB in the end (delta: -773.4 MB). Peak memory consumption was 514.2 MB. Max. memory is 16.0 GB. [2021-03-10 17:31:31,167 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.14 ms. Allocated memory is still 255.9 MB. Free memory is still 237.6 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 331.74 ms. Allocated memory was 255.9 MB in the beginning and 375.4 MB in the end (delta: 119.5 MB). Free memory was 231.3 MB in the beginning and 334.8 MB in the end (delta: -103.5 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 35.10 ms. Allocated memory is still 375.4 MB. Free memory was 334.8 MB in the beginning and 332.0 MB in the end (delta: 2.8 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 32.27 ms. Allocated memory is still 375.4 MB. Free memory was 332.0 MB in the beginning and 329.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1506.29 ms. Allocated memory is still 375.4 MB. Free memory was 329.9 MB in the beginning and 244.1 MB in the end (delta: 85.8 MB). Peak memory consumption was 86.6 MB. Max. memory is 16.0 GB. * TraceAbstraction took 15080.77 ms. Allocated memory was 375.4 MB in the beginning and 1.7 GB in the end (delta: 1.3 GB). Free memory was 244.1 MB in the beginning and 1.0 GB in the end (delta: -773.4 MB). Peak memory consumption was 514.2 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L711] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0] [L712] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0] [L713] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L715] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L717] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L718] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L719] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L720] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L721] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L722] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=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] [L723] 0 _Bool y$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=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] [L724] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0] [L725] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L726] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L727] 0 _Bool y$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0] [L728] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0] [L729] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L730] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L731] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L732] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L733] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L734] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L735] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L813] 0 pthread_t t2177; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L814] FCALL, FORK 0 pthread_create(&t2177, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L815] 0 pthread_t t2178; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L816] FCALL, FORK 0 pthread_create(&t2178, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L817] 0 pthread_t t2179; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L818] FCALL, FORK 0 pthread_create(&t2179, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L739] 1 y$w_buff1 = y$w_buff0 [L740] 1 y$w_buff0 = 2 [L741] 1 y$w_buff1_used = y$w_buff0_used [L742] 1 y$w_buff0_used = (_Bool)1 [L18] COND FALSE 1 !(!expression) [L744] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L745] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L746] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L747] 1 y$r_buff1_thd3 = y$r_buff0_thd3 [L748] 1 y$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L751] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L768] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L771] 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) [L771] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L771] 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) [L771] 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) [L772] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L772] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L773] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L773] 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 [L774] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L774] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L775] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L775] 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 [L778] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=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=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L785] 3 __unbuffered_p2_EAX = x VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=2, 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=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L788] 3 y = 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=2, 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=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L754] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L754] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L755] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L755] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L756] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L756] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L757] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L757] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L758] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L758] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L761] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p2_EAX=2, 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=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L791] 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) [L791] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L791] 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) [L791] 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) [L792] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L792] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L793] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L793] 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 [L794] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L794] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L795] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L795] 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 [L798] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=2, 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=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L820] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=2, 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=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L3] COND FALSE 0 !(!cond) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=2, 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=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L824] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L824] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L824] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L824] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L825] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L825] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L826] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L826] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L827] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L827] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L828] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L828] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L831] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L832] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L833] 0 y$flush_delayed = weak$$choice2 [L834] 0 y$mem_tmp = y [L835] 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) [L835] 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) [L836] 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)) [L836] 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)) [L837] 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)) [L837] 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)) [L838] 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)) [L838] 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)) [L839] 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)) [L839] 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)) [L840] 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)) [L840] 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)) [L841] 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)) [L841] 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)) [L842] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 2) [L843] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L843] 0 y = y$flush_delayed ? y$mem_tmp : y [L844] 0 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L18] COND TRUE 0 !expression VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L18] 0 reach_error() VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 94 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 14927.1ms, OverallIterations: 28, TraceHistogramMax: 1, EmptinessCheckTime: 188.4ms, AutomataDifference: 7134.9ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 632.2ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 3231 SDtfs, 5841 SDslu, 15097 SDs, 0 SdLazy, 2820 SolverSat, 552 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2379.6ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 455 GetRequests, 55 SyntacticMatches, 2 SemanticMatches, 398 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1071 ImplicationChecksByTransitivity, 5252.4ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=13428occurred in iteration=0, InterpolantAutomatonStates: 329, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 2259.4ms AutomataMinimizationTime, 27 MinimizatonAttempts, 4092 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 64.5ms SsaConstructionTime, 617.0ms SatisfiabilityAnalysisTime, 3699.4ms InterpolantComputationTime, 1777 NumberOfCodeBlocks, 1777 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 1679 ConstructedInterpolants, 0 QuantifiedInterpolants, 11624 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 27 InterpolantComputations, 27 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...