/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/ldv-races/race-3_2-container_of-global.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-dev-29289db [2021-06-05 00:35:00,807 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-06-05 00:35:00,809 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-06-05 00:35:00,850 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-06-05 00:35:00,850 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-06-05 00:35:00,851 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-06-05 00:35:00,854 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-06-05 00:35:00,863 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-06-05 00:35:00,866 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-06-05 00:35:00,872 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-06-05 00:35:00,873 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-06-05 00:35:00,874 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-06-05 00:35:00,874 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-06-05 00:35:00,876 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-06-05 00:35:00,877 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-06-05 00:35:00,879 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-06-05 00:35:00,880 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-06-05 00:35:00,881 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-06-05 00:35:00,884 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-06-05 00:35:00,889 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-06-05 00:35:00,890 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-06-05 00:35:00,893 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-06-05 00:35:00,894 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-06-05 00:35:00,896 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-06-05 00:35:00,916 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-06-05 00:35:00,916 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-06-05 00:35:00,917 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-06-05 00:35:00,918 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-06-05 00:35:00,918 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-06-05 00:35:00,919 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-06-05 00:35:00,919 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-06-05 00:35:00,920 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-06-05 00:35:00,922 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-06-05 00:35:00,922 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-06-05 00:35:00,923 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-06-05 00:35:00,923 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-06-05 00:35:00,924 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-06-05 00:35:00,924 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-06-05 00:35:00,924 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-06-05 00:35:00,925 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-06-05 00:35:00,925 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-06-05 00:35:00,929 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-06-05 00:35:00,964 INFO L113 SettingsManager]: Loading preferences was successful [2021-06-05 00:35:00,964 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-06-05 00:35:00,965 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-06-05 00:35:00,965 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-06-05 00:35:00,967 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-06-05 00:35:00,967 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-06-05 00:35:00,967 INFO L138 SettingsManager]: * Use SBE=true [2021-06-05 00:35:00,967 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-06-05 00:35:00,968 INFO L138 SettingsManager]: * sizeof long=4 [2021-06-05 00:35:00,968 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-06-05 00:35:00,968 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-06-05 00:35:00,969 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-06-05 00:35:00,969 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-06-05 00:35:00,969 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-06-05 00:35:00,969 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-06-05 00:35:00,969 INFO L138 SettingsManager]: * sizeof long double=12 [2021-06-05 00:35:00,969 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-06-05 00:35:00,969 INFO L138 SettingsManager]: * Use constant arrays=true [2021-06-05 00:35:00,969 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-06-05 00:35:00,970 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-06-05 00:35:00,970 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-06-05 00:35:00,970 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-06-05 00:35:00,970 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-06-05 00:35:00,970 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-06-05 00:35:00,970 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-06-05 00:35:00,970 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-06-05 00:35:00,970 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-06-05 00:35:00,971 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-06-05 00:35:00,971 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-06-05 00:35:00,971 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-06-05 00:35:00,971 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-06-05 00:35:00,971 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-06-05 00:35:01,243 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-06-05 00:35:01,263 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-06-05 00:35:01,265 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-06-05 00:35:01,267 INFO L271 PluginConnector]: Initializing CDTParser... [2021-06-05 00:35:01,267 INFO L275 PluginConnector]: CDTParser initialized [2021-06-05 00:35:01,268 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-races/race-3_2-container_of-global.i [2021-06-05 00:35:01,320 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/537c49de6/80b40ded96e24840b079c27080d4514a/FLAG86b1a318f [2021-06-05 00:35:01,853 INFO L306 CDTParser]: Found 1 translation units. [2021-06-05 00:35:01,853 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-3_2-container_of-global.i [2021-06-05 00:35:01,878 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/537c49de6/80b40ded96e24840b079c27080d4514a/FLAG86b1a318f [2021-06-05 00:35:02,096 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/537c49de6/80b40ded96e24840b079c27080d4514a [2021-06-05 00:35:02,102 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-06-05 00:35:02,103 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-06-05 00:35:02,105 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-06-05 00:35:02,105 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-06-05 00:35:02,109 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-06-05 00:35:02,110 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.06 12:35:02" (1/1) ... [2021-06-05 00:35:02,110 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7bbef9fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 12:35:02, skipping insertion in model container [2021-06-05 00:35:02,111 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.06 12:35:02" (1/1) ... [2021-06-05 00:35:02,116 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-06-05 00:35:02,188 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-06-05 00:35:02,325 WARN L612 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2021-06-05 00:35:02,879 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-3_2-container_of-global.i[75009,75022] [2021-06-05 00:35:02,915 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-05 00:35:02,922 INFO L203 MainTranslator]: Completed pre-run [2021-06-05 00:35:02,932 WARN L612 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2021-06-05 00:35:02,962 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-3_2-container_of-global.i[75009,75022] [2021-06-05 00:35:02,969 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-05 00:35:03,241 INFO L208 MainTranslator]: Completed translation [2021-06-05 00:35:03,242 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 12:35:03 WrapperNode [2021-06-05 00:35:03,242 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-06-05 00:35:03,243 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-06-05 00:35:03,243 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-06-05 00:35:03,243 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-06-05 00:35:03,249 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 12:35:03" (1/1) ... [2021-06-05 00:35:03,271 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 12:35:03" (1/1) ... [2021-06-05 00:35:03,294 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-06-05 00:35:03,294 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-06-05 00:35:03,295 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-06-05 00:35:03,295 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-06-05 00:35:03,301 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 12:35:03" (1/1) ... [2021-06-05 00:35:03,302 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 12:35:03" (1/1) ... [2021-06-05 00:35:03,306 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 12:35:03" (1/1) ... [2021-06-05 00:35:03,306 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 12:35:03" (1/1) ... [2021-06-05 00:35:03,316 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 12:35:03" (1/1) ... [2021-06-05 00:35:03,318 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 12:35:03" (1/1) ... [2021-06-05 00:35:03,321 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 12:35:03" (1/1) ... [2021-06-05 00:35:03,326 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-06-05 00:35:03,327 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-06-05 00:35:03,327 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-06-05 00:35:03,327 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-06-05 00:35:03,328 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 12:35:03" (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-06-05 00:35:03,396 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-06-05 00:35:03,397 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-06-05 00:35:03,397 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-06-05 00:35:03,397 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-06-05 00:35:03,397 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-06-05 00:35:03,397 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-06-05 00:35:03,397 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-06-05 00:35:03,398 INFO L130 BoogieDeclarations]: Found specification of procedure my_callback [2021-06-05 00:35:03,398 INFO L138 BoogieDeclarations]: Found implementation of procedure my_callback [2021-06-05 00:35:03,398 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-06-05 00:35:03,398 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-06-05 00:35:03,398 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-06-05 00:35:03,399 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-06-05 00:35:03,968 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-06-05 00:35:03,969 INFO L299 CfgBuilder]: Removed 24 assume(true) statements. [2021-06-05 00:35:03,970 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.06 12:35:03 BoogieIcfgContainer [2021-06-05 00:35:03,970 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-06-05 00:35:03,972 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-06-05 00:35:03,972 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-06-05 00:35:03,974 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-06-05 00:35:03,974 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.06 12:35:02" (1/3) ... [2021-06-05 00:35:03,975 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48ec15b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.06 12:35:03, skipping insertion in model container [2021-06-05 00:35:03,975 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 12:35:03" (2/3) ... [2021-06-05 00:35:03,975 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48ec15b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.06 12:35:03, skipping insertion in model container [2021-06-05 00:35:03,975 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.06 12:35:03" (3/3) ... [2021-06-05 00:35:03,979 INFO L111 eAbstractionObserver]: Analyzing ICFG race-3_2-container_of-global.i [2021-06-05 00:35:03,987 WARN L148 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-06-05 00:35:03,987 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-06-05 00:35:03,987 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2021-06-05 00:35:03,988 INFO L510 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-06-05 00:35:04,032 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:35:04,033 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:35:04,033 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:35:04,033 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:35:04,033 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:35:04,033 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:35:04,033 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:35:04,033 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:35:04,034 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:35:04,034 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:35:04,034 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:35:04,035 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:35:04,035 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:35:04,035 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:35:04,035 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:35:04,035 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:35:04,035 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:35:04,035 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:35:04,035 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:35:04,036 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:35:04,036 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:35:04,036 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:35:04,036 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:35:04,036 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:35:04,036 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:35:04,037 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:35:04,037 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:35:04,037 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:35:04,037 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:35:04,037 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:35:04,037 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:35:04,038 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~lb~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:35:04,038 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:35:04,038 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:35:04,038 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:35:04,038 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~lb~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:35:04,039 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:35:04,039 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:35:04,039 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~lb~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:35:04,039 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:35:04,039 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:35:04,039 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~lb~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:35:04,040 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:35:04,040 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:35:04,040 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:35:04,040 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:35:04,040 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:35:04,040 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:35:04,041 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:35:04,041 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:35:04,041 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:35:04,041 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:35:04,041 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:35:04,041 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:35:04,041 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:35:04,041 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:35:04,042 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:35:04,042 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:35:04,042 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:35:04,042 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:35:04,042 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:35:04,042 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:35:04,042 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:35:04,043 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:35:04,043 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:35:04,043 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:35:04,043 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:35:04,043 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:35:04,043 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:35:04,043 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:35:04,043 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:35:04,043 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:35:04,044 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:35:04,044 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:35:04,044 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:35:04,044 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:35:04,044 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:35:04,044 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~lb~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:35:04,045 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:35:04,045 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:35:04,045 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:35:04,045 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~lb~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:35:04,045 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:35:04,046 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:35:04,046 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~lb~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:35:04,046 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:35:04,046 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:35:04,046 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~lb~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:35:04,046 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:35:04,046 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:35:04,046 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:35:04,047 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:35:04,050 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:35:04,051 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:35:04,051 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:35:04,052 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:35:04,053 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~lb~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:35:04,055 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:35:04,055 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:35:04,056 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:35:04,056 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:35:04,058 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:35:04,060 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:35:04,061 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:35:04,061 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:35:04,061 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:35:04,061 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:35:04,061 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~lb~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:35:04,061 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:35:04,061 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:35:04,061 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:35:04,062 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 00:35:04,077 INFO L149 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2021-06-05 00:35:04,096 INFO L255 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2021-06-05 00:35:04,127 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-05 00:35:04,127 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-05 00:35:04,127 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-05 00:35:04,128 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-05 00:35:04,128 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-05 00:35:04,128 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-05 00:35:04,128 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-05 00:35:04,128 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-05 00:35:04,146 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 158 places, 162 transitions, 346 flow [2021-06-05 00:35:04,348 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 4278 states, 4267 states have (on average 2.7492383407546286) internal successors, (11731), 4277 states have internal predecessors, (11731), 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-06-05 00:35:04,363 INFO L276 IsEmpty]: Start isEmpty. Operand has 4278 states, 4267 states have (on average 2.7492383407546286) internal successors, (11731), 4277 states have internal predecessors, (11731), 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-06-05 00:35:04,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-06-05 00:35:04,375 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 00:35:04,376 INFO L521 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] [2021-06-05 00:35:04,377 INFO L430 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 00:35:04,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 00:35:04,383 INFO L82 PathProgramCache]: Analyzing trace with hash -1369970770, now seen corresponding path program 1 times [2021-06-05 00:35:04,390 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 00:35:04,391 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362834523] [2021-06-05 00:35:04,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 00:35:04,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 00:35:04,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 00:35:04,774 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 00:35:04,774 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362834523] [2021-06-05 00:35:04,774 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362834523] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 00:35:04,774 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 00:35:04,775 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 00:35:04,775 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689274198] [2021-06-05 00:35:04,778 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-05 00:35:04,779 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 00:35:04,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-05 00:35:04,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-06-05 00:35:04,803 INFO L87 Difference]: Start difference. First operand has 4278 states, 4267 states have (on average 2.7492383407546286) internal successors, (11731), 4277 states have internal predecessors, (11731), 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 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 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-06-05 00:35:05,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 00:35:05,057 INFO L93 Difference]: Finished difference Result 4075 states and 10961 transitions. [2021-06-05 00:35:05,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-05 00:35:05,059 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 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 36 [2021-06-05 00:35:05,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 00:35:05,087 INFO L225 Difference]: With dead ends: 4075 [2021-06-05 00:35:05,087 INFO L226 Difference]: Without dead ends: 3358 [2021-06-05 00:35:05,088 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 75.1ms TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-06-05 00:35:05,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3358 states. [2021-06-05 00:35:05,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3358 to 3357. [2021-06-05 00:35:05,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3357 states, 3350 states have (on average 2.681492537313433) internal successors, (8983), 3356 states have internal predecessors, (8983), 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-06-05 00:35:05,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3357 states to 3357 states and 8983 transitions. [2021-06-05 00:35:05,239 INFO L78 Accepts]: Start accepts. Automaton has 3357 states and 8983 transitions. Word has length 36 [2021-06-05 00:35:05,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 00:35:05,239 INFO L482 AbstractCegarLoop]: Abstraction has 3357 states and 8983 transitions. [2021-06-05 00:35:05,240 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 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-06-05 00:35:05,240 INFO L276 IsEmpty]: Start isEmpty. Operand 3357 states and 8983 transitions. [2021-06-05 00:35:05,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-06-05 00:35:05,240 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 00:35:05,241 INFO L521 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] [2021-06-05 00:35:05,241 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-06-05 00:35:05,241 INFO L430 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 00:35:05,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 00:35:05,242 INFO L82 PathProgramCache]: Analyzing trace with hash -1499060535, now seen corresponding path program 1 times [2021-06-05 00:35:05,242 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 00:35:05,242 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387294045] [2021-06-05 00:35:05,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 00:35:05,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 00:35:05,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 00:35:05,332 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 00:35:05,332 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387294045] [2021-06-05 00:35:05,332 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387294045] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 00:35:05,333 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 00:35:05,333 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 00:35:05,333 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291560958] [2021-06-05 00:35:05,334 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-05 00:35:05,334 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 00:35:05,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-05 00:35:05,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-06-05 00:35:05,335 INFO L87 Difference]: Start difference. First operand 3357 states and 8983 transitions. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 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-06-05 00:35:05,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 00:35:05,476 INFO L93 Difference]: Finished difference Result 3359 states and 8985 transitions. [2021-06-05 00:35:05,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 00:35:05,476 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 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 42 [2021-06-05 00:35:05,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 00:35:05,492 INFO L225 Difference]: With dead ends: 3359 [2021-06-05 00:35:05,492 INFO L226 Difference]: Without dead ends: 3359 [2021-06-05 00:35:05,493 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 57.2ms TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2021-06-05 00:35:05,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3359 states. [2021-06-05 00:35:05,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3359 to 3355. [2021-06-05 00:35:05,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3355 states, 3349 states have (on average 2.6816960286652733) internal successors, (8981), 3354 states have internal predecessors, (8981), 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-06-05 00:35:05,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3355 states to 3355 states and 8981 transitions. [2021-06-05 00:35:05,594 INFO L78 Accepts]: Start accepts. Automaton has 3355 states and 8981 transitions. Word has length 42 [2021-06-05 00:35:05,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 00:35:05,595 INFO L482 AbstractCegarLoop]: Abstraction has 3355 states and 8981 transitions. [2021-06-05 00:35:05,595 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 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-06-05 00:35:05,596 INFO L276 IsEmpty]: Start isEmpty. Operand 3355 states and 8981 transitions. [2021-06-05 00:35:05,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-06-05 00:35:05,597 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 00:35:05,597 INFO L521 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] [2021-06-05 00:35:05,597 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-06-05 00:35:05,598 INFO L430 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 00:35:05,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 00:35:05,598 INFO L82 PathProgramCache]: Analyzing trace with hash 709377487, now seen corresponding path program 1 times [2021-06-05 00:35:05,598 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 00:35:05,598 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685159994] [2021-06-05 00:35:05,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 00:35:05,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 00:35:05,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 00:35:05,735 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 00:35:05,735 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685159994] [2021-06-05 00:35:05,736 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685159994] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 00:35:05,736 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 00:35:05,736 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 00:35:05,736 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993630754] [2021-06-05 00:35:05,737 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-05 00:35:05,738 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 00:35:05,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-05 00:35:05,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-06-05 00:35:05,743 INFO L87 Difference]: Start difference. First operand 3355 states and 8981 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 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-06-05 00:35:06,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 00:35:06,121 INFO L93 Difference]: Finished difference Result 4878 states and 13059 transitions. [2021-06-05 00:35:06,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-06-05 00:35:06,123 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 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 60 [2021-06-05 00:35:06,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 00:35:06,148 INFO L225 Difference]: With dead ends: 4878 [2021-06-05 00:35:06,148 INFO L226 Difference]: Without dead ends: 4878 [2021-06-05 00:35:06,149 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 119.7ms TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2021-06-05 00:35:06,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4878 states. [2021-06-05 00:35:06,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4878 to 3753. [2021-06-05 00:35:06,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3753 states, 3748 states have (on average 2.683831376734258) internal successors, (10059), 3752 states have internal predecessors, (10059), 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-06-05 00:35:06,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3753 states to 3753 states and 10059 transitions. [2021-06-05 00:35:06,274 INFO L78 Accepts]: Start accepts. Automaton has 3753 states and 10059 transitions. Word has length 60 [2021-06-05 00:35:06,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 00:35:06,275 INFO L482 AbstractCegarLoop]: Abstraction has 3753 states and 10059 transitions. [2021-06-05 00:35:06,275 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 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-06-05 00:35:06,275 INFO L276 IsEmpty]: Start isEmpty. Operand 3753 states and 10059 transitions. [2021-06-05 00:35:06,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-06-05 00:35:06,277 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 00:35:06,277 INFO L521 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-06-05 00:35:06,278 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-06-05 00:35:06,278 INFO L430 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 00:35:06,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 00:35:06,278 INFO L82 PathProgramCache]: Analyzing trace with hash -1924610094, now seen corresponding path program 1 times [2021-06-05 00:35:06,278 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 00:35:06,279 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561277696] [2021-06-05 00:35:06,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 00:35:06,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 00:35:06,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 00:35:06,366 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 00:35:06,366 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561277696] [2021-06-05 00:35:06,367 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561277696] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 00:35:06,367 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 00:35:06,367 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 00:35:06,367 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426995010] [2021-06-05 00:35:06,367 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-05 00:35:06,367 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 00:35:06,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-05 00:35:06,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-06-05 00:35:06,368 INFO L87 Difference]: Start difference. First operand 3753 states and 10059 transitions. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 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-06-05 00:35:06,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 00:35:06,641 INFO L93 Difference]: Finished difference Result 5276 states and 14062 transitions. [2021-06-05 00:35:06,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 00:35:06,642 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 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-06-05 00:35:06,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 00:35:06,661 INFO L225 Difference]: With dead ends: 5276 [2021-06-05 00:35:06,662 INFO L226 Difference]: Without dead ends: 4475 [2021-06-05 00:35:06,662 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 76.2ms TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2021-06-05 00:35:06,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4475 states. [2021-06-05 00:35:06,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4475 to 4325. [2021-06-05 00:35:06,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4325 states, 4321 states have (on average 2.6931265910668825) internal successors, (11637), 4324 states have internal predecessors, (11637), 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-06-05 00:35:06,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4325 states to 4325 states and 11637 transitions. [2021-06-05 00:35:06,780 INFO L78 Accepts]: Start accepts. Automaton has 4325 states and 11637 transitions. Word has length 66 [2021-06-05 00:35:06,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 00:35:06,782 INFO L482 AbstractCegarLoop]: Abstraction has 4325 states and 11637 transitions. [2021-06-05 00:35:06,782 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 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-06-05 00:35:06,782 INFO L276 IsEmpty]: Start isEmpty. Operand 4325 states and 11637 transitions. [2021-06-05 00:35:06,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-06-05 00:35:06,791 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 00:35:06,791 INFO L521 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, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 00:35:06,792 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-06-05 00:35:06,792 INFO L430 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 00:35:06,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 00:35:06,793 INFO L82 PathProgramCache]: Analyzing trace with hash -1721881747, now seen corresponding path program 1 times [2021-06-05 00:35:06,793 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 00:35:06,793 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989067149] [2021-06-05 00:35:06,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 00:35:06,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 00:35:06,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-06-05 00:35:06,910 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 00:35:06,911 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989067149] [2021-06-05 00:35:06,911 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989067149] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 00:35:06,911 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 00:35:06,911 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-05 00:35:06,911 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298008182] [2021-06-05 00:35:06,912 INFO L462 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-05 00:35:06,912 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 00:35:06,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-05 00:35:06,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-06-05 00:35:06,913 INFO L87 Difference]: Start difference. First operand 4325 states and 11637 transitions. Second operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 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-06-05 00:35:06,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 00:35:06,953 INFO L93 Difference]: Finished difference Result 1631 states and 4196 transitions. [2021-06-05 00:35:06,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-05 00:35:06,954 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 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 78 [2021-06-05 00:35:06,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 00:35:06,970 INFO L225 Difference]: With dead ends: 1631 [2021-06-05 00:35:06,970 INFO L226 Difference]: Without dead ends: 1631 [2021-06-05 00:35:06,971 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 31.0ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-06-05 00:35:06,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1631 states. [2021-06-05 00:35:07,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1631 to 1631. [2021-06-05 00:35:07,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1631 states, 1629 states have (on average 2.575813382443217) internal successors, (4196), 1630 states have internal predecessors, (4196), 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-06-05 00:35:07,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1631 states to 1631 states and 4196 transitions. [2021-06-05 00:35:07,014 INFO L78 Accepts]: Start accepts. Automaton has 1631 states and 4196 transitions. Word has length 78 [2021-06-05 00:35:07,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 00:35:07,015 INFO L482 AbstractCegarLoop]: Abstraction has 1631 states and 4196 transitions. [2021-06-05 00:35:07,015 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 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-06-05 00:35:07,016 INFO L276 IsEmpty]: Start isEmpty. Operand 1631 states and 4196 transitions. [2021-06-05 00:35:07,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-06-05 00:35:07,020 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 00:35:07,020 INFO L521 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-05 00:35:07,020 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-06-05 00:35:07,020 INFO L430 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 00:35:07,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 00:35:07,021 INFO L82 PathProgramCache]: Analyzing trace with hash 648694468, now seen corresponding path program 1 times [2021-06-05 00:35:07,021 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 00:35:07,022 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383775588] [2021-06-05 00:35:07,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 00:35:07,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 00:35:08,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 00:35:08,091 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 00:35:08,092 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383775588] [2021-06-05 00:35:08,092 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383775588] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 00:35:08,092 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 00:35:08,092 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2021-06-05 00:35:08,092 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659092154] [2021-06-05 00:35:08,092 INFO L462 AbstractCegarLoop]: Interpolant automaton has 21 states [2021-06-05 00:35:08,093 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 00:35:08,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-06-05 00:35:08,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=357, Unknown=0, NotChecked=0, Total=420 [2021-06-05 00:35:08,093 INFO L87 Difference]: Start difference. First operand 1631 states and 4196 transitions. Second operand has 21 states, 21 states have (on average 5.0) internal successors, (105), 21 states have internal predecessors, (105), 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-06-05 00:35:10,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 00:35:10,605 INFO L93 Difference]: Finished difference Result 2436 states and 6209 transitions. [2021-06-05 00:35:10,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-06-05 00:35:10,606 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 5.0) internal successors, (105), 21 states have internal predecessors, (105), 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 105 [2021-06-05 00:35:10,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 00:35:10,611 INFO L225 Difference]: With dead ends: 2436 [2021-06-05 00:35:10,612 INFO L226 Difference]: Without dead ends: 2409 [2021-06-05 00:35:10,612 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 337 ImplicationChecksByTransitivity, 1988.8ms TimeCoverageRelationStatistics Valid=506, Invalid=1750, Unknown=0, NotChecked=0, Total=2256 [2021-06-05 00:35:10,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2409 states. [2021-06-05 00:35:10,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2409 to 2339. [2021-06-05 00:35:10,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2339 states, 2337 states have (on average 2.5934959349593494) internal successors, (6061), 2338 states have internal predecessors, (6061), 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-06-05 00:35:10,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2339 states to 2339 states and 6061 transitions. [2021-06-05 00:35:10,661 INFO L78 Accepts]: Start accepts. Automaton has 2339 states and 6061 transitions. Word has length 105 [2021-06-05 00:35:10,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 00:35:10,661 INFO L482 AbstractCegarLoop]: Abstraction has 2339 states and 6061 transitions. [2021-06-05 00:35:10,661 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 21 states, 21 states have (on average 5.0) internal successors, (105), 21 states have internal predecessors, (105), 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-06-05 00:35:10,662 INFO L276 IsEmpty]: Start isEmpty. Operand 2339 states and 6061 transitions. [2021-06-05 00:35:10,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-06-05 00:35:10,666 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 00:35:10,666 INFO L521 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-05 00:35:10,667 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-06-05 00:35:10,667 INFO L430 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 00:35:10,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 00:35:10,667 INFO L82 PathProgramCache]: Analyzing trace with hash -1718444628, now seen corresponding path program 2 times [2021-06-05 00:35:10,668 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 00:35:10,668 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386356180] [2021-06-05 00:35:10,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 00:35:10,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 00:35:11,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 00:35:11,226 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 00:35:11,226 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386356180] [2021-06-05 00:35:11,226 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386356180] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 00:35:11,226 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 00:35:11,226 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2021-06-05 00:35:11,226 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715462728] [2021-06-05 00:35:11,227 INFO L462 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-06-05 00:35:11,227 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 00:35:11,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-06-05 00:35:11,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2021-06-05 00:35:11,228 INFO L87 Difference]: Start difference. First operand 2339 states and 6061 transitions. Second operand has 17 states, 17 states have (on average 6.176470588235294) internal successors, (105), 17 states have internal predecessors, (105), 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-06-05 00:35:12,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 00:35:12,426 INFO L93 Difference]: Finished difference Result 2399 states and 6173 transitions. [2021-06-05 00:35:12,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-06-05 00:35:12,427 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 6.176470588235294) internal successors, (105), 17 states have internal predecessors, (105), 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 105 [2021-06-05 00:35:12,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 00:35:12,431 INFO L225 Difference]: With dead ends: 2399 [2021-06-05 00:35:12,432 INFO L226 Difference]: Without dead ends: 2399 [2021-06-05 00:35:12,432 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 221 ImplicationChecksByTransitivity, 991.1ms TimeCoverageRelationStatistics Valid=369, Invalid=1037, Unknown=0, NotChecked=0, Total=1406 [2021-06-05 00:35:12,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2399 states. [2021-06-05 00:35:12,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2399 to 2339. [2021-06-05 00:35:12,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2339 states, 2337 states have (on average 2.592640136927685) internal successors, (6059), 2338 states have internal predecessors, (6059), 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-06-05 00:35:12,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2339 states to 2339 states and 6059 transitions. [2021-06-05 00:35:12,477 INFO L78 Accepts]: Start accepts. Automaton has 2339 states and 6059 transitions. Word has length 105 [2021-06-05 00:35:12,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 00:35:12,477 INFO L482 AbstractCegarLoop]: Abstraction has 2339 states and 6059 transitions. [2021-06-05 00:35:12,477 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 6.176470588235294) internal successors, (105), 17 states have internal predecessors, (105), 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-06-05 00:35:12,477 INFO L276 IsEmpty]: Start isEmpty. Operand 2339 states and 6059 transitions. [2021-06-05 00:35:12,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-06-05 00:35:12,482 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 00:35:12,482 INFO L521 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-05 00:35:12,482 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-06-05 00:35:12,482 INFO L430 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 00:35:12,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 00:35:12,483 INFO L82 PathProgramCache]: Analyzing trace with hash 1294904632, now seen corresponding path program 1 times [2021-06-05 00:35:12,483 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 00:35:12,483 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31680260] [2021-06-05 00:35:12,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 00:35:12,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 00:35:13,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 00:35:13,071 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 00:35:13,071 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31680260] [2021-06-05 00:35:13,071 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31680260] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 00:35:13,071 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 00:35:13,071 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2021-06-05 00:35:13,071 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972094066] [2021-06-05 00:35:13,072 INFO L462 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-06-05 00:35:13,072 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 00:35:13,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-06-05 00:35:13,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=323, Unknown=0, NotChecked=0, Total=380 [2021-06-05 00:35:13,073 INFO L87 Difference]: Start difference. First operand 2339 states and 6059 transitions. Second operand has 20 states, 20 states have (on average 5.25) internal successors, (105), 20 states have internal predecessors, (105), 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-06-05 00:35:14,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 00:35:14,364 INFO L93 Difference]: Finished difference Result 2979 states and 7410 transitions. [2021-06-05 00:35:14,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-06-05 00:35:14,364 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 5.25) internal successors, (105), 20 states have internal predecessors, (105), 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 105 [2021-06-05 00:35:14,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 00:35:14,369 INFO L225 Difference]: With dead ends: 2979 [2021-06-05 00:35:14,369 INFO L226 Difference]: Without dead ends: 2979 [2021-06-05 00:35:14,370 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 989.9ms TimeCoverageRelationStatistics Valid=282, Invalid=840, Unknown=0, NotChecked=0, Total=1122 [2021-06-05 00:35:14,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2979 states. [2021-06-05 00:35:14,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2979 to 2719. [2021-06-05 00:35:14,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2719 states, 2717 states have (on average 2.5421420684578577) internal successors, (6907), 2718 states have internal predecessors, (6907), 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-06-05 00:35:14,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2719 states to 2719 states and 6907 transitions. [2021-06-05 00:35:14,421 INFO L78 Accepts]: Start accepts. Automaton has 2719 states and 6907 transitions. Word has length 105 [2021-06-05 00:35:14,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 00:35:14,421 INFO L482 AbstractCegarLoop]: Abstraction has 2719 states and 6907 transitions. [2021-06-05 00:35:14,421 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 20 states, 20 states have (on average 5.25) internal successors, (105), 20 states have internal predecessors, (105), 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-06-05 00:35:14,421 INFO L276 IsEmpty]: Start isEmpty. Operand 2719 states and 6907 transitions. [2021-06-05 00:35:14,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-06-05 00:35:14,426 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 00:35:14,426 INFO L521 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-05 00:35:14,427 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-06-05 00:35:14,427 INFO L430 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 00:35:14,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 00:35:14,427 INFO L82 PathProgramCache]: Analyzing trace with hash -564509166, now seen corresponding path program 3 times [2021-06-05 00:35:14,427 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 00:35:14,427 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140766913] [2021-06-05 00:35:14,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 00:35:14,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 00:35:15,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 00:35:15,019 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 00:35:15,019 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140766913] [2021-06-05 00:35:15,019 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140766913] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 00:35:15,019 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 00:35:15,019 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2021-06-05 00:35:15,019 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095087347] [2021-06-05 00:35:15,020 INFO L462 AbstractCegarLoop]: Interpolant automaton has 21 states [2021-06-05 00:35:15,020 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 00:35:15,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-06-05 00:35:15,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=326, Unknown=0, NotChecked=0, Total=420 [2021-06-05 00:35:15,021 INFO L87 Difference]: Start difference. First operand 2719 states and 6907 transitions. Second operand has 21 states, 21 states have (on average 5.0) internal successors, (105), 21 states have internal predecessors, (105), 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-06-05 00:35:17,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 00:35:17,545 INFO L93 Difference]: Finished difference Result 4261 states and 10631 transitions. [2021-06-05 00:35:17,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2021-06-05 00:35:17,545 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 5.0) internal successors, (105), 21 states have internal predecessors, (105), 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 105 [2021-06-05 00:35:17,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 00:35:17,552 INFO L225 Difference]: With dead ends: 4261 [2021-06-05 00:35:17,553 INFO L226 Difference]: Without dead ends: 4211 [2021-06-05 00:35:17,554 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 3 SyntacticMatches, 4 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 718 ImplicationChecksByTransitivity, 1974.4ms TimeCoverageRelationStatistics Valid=897, Invalid=2885, Unknown=0, NotChecked=0, Total=3782 [2021-06-05 00:35:17,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4211 states. [2021-06-05 00:35:17,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4211 to 3403. [2021-06-05 00:35:17,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3403 states, 3401 states have (on average 2.5960011761246693) internal successors, (8829), 3402 states have internal predecessors, (8829), 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-06-05 00:35:17,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3403 states to 3403 states and 8829 transitions. [2021-06-05 00:35:17,650 INFO L78 Accepts]: Start accepts. Automaton has 3403 states and 8829 transitions. Word has length 105 [2021-06-05 00:35:17,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 00:35:17,650 INFO L482 AbstractCegarLoop]: Abstraction has 3403 states and 8829 transitions. [2021-06-05 00:35:17,650 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 21 states, 21 states have (on average 5.0) internal successors, (105), 21 states have internal predecessors, (105), 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-06-05 00:35:17,650 INFO L276 IsEmpty]: Start isEmpty. Operand 3403 states and 8829 transitions. [2021-06-05 00:35:17,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-06-05 00:35:17,660 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 00:35:17,660 INFO L521 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-05 00:35:17,660 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-06-05 00:35:17,660 INFO L430 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 00:35:17,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 00:35:17,661 INFO L82 PathProgramCache]: Analyzing trace with hash 659717812, now seen corresponding path program 2 times [2021-06-05 00:35:17,661 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 00:35:17,661 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960455442] [2021-06-05 00:35:17,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 00:35:17,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 00:35:18,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 00:35:18,028 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 00:35:18,028 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960455442] [2021-06-05 00:35:18,028 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960455442] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 00:35:18,028 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 00:35:18,029 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-06-05 00:35:18,029 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020037699] [2021-06-05 00:35:18,029 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 00:35:18,029 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 00:35:18,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 00:35:18,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2021-06-05 00:35:18,030 INFO L87 Difference]: Start difference. First operand 3403 states and 8829 transitions. Second operand has 15 states, 15 states have (on average 7.0) internal successors, (105), 15 states have internal predecessors, (105), 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-06-05 00:35:18,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 00:35:18,681 INFO L93 Difference]: Finished difference Result 4878 states and 12398 transitions. [2021-06-05 00:35:18,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-06-05 00:35:18,682 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 7.0) internal successors, (105), 15 states have internal predecessors, (105), 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 105 [2021-06-05 00:35:18,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 00:35:18,690 INFO L225 Difference]: With dead ends: 4878 [2021-06-05 00:35:18,690 INFO L226 Difference]: Without dead ends: 4878 [2021-06-05 00:35:18,691 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 470.6ms TimeCoverageRelationStatistics Valid=213, Invalid=489, Unknown=0, NotChecked=0, Total=702 [2021-06-05 00:35:18,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4878 states. [2021-06-05 00:35:18,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4878 to 3569. [2021-06-05 00:35:18,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3569 states, 3567 states have (on average 2.5957387160078498) internal successors, (9259), 3568 states have internal predecessors, (9259), 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-06-05 00:35:18,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3569 states to 3569 states and 9259 transitions. [2021-06-05 00:35:18,761 INFO L78 Accepts]: Start accepts. Automaton has 3569 states and 9259 transitions. Word has length 105 [2021-06-05 00:35:18,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 00:35:18,761 INFO L482 AbstractCegarLoop]: Abstraction has 3569 states and 9259 transitions. [2021-06-05 00:35:18,761 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 7.0) internal successors, (105), 15 states have internal predecessors, (105), 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-06-05 00:35:18,762 INFO L276 IsEmpty]: Start isEmpty. Operand 3569 states and 9259 transitions. [2021-06-05 00:35:18,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-06-05 00:35:18,768 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 00:35:18,768 INFO L521 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-05 00:35:18,768 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-06-05 00:35:18,768 INFO L430 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 00:35:18,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 00:35:18,769 INFO L82 PathProgramCache]: Analyzing trace with hash 205708624, now seen corresponding path program 3 times [2021-06-05 00:35:18,769 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 00:35:18,769 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219714094] [2021-06-05 00:35:18,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 00:35:18,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 00:35:19,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 00:35:19,123 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 00:35:19,123 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219714094] [2021-06-05 00:35:19,124 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219714094] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 00:35:19,124 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 00:35:19,124 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-06-05 00:35:19,124 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469994024] [2021-06-05 00:35:19,124 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 00:35:19,124 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 00:35:19,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 00:35:19,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2021-06-05 00:35:19,125 INFO L87 Difference]: Start difference. First operand 3569 states and 9259 transitions. Second operand has 15 states, 15 states have (on average 7.0) internal successors, (105), 15 states have internal predecessors, (105), 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-06-05 00:35:19,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 00:35:19,901 INFO L93 Difference]: Finished difference Result 5217 states and 13022 transitions. [2021-06-05 00:35:19,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-06-05 00:35:19,901 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 7.0) internal successors, (105), 15 states have internal predecessors, (105), 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 105 [2021-06-05 00:35:19,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 00:35:19,909 INFO L225 Difference]: With dead ends: 5217 [2021-06-05 00:35:19,909 INFO L226 Difference]: Without dead ends: 5217 [2021-06-05 00:35:19,909 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 602.6ms TimeCoverageRelationStatistics Valid=232, Invalid=580, Unknown=0, NotChecked=0, Total=812 [2021-06-05 00:35:19,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5217 states. [2021-06-05 00:35:19,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5217 to 3593. [2021-06-05 00:35:19,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3593 states, 3591 states have (on average 2.596212754107491) internal successors, (9323), 3592 states have internal predecessors, (9323), 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-06-05 00:35:19,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3593 states to 3593 states and 9323 transitions. [2021-06-05 00:35:19,978 INFO L78 Accepts]: Start accepts. Automaton has 3593 states and 9323 transitions. Word has length 105 [2021-06-05 00:35:19,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 00:35:19,978 INFO L482 AbstractCegarLoop]: Abstraction has 3593 states and 9323 transitions. [2021-06-05 00:35:19,978 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 7.0) internal successors, (105), 15 states have internal predecessors, (105), 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-06-05 00:35:19,979 INFO L276 IsEmpty]: Start isEmpty. Operand 3593 states and 9323 transitions. [2021-06-05 00:35:19,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-06-05 00:35:19,985 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 00:35:19,985 INFO L521 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-05 00:35:19,985 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-06-05 00:35:19,986 INFO L430 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 00:35:19,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 00:35:19,986 INFO L82 PathProgramCache]: Analyzing trace with hash 549020954, now seen corresponding path program 4 times [2021-06-05 00:35:19,986 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 00:35:19,986 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707137871] [2021-06-05 00:35:19,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 00:35:20,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 00:35:20,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 00:35:20,520 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 00:35:20,520 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707137871] [2021-06-05 00:35:20,521 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707137871] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 00:35:20,521 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 00:35:20,521 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2021-06-05 00:35:20,521 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043339435] [2021-06-05 00:35:20,521 INFO L462 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-06-05 00:35:20,521 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 00:35:20,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-06-05 00:35:20,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=323, Unknown=0, NotChecked=0, Total=380 [2021-06-05 00:35:20,522 INFO L87 Difference]: Start difference. First operand 3593 states and 9323 transitions. Second operand has 20 states, 20 states have (on average 5.25) internal successors, (105), 20 states have internal predecessors, (105), 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-06-05 00:35:22,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 00:35:22,222 INFO L93 Difference]: Finished difference Result 4729 states and 11919 transitions. [2021-06-05 00:35:22,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-06-05 00:35:22,223 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 5.25) internal successors, (105), 20 states have internal predecessors, (105), 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 105 [2021-06-05 00:35:22,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 00:35:22,230 INFO L225 Difference]: With dead ends: 4729 [2021-06-05 00:35:22,230 INFO L226 Difference]: Without dead ends: 4729 [2021-06-05 00:35:22,231 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 237 ImplicationChecksByTransitivity, 1439.9ms TimeCoverageRelationStatistics Valid=417, Invalid=1143, Unknown=0, NotChecked=0, Total=1560 [2021-06-05 00:35:22,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4729 states. [2021-06-05 00:35:22,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4729 to 3653. [2021-06-05 00:35:22,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3653 states, 3651 states have (on average 2.5995617639003012) internal successors, (9491), 3652 states have internal predecessors, (9491), 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-06-05 00:35:22,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3653 states to 3653 states and 9491 transitions. [2021-06-05 00:35:22,302 INFO L78 Accepts]: Start accepts. Automaton has 3653 states and 9491 transitions. Word has length 105 [2021-06-05 00:35:22,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 00:35:22,302 INFO L482 AbstractCegarLoop]: Abstraction has 3653 states and 9491 transitions. [2021-06-05 00:35:22,302 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 20 states, 20 states have (on average 5.25) internal successors, (105), 20 states have internal predecessors, (105), 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-06-05 00:35:22,302 INFO L276 IsEmpty]: Start isEmpty. Operand 3653 states and 9491 transitions. [2021-06-05 00:35:22,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-06-05 00:35:22,312 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 00:35:22,312 INFO L521 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-05 00:35:22,312 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-06-05 00:35:22,312 INFO L430 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 00:35:22,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 00:35:22,313 INFO L82 PathProgramCache]: Analyzing trace with hash -845299678, now seen corresponding path program 5 times [2021-06-05 00:35:22,313 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 00:35:22,313 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589181535] [2021-06-05 00:35:22,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 00:35:22,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 00:35:22,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 00:35:22,779 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 00:35:22,779 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589181535] [2021-06-05 00:35:22,779 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589181535] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 00:35:22,779 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 00:35:22,780 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-06-05 00:35:22,780 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669182581] [2021-06-05 00:35:22,780 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 00:35:22,780 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 00:35:22,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 00:35:22,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2021-06-05 00:35:22,781 INFO L87 Difference]: Start difference. First operand 3653 states and 9491 transitions. Second operand has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 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-06-05 00:35:24,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 00:35:24,118 INFO L93 Difference]: Finished difference Result 4795 states and 12232 transitions. [2021-06-05 00:35:24,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-06-05 00:35:24,118 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 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 105 [2021-06-05 00:35:24,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 00:35:24,126 INFO L225 Difference]: With dead ends: 4795 [2021-06-05 00:35:24,126 INFO L226 Difference]: Without dead ends: 4795 [2021-06-05 00:35:24,127 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 1106.6ms TimeCoverageRelationStatistics Valid=279, Invalid=713, Unknown=0, NotChecked=0, Total=992 [2021-06-05 00:35:24,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4795 states. [2021-06-05 00:35:24,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4795 to 3848. [2021-06-05 00:35:24,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3848 states, 3846 states have (on average 2.6136245449817994) internal successors, (10052), 3847 states have internal predecessors, (10052), 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-06-05 00:35:24,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3848 states to 3848 states and 10052 transitions. [2021-06-05 00:35:24,198 INFO L78 Accepts]: Start accepts. Automaton has 3848 states and 10052 transitions. Word has length 105 [2021-06-05 00:35:24,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 00:35:24,199 INFO L482 AbstractCegarLoop]: Abstraction has 3848 states and 10052 transitions. [2021-06-05 00:35:24,199 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 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-06-05 00:35:24,199 INFO L276 IsEmpty]: Start isEmpty. Operand 3848 states and 10052 transitions. [2021-06-05 00:35:24,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-06-05 00:35:24,205 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 00:35:24,205 INFO L521 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-05 00:35:24,205 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-06-05 00:35:24,205 INFO L430 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 00:35:24,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 00:35:24,206 INFO L82 PathProgramCache]: Analyzing trace with hash -1381004282, now seen corresponding path program 6 times [2021-06-05 00:35:24,206 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 00:35:24,206 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463009664] [2021-06-05 00:35:24,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 00:35:24,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 00:35:24,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 00:35:24,641 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 00:35:24,641 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463009664] [2021-06-05 00:35:24,641 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463009664] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 00:35:24,641 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 00:35:24,642 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-06-05 00:35:24,642 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945420687] [2021-06-05 00:35:24,642 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 00:35:24,642 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 00:35:24,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 00:35:24,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2021-06-05 00:35:24,643 INFO L87 Difference]: Start difference. First operand 3848 states and 10052 transitions. Second operand has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 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-06-05 00:35:26,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 00:35:26,005 INFO L93 Difference]: Finished difference Result 4572 states and 11662 transitions. [2021-06-05 00:35:26,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-06-05 00:35:26,005 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 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 105 [2021-06-05 00:35:26,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 00:35:26,010 INFO L225 Difference]: With dead ends: 4572 [2021-06-05 00:35:26,010 INFO L226 Difference]: Without dead ends: 4572 [2021-06-05 00:35:26,010 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 1145.7ms TimeCoverageRelationStatistics Valid=286, Invalid=770, Unknown=0, NotChecked=0, Total=1056 [2021-06-05 00:35:26,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4572 states. [2021-06-05 00:35:26,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4572 to 3850. [2021-06-05 00:35:26,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3850 states, 3848 states have (on average 2.6135654885654884) internal successors, (10057), 3849 states have internal predecessors, (10057), 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-06-05 00:35:26,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3850 states to 3850 states and 10057 transitions. [2021-06-05 00:35:26,094 INFO L78 Accepts]: Start accepts. Automaton has 3850 states and 10057 transitions. Word has length 105 [2021-06-05 00:35:26,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 00:35:26,094 INFO L482 AbstractCegarLoop]: Abstraction has 3850 states and 10057 transitions. [2021-06-05 00:35:26,094 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 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-06-05 00:35:26,094 INFO L276 IsEmpty]: Start isEmpty. Operand 3850 states and 10057 transitions. [2021-06-05 00:35:26,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-06-05 00:35:26,102 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 00:35:26,102 INFO L521 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-05 00:35:26,102 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-06-05 00:35:26,102 INFO L430 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 00:35:26,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 00:35:26,102 INFO L82 PathProgramCache]: Analyzing trace with hash 1036005680, now seen corresponding path program 7 times [2021-06-05 00:35:26,103 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 00:35:26,103 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463786417] [2021-06-05 00:35:26,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 00:35:26,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 00:35:26,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 00:35:26,446 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 00:35:26,446 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463786417] [2021-06-05 00:35:26,446 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463786417] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 00:35:26,446 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 00:35:26,446 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-06-05 00:35:26,446 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797355495] [2021-06-05 00:35:26,447 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 00:35:26,447 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 00:35:26,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 00:35:26,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2021-06-05 00:35:26,447 INFO L87 Difference]: Start difference. First operand 3850 states and 10057 transitions. Second operand has 15 states, 15 states have (on average 7.0) internal successors, (105), 15 states have internal predecessors, (105), 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-06-05 00:35:27,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 00:35:27,125 INFO L93 Difference]: Finished difference Result 4263 states and 10873 transitions. [2021-06-05 00:35:27,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-06-05 00:35:27,125 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 7.0) internal successors, (105), 15 states have internal predecessors, (105), 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 105 [2021-06-05 00:35:27,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 00:35:27,129 INFO L225 Difference]: With dead ends: 4263 [2021-06-05 00:35:27,129 INFO L226 Difference]: Without dead ends: 4263 [2021-06-05 00:35:27,130 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 510.3ms TimeCoverageRelationStatistics Valid=210, Invalid=602, Unknown=0, NotChecked=0, Total=812 [2021-06-05 00:35:27,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4263 states. [2021-06-05 00:35:27,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4263 to 3846. [2021-06-05 00:35:27,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3846 states, 3844 states have (on average 2.6152445369406867) internal successors, (10053), 3845 states have internal predecessors, (10053), 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-06-05 00:35:27,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3846 states to 3846 states and 10053 transitions. [2021-06-05 00:35:27,197 INFO L78 Accepts]: Start accepts. Automaton has 3846 states and 10053 transitions. Word has length 105 [2021-06-05 00:35:27,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 00:35:27,197 INFO L482 AbstractCegarLoop]: Abstraction has 3846 states and 10053 transitions. [2021-06-05 00:35:27,197 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 7.0) internal successors, (105), 15 states have internal predecessors, (105), 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-06-05 00:35:27,197 INFO L276 IsEmpty]: Start isEmpty. Operand 3846 states and 10053 transitions. [2021-06-05 00:35:27,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-06-05 00:35:27,203 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 00:35:27,204 INFO L521 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-05 00:35:27,204 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-06-05 00:35:27,204 INFO L430 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 00:35:27,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 00:35:27,204 INFO L82 PathProgramCache]: Analyzing trace with hash 419287134, now seen corresponding path program 8 times [2021-06-05 00:35:27,204 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 00:35:27,205 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900228289] [2021-06-05 00:35:27,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 00:35:27,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 00:35:27,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 00:35:27,605 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 00:35:27,605 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900228289] [2021-06-05 00:35:27,607 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900228289] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 00:35:27,607 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 00:35:27,607 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-06-05 00:35:27,607 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112680829] [2021-06-05 00:35:27,607 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 00:35:27,607 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 00:35:27,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 00:35:27,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2021-06-05 00:35:27,608 INFO L87 Difference]: Start difference. First operand 3846 states and 10053 transitions. Second operand has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 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-06-05 00:35:28,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 00:35:28,772 INFO L93 Difference]: Finished difference Result 4504 states and 11381 transitions. [2021-06-05 00:35:28,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-06-05 00:35:28,772 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 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 105 [2021-06-05 00:35:28,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 00:35:28,776 INFO L225 Difference]: With dead ends: 4504 [2021-06-05 00:35:28,776 INFO L226 Difference]: Without dead ends: 4504 [2021-06-05 00:35:28,776 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 987.0ms TimeCoverageRelationStatistics Valid=284, Invalid=838, Unknown=0, NotChecked=0, Total=1122 [2021-06-05 00:35:28,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4504 states. [2021-06-05 00:35:28,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4504 to 3854. [2021-06-05 00:35:28,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3854 states, 3852 states have (on average 2.6150051921079958) internal successors, (10073), 3853 states have internal predecessors, (10073), 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-06-05 00:35:28,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3854 states to 3854 states and 10073 transitions. [2021-06-05 00:35:28,839 INFO L78 Accepts]: Start accepts. Automaton has 3854 states and 10073 transitions. Word has length 105 [2021-06-05 00:35:28,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 00:35:28,839 INFO L482 AbstractCegarLoop]: Abstraction has 3854 states and 10073 transitions. [2021-06-05 00:35:28,840 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 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-06-05 00:35:28,840 INFO L276 IsEmpty]: Start isEmpty. Operand 3854 states and 10073 transitions. [2021-06-05 00:35:28,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-06-05 00:35:28,846 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 00:35:28,847 INFO L521 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-05 00:35:28,847 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-06-05 00:35:28,847 INFO L430 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 00:35:28,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 00:35:28,847 INFO L82 PathProgramCache]: Analyzing trace with hash -1866032802, now seen corresponding path program 9 times [2021-06-05 00:35:28,847 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 00:35:28,847 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330950818] [2021-06-05 00:35:28,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 00:35:28,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 00:35:29,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 00:35:29,411 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 00:35:29,411 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330950818] [2021-06-05 00:35:29,411 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330950818] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 00:35:29,411 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 00:35:29,411 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2021-06-05 00:35:29,411 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265269357] [2021-06-05 00:35:29,411 INFO L462 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-06-05 00:35:29,411 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 00:35:29,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-06-05 00:35:29,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=329, Unknown=0, NotChecked=0, Total=380 [2021-06-05 00:35:29,412 INFO L87 Difference]: Start difference. First operand 3854 states and 10073 transitions. Second operand has 20 states, 20 states have (on average 5.25) internal successors, (105), 20 states have internal predecessors, (105), 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-06-05 00:35:30,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 00:35:30,953 INFO L93 Difference]: Finished difference Result 4806 states and 12131 transitions. [2021-06-05 00:35:30,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-06-05 00:35:30,953 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 5.25) internal successors, (105), 20 states have internal predecessors, (105), 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 105 [2021-06-05 00:35:30,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 00:35:30,957 INFO L225 Difference]: With dead ends: 4806 [2021-06-05 00:35:30,957 INFO L226 Difference]: Without dead ends: 4806 [2021-06-05 00:35:30,958 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 1411.7ms TimeCoverageRelationStatistics Valid=326, Invalid=1006, Unknown=0, NotChecked=0, Total=1332 [2021-06-05 00:35:30,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4806 states. [2021-06-05 00:35:31,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4806 to 3862. [2021-06-05 00:35:31,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3862 states, 3860 states have (on average 2.6147668393782384) internal successors, (10093), 3861 states have internal predecessors, (10093), 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-06-05 00:35:31,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3862 states to 3862 states and 10093 transitions. [2021-06-05 00:35:31,021 INFO L78 Accepts]: Start accepts. Automaton has 3862 states and 10093 transitions. Word has length 105 [2021-06-05 00:35:31,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 00:35:31,021 INFO L482 AbstractCegarLoop]: Abstraction has 3862 states and 10093 transitions. [2021-06-05 00:35:31,021 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 20 states, 20 states have (on average 5.25) internal successors, (105), 20 states have internal predecessors, (105), 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-06-05 00:35:31,021 INFO L276 IsEmpty]: Start isEmpty. Operand 3862 states and 10093 transitions. [2021-06-05 00:35:31,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-06-05 00:35:31,027 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 00:35:31,027 INFO L521 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-05 00:35:31,028 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-06-05 00:35:31,028 INFO L430 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 00:35:31,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 00:35:31,028 INFO L82 PathProgramCache]: Analyzing trace with hash 179931456, now seen corresponding path program 10 times [2021-06-05 00:35:31,028 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 00:35:31,028 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061856780] [2021-06-05 00:35:31,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 00:35:31,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 00:35:31,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 00:35:31,377 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 00:35:31,377 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061856780] [2021-06-05 00:35:31,377 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061856780] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 00:35:31,377 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 00:35:31,377 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-06-05 00:35:31,377 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898779499] [2021-06-05 00:35:31,377 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 00:35:31,378 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 00:35:31,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 00:35:31,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2021-06-05 00:35:31,378 INFO L87 Difference]: Start difference. First operand 3862 states and 10093 transitions. Second operand has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 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-06-05 00:35:33,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 00:35:33,169 INFO L93 Difference]: Finished difference Result 5652 states and 13985 transitions. [2021-06-05 00:35:33,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-06-05 00:35:33,169 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 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 105 [2021-06-05 00:35:33,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 00:35:33,173 INFO L225 Difference]: With dead ends: 5652 [2021-06-05 00:35:33,173 INFO L226 Difference]: Without dead ends: 5652 [2021-06-05 00:35:33,174 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 278 ImplicationChecksByTransitivity, 1539.4ms TimeCoverageRelationStatistics Valid=459, Invalid=1263, Unknown=0, NotChecked=0, Total=1722 [2021-06-05 00:35:33,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5652 states. [2021-06-05 00:35:33,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5652 to 3830. [2021-06-05 00:35:33,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3830 states, 3828 states have (on average 2.612591431556949) internal successors, (10001), 3829 states have internal predecessors, (10001), 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-06-05 00:35:33,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3830 states to 3830 states and 10001 transitions. [2021-06-05 00:35:33,247 INFO L78 Accepts]: Start accepts. Automaton has 3830 states and 10001 transitions. Word has length 105 [2021-06-05 00:35:33,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 00:35:33,247 INFO L482 AbstractCegarLoop]: Abstraction has 3830 states and 10001 transitions. [2021-06-05 00:35:33,248 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 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-06-05 00:35:33,248 INFO L276 IsEmpty]: Start isEmpty. Operand 3830 states and 10001 transitions. [2021-06-05 00:35:33,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-06-05 00:35:33,255 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 00:35:33,255 INFO L521 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-05 00:35:33,255 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-06-05 00:35:33,255 INFO L430 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 00:35:33,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 00:35:33,255 INFO L82 PathProgramCache]: Analyzing trace with hash -2114633644, now seen corresponding path program 11 times [2021-06-05 00:35:33,255 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 00:35:33,256 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842580040] [2021-06-05 00:35:33,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 00:35:33,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 00:35:33,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 00:35:33,613 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 00:35:33,613 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842580040] [2021-06-05 00:35:33,614 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842580040] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 00:35:33,614 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 00:35:33,614 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-06-05 00:35:33,614 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734050473] [2021-06-05 00:35:33,614 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 00:35:33,614 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 00:35:33,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 00:35:33,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2021-06-05 00:35:33,615 INFO L87 Difference]: Start difference. First operand 3830 states and 10001 transitions. Second operand has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 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-06-05 00:35:34,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 00:35:34,593 INFO L93 Difference]: Finished difference Result 4897 states and 12195 transitions. [2021-06-05 00:35:34,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-06-05 00:35:34,593 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 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 105 [2021-06-05 00:35:34,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 00:35:34,597 INFO L225 Difference]: With dead ends: 4897 [2021-06-05 00:35:34,597 INFO L226 Difference]: Without dead ends: 4897 [2021-06-05 00:35:34,597 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 783.8ms TimeCoverageRelationStatistics Valid=272, Invalid=850, Unknown=0, NotChecked=0, Total=1122 [2021-06-05 00:35:34,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4897 states. [2021-06-05 00:35:34,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4897 to 3836. [2021-06-05 00:35:34,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3836 states, 3834 states have (on average 2.612415232133542) internal successors, (10016), 3835 states have internal predecessors, (10016), 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-06-05 00:35:34,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3836 states to 3836 states and 10016 transitions. [2021-06-05 00:35:34,661 INFO L78 Accepts]: Start accepts. Automaton has 3836 states and 10016 transitions. Word has length 105 [2021-06-05 00:35:34,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 00:35:34,661 INFO L482 AbstractCegarLoop]: Abstraction has 3836 states and 10016 transitions. [2021-06-05 00:35:34,661 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 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-06-05 00:35:34,661 INFO L276 IsEmpty]: Start isEmpty. Operand 3836 states and 10016 transitions. [2021-06-05 00:35:34,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-06-05 00:35:34,667 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 00:35:34,668 INFO L521 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-05 00:35:34,668 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-06-05 00:35:34,668 INFO L430 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 00:35:34,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 00:35:34,668 INFO L82 PathProgramCache]: Analyzing trace with hash -1809281472, now seen corresponding path program 12 times [2021-06-05 00:35:34,668 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 00:35:34,668 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386707532] [2021-06-05 00:35:34,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 00:35:34,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 00:35:35,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 00:35:35,141 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 00:35:35,141 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386707532] [2021-06-05 00:35:35,141 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386707532] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 00:35:35,141 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 00:35:35,141 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2021-06-05 00:35:35,142 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752547465] [2021-06-05 00:35:35,142 INFO L462 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-06-05 00:35:35,142 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 00:35:35,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-06-05 00:35:35,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=327, Unknown=0, NotChecked=0, Total=380 [2021-06-05 00:35:35,143 INFO L87 Difference]: Start difference. First operand 3836 states and 10016 transitions. Second operand has 20 states, 20 states have (on average 5.25) internal successors, (105), 20 states have internal predecessors, (105), 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-06-05 00:35:36,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 00:35:36,157 INFO L93 Difference]: Finished difference Result 4697 states and 11755 transitions. [2021-06-05 00:35:36,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-06-05 00:35:36,158 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 5.25) internal successors, (105), 20 states have internal predecessors, (105), 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 105 [2021-06-05 00:35:36,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 00:35:36,162 INFO L225 Difference]: With dead ends: 4697 [2021-06-05 00:35:36,162 INFO L226 Difference]: Without dead ends: 4697 [2021-06-05 00:35:36,162 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 887.9ms TimeCoverageRelationStatistics Valid=289, Invalid=971, Unknown=0, NotChecked=0, Total=1260 [2021-06-05 00:35:36,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4697 states. [2021-06-05 00:35:36,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4697 to 3855. [2021-06-05 00:35:36,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3855 states, 3853 states have (on average 2.6106929665195953) internal successors, (10059), 3854 states have internal predecessors, (10059), 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-06-05 00:35:36,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3855 states to 3855 states and 10059 transitions. [2021-06-05 00:35:36,218 INFO L78 Accepts]: Start accepts. Automaton has 3855 states and 10059 transitions. Word has length 105 [2021-06-05 00:35:36,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 00:35:36,218 INFO L482 AbstractCegarLoop]: Abstraction has 3855 states and 10059 transitions. [2021-06-05 00:35:36,219 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 20 states, 20 states have (on average 5.25) internal successors, (105), 20 states have internal predecessors, (105), 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-06-05 00:35:36,219 INFO L276 IsEmpty]: Start isEmpty. Operand 3855 states and 10059 transitions. [2021-06-05 00:35:36,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-06-05 00:35:36,225 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 00:35:36,225 INFO L521 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-05 00:35:36,225 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-06-05 00:35:36,225 INFO L430 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 00:35:36,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 00:35:36,226 INFO L82 PathProgramCache]: Analyzing trace with hash 2136499800, now seen corresponding path program 13 times [2021-06-05 00:35:36,226 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 00:35:36,226 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617079689] [2021-06-05 00:35:36,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 00:35:36,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 00:35:36,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 00:35:36,539 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 00:35:36,539 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617079689] [2021-06-05 00:35:36,539 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617079689] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 00:35:36,539 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 00:35:36,539 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-06-05 00:35:36,539 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904102733] [2021-06-05 00:35:36,539 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 00:35:36,539 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 00:35:36,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 00:35:36,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2021-06-05 00:35:36,540 INFO L87 Difference]: Start difference. First operand 3855 states and 10059 transitions. Second operand has 15 states, 15 states have (on average 7.0) internal successors, (105), 15 states have internal predecessors, (105), 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-06-05 00:35:37,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 00:35:37,145 INFO L93 Difference]: Finished difference Result 4967 states and 12337 transitions. [2021-06-05 00:35:37,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-06-05 00:35:37,146 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 7.0) internal successors, (105), 15 states have internal predecessors, (105), 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 105 [2021-06-05 00:35:37,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 00:35:37,150 INFO L225 Difference]: With dead ends: 4967 [2021-06-05 00:35:37,150 INFO L226 Difference]: Without dead ends: 4967 [2021-06-05 00:35:37,151 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 516.3ms TimeCoverageRelationStatistics Valid=221, Invalid=591, Unknown=0, NotChecked=0, Total=812 [2021-06-05 00:35:37,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4967 states. [2021-06-05 00:35:37,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4967 to 3911. [2021-06-05 00:35:37,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3911 states, 3909 states have (on average 2.609363008442057) internal successors, (10200), 3910 states have internal predecessors, (10200), 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-06-05 00:35:37,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3911 states to 3911 states and 10200 transitions. [2021-06-05 00:35:37,202 INFO L78 Accepts]: Start accepts. Automaton has 3911 states and 10200 transitions. Word has length 105 [2021-06-05 00:35:37,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 00:35:37,202 INFO L482 AbstractCegarLoop]: Abstraction has 3911 states and 10200 transitions. [2021-06-05 00:35:37,202 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 7.0) internal successors, (105), 15 states have internal predecessors, (105), 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-06-05 00:35:37,203 INFO L276 IsEmpty]: Start isEmpty. Operand 3911 states and 10200 transitions. [2021-06-05 00:35:37,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-06-05 00:35:37,209 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 00:35:37,209 INFO L521 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-05 00:35:37,209 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-06-05 00:35:37,210 INFO L430 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 00:35:37,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 00:35:37,210 INFO L82 PathProgramCache]: Analyzing trace with hash 1608280384, now seen corresponding path program 14 times [2021-06-05 00:35:37,210 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 00:35:37,210 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174083293] [2021-06-05 00:35:37,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 00:35:37,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 00:35:37,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 00:35:37,582 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 00:35:37,582 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174083293] [2021-06-05 00:35:37,582 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174083293] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 00:35:37,583 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 00:35:37,583 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-06-05 00:35:37,583 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997910677] [2021-06-05 00:35:37,583 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 00:35:37,583 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 00:35:37,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 00:35:37,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2021-06-05 00:35:37,584 INFO L87 Difference]: Start difference. First operand 3911 states and 10200 transitions. Second operand has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 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-06-05 00:35:38,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 00:35:38,774 INFO L93 Difference]: Finished difference Result 4759 states and 11904 transitions. [2021-06-05 00:35:38,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-06-05 00:35:38,774 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 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 105 [2021-06-05 00:35:38,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 00:35:38,778 INFO L225 Difference]: With dead ends: 4759 [2021-06-05 00:35:38,778 INFO L226 Difference]: Without dead ends: 4759 [2021-06-05 00:35:38,780 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 1035.6ms TimeCoverageRelationStatistics Valid=273, Invalid=849, Unknown=0, NotChecked=0, Total=1122 [2021-06-05 00:35:38,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4759 states. [2021-06-05 00:35:38,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4759 to 3911. [2021-06-05 00:35:38,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3911 states, 3909 states have (on average 2.609363008442057) internal successors, (10200), 3910 states have internal predecessors, (10200), 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-06-05 00:35:38,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3911 states to 3911 states and 10200 transitions. [2021-06-05 00:35:38,840 INFO L78 Accepts]: Start accepts. Automaton has 3911 states and 10200 transitions. Word has length 105 [2021-06-05 00:35:38,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 00:35:38,840 INFO L482 AbstractCegarLoop]: Abstraction has 3911 states and 10200 transitions. [2021-06-05 00:35:38,840 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 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-06-05 00:35:38,840 INFO L276 IsEmpty]: Start isEmpty. Operand 3911 states and 10200 transitions. [2021-06-05 00:35:38,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-06-05 00:35:38,848 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 00:35:38,848 INFO L521 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-05 00:35:38,848 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-06-05 00:35:38,848 INFO L430 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 00:35:38,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 00:35:38,848 INFO L82 PathProgramCache]: Analyzing trace with hash 1667670798, now seen corresponding path program 15 times [2021-06-05 00:35:38,848 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 00:35:38,848 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422235217] [2021-06-05 00:35:38,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 00:35:38,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 00:35:39,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 00:35:39,229 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 00:35:39,229 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422235217] [2021-06-05 00:35:39,229 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422235217] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 00:35:39,229 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 00:35:39,230 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-06-05 00:35:39,230 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088118862] [2021-06-05 00:35:39,230 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 00:35:39,230 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 00:35:39,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 00:35:39,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2021-06-05 00:35:39,231 INFO L87 Difference]: Start difference. First operand 3911 states and 10200 transitions. Second operand has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 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-06-05 00:35:40,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 00:35:40,431 INFO L93 Difference]: Finished difference Result 4830 states and 12033 transitions. [2021-06-05 00:35:40,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-06-05 00:35:40,431 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 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 105 [2021-06-05 00:35:40,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 00:35:40,436 INFO L225 Difference]: With dead ends: 4830 [2021-06-05 00:35:40,436 INFO L226 Difference]: Without dead ends: 4830 [2021-06-05 00:35:40,437 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 1019.0ms TimeCoverageRelationStatistics Valid=298, Invalid=892, Unknown=0, NotChecked=0, Total=1190 [2021-06-05 00:35:40,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4830 states. [2021-06-05 00:35:40,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4830 to 3909. [2021-06-05 00:35:40,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3909 states, 3907 states have (on average 2.6094189915536217) internal successors, (10195), 3908 states have internal predecessors, (10195), 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-06-05 00:35:40,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3909 states to 3909 states and 10195 transitions. [2021-06-05 00:35:40,494 INFO L78 Accepts]: Start accepts. Automaton has 3909 states and 10195 transitions. Word has length 105 [2021-06-05 00:35:40,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 00:35:40,495 INFO L482 AbstractCegarLoop]: Abstraction has 3909 states and 10195 transitions. [2021-06-05 00:35:40,495 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 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-06-05 00:35:40,495 INFO L276 IsEmpty]: Start isEmpty. Operand 3909 states and 10195 transitions. [2021-06-05 00:35:40,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-06-05 00:35:40,498 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 00:35:40,498 INFO L521 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-05 00:35:40,499 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-06-05 00:35:40,499 INFO L430 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 00:35:40,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 00:35:40,499 INFO L82 PathProgramCache]: Analyzing trace with hash 1842427648, now seen corresponding path program 16 times [2021-06-05 00:35:40,499 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 00:35:40,499 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026295600] [2021-06-05 00:35:40,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 00:35:40,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 00:35:40,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 00:35:40,760 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 00:35:40,760 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026295600] [2021-06-05 00:35:40,760 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026295600] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 00:35:40,760 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 00:35:40,760 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-06-05 00:35:40,760 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91349106] [2021-06-05 00:35:40,760 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 00:35:40,760 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 00:35:40,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 00:35:40,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2021-06-05 00:35:40,761 INFO L87 Difference]: Start difference. First operand 3909 states and 10195 transitions. Second operand has 15 states, 15 states have (on average 7.0) internal successors, (105), 15 states have internal predecessors, (105), 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-06-05 00:35:41,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 00:35:41,525 INFO L93 Difference]: Finished difference Result 5081 states and 12655 transitions. [2021-06-05 00:35:41,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-06-05 00:35:41,525 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 7.0) internal successors, (105), 15 states have internal predecessors, (105), 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 105 [2021-06-05 00:35:41,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 00:35:41,530 INFO L225 Difference]: With dead ends: 5081 [2021-06-05 00:35:41,530 INFO L226 Difference]: Without dead ends: 5081 [2021-06-05 00:35:41,530 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 547.0ms TimeCoverageRelationStatistics Valid=232, Invalid=580, Unknown=0, NotChecked=0, Total=812 [2021-06-05 00:35:41,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5081 states. [2021-06-05 00:35:41,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5081 to 3873. [2021-06-05 00:35:41,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3873 states, 3871 states have (on average 2.608886592611728) internal successors, (10099), 3872 states have internal predecessors, (10099), 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-06-05 00:35:41,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3873 states to 3873 states and 10099 transitions. [2021-06-05 00:35:41,578 INFO L78 Accepts]: Start accepts. Automaton has 3873 states and 10099 transitions. Word has length 105 [2021-06-05 00:35:41,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 00:35:41,579 INFO L482 AbstractCegarLoop]: Abstraction has 3873 states and 10099 transitions. [2021-06-05 00:35:41,579 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 7.0) internal successors, (105), 15 states have internal predecessors, (105), 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-06-05 00:35:41,579 INFO L276 IsEmpty]: Start isEmpty. Operand 3873 states and 10099 transitions. [2021-06-05 00:35:41,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-06-05 00:35:41,583 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 00:35:41,583 INFO L521 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-05 00:35:41,583 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-06-05 00:35:41,584 INFO L430 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 00:35:41,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 00:35:41,584 INFO L82 PathProgramCache]: Analyzing trace with hash 2017781410, now seen corresponding path program 17 times [2021-06-05 00:35:41,584 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 00:35:41,584 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494874177] [2021-06-05 00:35:41,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 00:35:41,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 00:35:41,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-06-05 00:35:41,926 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 00:35:41,926 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494874177] [2021-06-05 00:35:41,926 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494874177] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 00:35:41,926 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 00:35:41,926 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-06-05 00:35:41,926 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363066612] [2021-06-05 00:35:41,926 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 00:35:41,926 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 00:35:41,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 00:35:41,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2021-06-05 00:35:41,927 INFO L87 Difference]: Start difference. First operand 3873 states and 10099 transitions. Second operand has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 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-06-05 00:35:43,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 00:35:43,320 INFO L93 Difference]: Finished difference Result 5410 states and 13710 transitions. [2021-06-05 00:35:43,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-06-05 00:35:43,320 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 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 105 [2021-06-05 00:35:43,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 00:35:43,324 INFO L225 Difference]: With dead ends: 5410 [2021-06-05 00:35:43,324 INFO L226 Difference]: Without dead ends: 5410 [2021-06-05 00:35:43,325 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 1105.2ms TimeCoverageRelationStatistics Valid=295, Invalid=827, Unknown=0, NotChecked=0, Total=1122 [2021-06-05 00:35:43,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5410 states. [2021-06-05 00:35:43,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5410 to 3921. [2021-06-05 00:35:43,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3921 states, 3919 states have (on average 2.613676958407757) internal successors, (10243), 3920 states have internal predecessors, (10243), 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-06-05 00:35:43,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3921 states to 3921 states and 10243 transitions. [2021-06-05 00:35:43,377 INFO L78 Accepts]: Start accepts. Automaton has 3921 states and 10243 transitions. Word has length 105 [2021-06-05 00:35:43,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 00:35:43,377 INFO L482 AbstractCegarLoop]: Abstraction has 3921 states and 10243 transitions. [2021-06-05 00:35:43,377 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 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-06-05 00:35:43,377 INFO L276 IsEmpty]: Start isEmpty. Operand 3921 states and 10243 transitions. [2021-06-05 00:35:43,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-06-05 00:35:43,381 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 00:35:43,381 INFO L521 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-05 00:35:43,381 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-06-05 00:35:43,381 INFO L430 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 00:35:43,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 00:35:43,381 INFO L82 PathProgramCache]: Analyzing trace with hash -1220456674, now seen corresponding path program 18 times [2021-06-05 00:35:43,381 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 00:35:43,381 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107456689] [2021-06-05 00:35:43,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 00:35:43,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 00:35:43,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 00:35:43,743 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 00:35:43,743 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107456689] [2021-06-05 00:35:43,743 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107456689] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 00:35:43,743 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 00:35:43,743 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-06-05 00:35:43,743 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296438487] [2021-06-05 00:35:43,743 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 00:35:43,744 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 00:35:43,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 00:35:43,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2021-06-05 00:35:43,744 INFO L87 Difference]: Start difference. First operand 3921 states and 10243 transitions. Second operand has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 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-06-05 00:35:45,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 00:35:45,011 INFO L93 Difference]: Finished difference Result 6126 states and 15571 transitions. [2021-06-05 00:35:45,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-06-05 00:35:45,011 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 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 105 [2021-06-05 00:35:45,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 00:35:45,015 INFO L225 Difference]: With dead ends: 6126 [2021-06-05 00:35:45,015 INFO L226 Difference]: Without dead ends: 6126 [2021-06-05 00:35:45,015 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 1055.0ms TimeCoverageRelationStatistics Valid=286, Invalid=770, Unknown=0, NotChecked=0, Total=1056 [2021-06-05 00:35:45,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6126 states. [2021-06-05 00:35:45,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6126 to 3921. [2021-06-05 00:35:45,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3921 states, 3919 states have (on average 2.613676958407757) internal successors, (10243), 3920 states have internal predecessors, (10243), 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-06-05 00:35:45,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3921 states to 3921 states and 10243 transitions. [2021-06-05 00:35:45,063 INFO L78 Accepts]: Start accepts. Automaton has 3921 states and 10243 transitions. Word has length 105 [2021-06-05 00:35:45,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 00:35:45,063 INFO L482 AbstractCegarLoop]: Abstraction has 3921 states and 10243 transitions. [2021-06-05 00:35:45,063 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 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-06-05 00:35:45,063 INFO L276 IsEmpty]: Start isEmpty. Operand 3921 states and 10243 transitions. [2021-06-05 00:35:45,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-06-05 00:35:45,066 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 00:35:45,066 INFO L521 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-05 00:35:45,066 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-06-05 00:35:45,066 INFO L430 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 00:35:45,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 00:35:45,067 INFO L82 PathProgramCache]: Analyzing trace with hash 435996362, now seen corresponding path program 19 times [2021-06-05 00:35:45,067 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 00:35:45,067 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112636724] [2021-06-05 00:35:45,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 00:35:45,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 00:35:45,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 00:35:45,470 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 00:35:45,470 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112636724] [2021-06-05 00:35:45,470 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112636724] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 00:35:45,471 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 00:35:45,471 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-06-05 00:35:45,471 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972453292] [2021-06-05 00:35:45,471 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 00:35:45,471 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 00:35:45,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 00:35:45,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2021-06-05 00:35:45,472 INFO L87 Difference]: Start difference. First operand 3921 states and 10243 transitions. Second operand has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 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-06-05 00:35:46,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 00:35:46,727 INFO L93 Difference]: Finished difference Result 5608 states and 14108 transitions. [2021-06-05 00:35:46,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-06-05 00:35:46,727 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 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 105 [2021-06-05 00:35:46,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 00:35:46,732 INFO L225 Difference]: With dead ends: 5608 [2021-06-05 00:35:46,732 INFO L226 Difference]: Without dead ends: 5608 [2021-06-05 00:35:46,733 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 1037.5ms TimeCoverageRelationStatistics Valid=284, Invalid=838, Unknown=0, NotChecked=0, Total=1122 [2021-06-05 00:35:46,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5608 states. [2021-06-05 00:35:46,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5608 to 3923. [2021-06-05 00:35:46,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3923 states, 3921 states have (on average 2.613618974751339) internal successors, (10248), 3922 states have internal predecessors, (10248), 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-06-05 00:35:46,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3923 states to 3923 states and 10248 transitions. [2021-06-05 00:35:46,795 INFO L78 Accepts]: Start accepts. Automaton has 3923 states and 10248 transitions. Word has length 105 [2021-06-05 00:35:46,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 00:35:46,795 INFO L482 AbstractCegarLoop]: Abstraction has 3923 states and 10248 transitions. [2021-06-05 00:35:46,795 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 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-06-05 00:35:46,796 INFO L276 IsEmpty]: Start isEmpty. Operand 3923 states and 10248 transitions. [2021-06-05 00:35:46,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-06-05 00:35:46,799 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 00:35:46,799 INFO L521 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-05 00:35:46,799 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-06-05 00:35:46,799 INFO L430 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 00:35:46,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 00:35:46,799 INFO L82 PathProgramCache]: Analyzing trace with hash 1883605662, now seen corresponding path program 20 times [2021-06-05 00:35:46,800 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 00:35:46,800 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339117610] [2021-06-05 00:35:46,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 00:35:46,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 00:35:47,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 00:35:47,153 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 00:35:47,153 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339117610] [2021-06-05 00:35:47,153 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339117610] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 00:35:47,153 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 00:35:47,153 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-06-05 00:35:47,154 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783945425] [2021-06-05 00:35:47,154 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 00:35:47,154 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 00:35:47,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 00:35:47,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2021-06-05 00:35:47,154 INFO L87 Difference]: Start difference. First operand 3923 states and 10248 transitions. Second operand has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 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-06-05 00:35:48,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 00:35:48,387 INFO L93 Difference]: Finished difference Result 5579 states and 14042 transitions. [2021-06-05 00:35:48,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-06-05 00:35:48,387 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 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 105 [2021-06-05 00:35:48,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 00:35:48,392 INFO L225 Difference]: With dead ends: 5579 [2021-06-05 00:35:48,392 INFO L226 Difference]: Without dead ends: 5579 [2021-06-05 00:35:48,392 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 1042.2ms TimeCoverageRelationStatistics Valid=309, Invalid=881, Unknown=0, NotChecked=0, Total=1190 [2021-06-05 00:35:48,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5579 states. [2021-06-05 00:35:48,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5579 to 3921. [2021-06-05 00:35:48,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3921 states, 3919 states have (on average 2.613676958407757) internal successors, (10243), 3920 states have internal predecessors, (10243), 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-06-05 00:35:48,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3921 states to 3921 states and 10243 transitions. [2021-06-05 00:35:48,436 INFO L78 Accepts]: Start accepts. Automaton has 3921 states and 10243 transitions. Word has length 105 [2021-06-05 00:35:48,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 00:35:48,436 INFO L482 AbstractCegarLoop]: Abstraction has 3921 states and 10243 transitions. [2021-06-05 00:35:48,436 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 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-06-05 00:35:48,436 INFO L276 IsEmpty]: Start isEmpty. Operand 3921 states and 10243 transitions. [2021-06-05 00:35:48,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-06-05 00:35:48,439 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 00:35:48,439 INFO L521 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-05 00:35:48,439 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-06-05 00:35:48,439 INFO L430 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 00:35:48,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 00:35:48,439 INFO L82 PathProgramCache]: Analyzing trace with hash 705758666, now seen corresponding path program 21 times [2021-06-05 00:35:48,439 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 00:35:48,439 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070812935] [2021-06-05 00:35:48,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 00:35:48,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 00:35:48,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 00:35:48,788 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 00:35:48,788 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070812935] [2021-06-05 00:35:48,788 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070812935] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 00:35:48,788 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 00:35:48,788 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-06-05 00:35:48,788 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534468803] [2021-06-05 00:35:48,789 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 00:35:48,789 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 00:35:48,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 00:35:48,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2021-06-05 00:35:48,789 INFO L87 Difference]: Start difference. First operand 3921 states and 10243 transitions. Second operand has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 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-06-05 00:35:50,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 00:35:50,576 INFO L93 Difference]: Finished difference Result 6811 states and 17055 transitions. [2021-06-05 00:35:50,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-06-05 00:35:50,576 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 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 105 [2021-06-05 00:35:50,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 00:35:50,582 INFO L225 Difference]: With dead ends: 6811 [2021-06-05 00:35:50,582 INFO L226 Difference]: Without dead ends: 6811 [2021-06-05 00:35:50,583 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 1504.9ms TimeCoverageRelationStatistics Valid=434, Invalid=1126, Unknown=0, NotChecked=0, Total=1560 [2021-06-05 00:35:50,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6811 states. [2021-06-05 00:35:50,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6811 to 3933. [2021-06-05 00:35:50,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3933 states, 3931 states have (on average 2.614856270669041) internal successors, (10279), 3932 states have internal predecessors, (10279), 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-06-05 00:35:50,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3933 states to 3933 states and 10279 transitions. [2021-06-05 00:35:50,654 INFO L78 Accepts]: Start accepts. Automaton has 3933 states and 10279 transitions. Word has length 105 [2021-06-05 00:35:50,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 00:35:50,654 INFO L482 AbstractCegarLoop]: Abstraction has 3933 states and 10279 transitions. [2021-06-05 00:35:50,654 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 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-06-05 00:35:50,655 INFO L276 IsEmpty]: Start isEmpty. Operand 3933 states and 10279 transitions. [2021-06-05 00:35:50,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-06-05 00:35:50,657 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 00:35:50,658 INFO L521 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-05 00:35:50,658 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-06-05 00:35:50,658 INFO L430 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 00:35:50,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 00:35:50,658 INFO L82 PathProgramCache]: Analyzing trace with hash 793280674, now seen corresponding path program 22 times [2021-06-05 00:35:50,658 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 00:35:50,658 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816353593] [2021-06-05 00:35:50,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 00:35:50,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 00:35:51,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 00:35:51,013 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 00:35:51,014 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816353593] [2021-06-05 00:35:51,014 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1816353593] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 00:35:51,014 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 00:35:51,014 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-06-05 00:35:51,014 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497607461] [2021-06-05 00:35:51,014 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 00:35:51,014 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 00:35:51,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 00:35:51,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2021-06-05 00:35:51,015 INFO L87 Difference]: Start difference. First operand 3933 states and 10279 transitions. Second operand has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 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-06-05 00:35:52,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 00:35:52,350 INFO L93 Difference]: Finished difference Result 5948 states and 14912 transitions. [2021-06-05 00:35:52,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-06-05 00:35:52,351 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 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 105 [2021-06-05 00:35:52,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 00:35:52,356 INFO L225 Difference]: With dead ends: 5948 [2021-06-05 00:35:52,356 INFO L226 Difference]: Without dead ends: 5948 [2021-06-05 00:35:52,357 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 1095.4ms TimeCoverageRelationStatistics Valid=320, Invalid=870, Unknown=0, NotChecked=0, Total=1190 [2021-06-05 00:35:52,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5948 states. [2021-06-05 00:35:52,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5948 to 3921. [2021-06-05 00:35:52,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3921 states, 3919 states have (on average 2.613676958407757) internal successors, (10243), 3920 states have internal predecessors, (10243), 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-06-05 00:35:52,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3921 states to 3921 states and 10243 transitions. [2021-06-05 00:35:52,403 INFO L78 Accepts]: Start accepts. Automaton has 3921 states and 10243 transitions. Word has length 105 [2021-06-05 00:35:52,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 00:35:52,403 INFO L482 AbstractCegarLoop]: Abstraction has 3921 states and 10243 transitions. [2021-06-05 00:35:52,403 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 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-06-05 00:35:52,403 INFO L276 IsEmpty]: Start isEmpty. Operand 3921 states and 10243 transitions. [2021-06-05 00:35:52,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-06-05 00:35:52,406 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 00:35:52,406 INFO L521 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-05 00:35:52,406 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-06-05 00:35:52,406 INFO L430 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 00:35:52,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 00:35:52,406 INFO L82 PathProgramCache]: Analyzing trace with hash -1795359232, now seen corresponding path program 23 times [2021-06-05 00:35:52,406 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 00:35:52,407 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493825563] [2021-06-05 00:35:52,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 00:35:52,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 00:35:52,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 00:35:52,803 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 00:35:52,803 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493825563] [2021-06-05 00:35:52,803 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493825563] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 00:35:52,803 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 00:35:52,803 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-06-05 00:35:52,803 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799532647] [2021-06-05 00:35:52,804 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 00:35:52,804 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 00:35:52,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 00:35:52,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2021-06-05 00:35:52,804 INFO L87 Difference]: Start difference. First operand 3921 states and 10243 transitions. Second operand has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 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-06-05 00:35:53,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 00:35:53,753 INFO L93 Difference]: Finished difference Result 4465 states and 11330 transitions. [2021-06-05 00:35:53,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-06-05 00:35:53,754 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 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 105 [2021-06-05 00:35:53,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 00:35:53,757 INFO L225 Difference]: With dead ends: 4465 [2021-06-05 00:35:53,758 INFO L226 Difference]: Without dead ends: 4465 [2021-06-05 00:35:53,758 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 815.9ms TimeCoverageRelationStatistics Valid=262, Invalid=860, Unknown=0, NotChecked=0, Total=1122 [2021-06-05 00:35:53,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4465 states. [2021-06-05 00:35:53,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4465 to 3903. [2021-06-05 00:35:53,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3903 states, 3901 states have (on average 2.614201486798257) internal successors, (10198), 3902 states have internal predecessors, (10198), 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-06-05 00:35:53,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3903 states to 3903 states and 10198 transitions. [2021-06-05 00:35:53,804 INFO L78 Accepts]: Start accepts. Automaton has 3903 states and 10198 transitions. Word has length 105 [2021-06-05 00:35:53,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 00:35:53,804 INFO L482 AbstractCegarLoop]: Abstraction has 3903 states and 10198 transitions. [2021-06-05 00:35:53,804 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 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-06-05 00:35:53,804 INFO L276 IsEmpty]: Start isEmpty. Operand 3903 states and 10198 transitions. [2021-06-05 00:35:53,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-06-05 00:35:53,807 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 00:35:53,807 INFO L521 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-05 00:35:53,807 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-06-05 00:35:53,807 INFO L430 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 00:35:53,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 00:35:53,808 INFO L82 PathProgramCache]: Analyzing trace with hash -1490007060, now seen corresponding path program 24 times [2021-06-05 00:35:53,808 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 00:35:53,808 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547693233] [2021-06-05 00:35:53,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 00:35:53,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 00:35:54,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-06-05 00:35:54,066 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 00:35:54,067 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547693233] [2021-06-05 00:35:54,067 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547693233] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 00:35:54,067 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 00:35:54,068 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-06-05 00:35:54,068 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311188261] [2021-06-05 00:35:54,068 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 00:35:54,068 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 00:35:54,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 00:35:54,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2021-06-05 00:35:54,069 INFO L87 Difference]: Start difference. First operand 3903 states and 10198 transitions. Second operand has 15 states, 15 states have (on average 7.0) internal successors, (105), 15 states have internal predecessors, (105), 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-06-05 00:35:54,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 00:35:54,610 INFO L93 Difference]: Finished difference Result 4518 states and 11434 transitions. [2021-06-05 00:35:54,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-06-05 00:35:54,610 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 7.0) internal successors, (105), 15 states have internal predecessors, (105), 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 105 [2021-06-05 00:35:54,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 00:35:54,616 INFO L225 Difference]: With dead ends: 4518 [2021-06-05 00:35:54,616 INFO L226 Difference]: Without dead ends: 4518 [2021-06-05 00:35:54,616 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 466.5ms TimeCoverageRelationStatistics Valid=210, Invalid=602, Unknown=0, NotChecked=0, Total=812 [2021-06-05 00:35:54,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4518 states. [2021-06-05 00:35:54,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4518 to 3827. [2021-06-05 00:35:54,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3827 states, 3825 states have (on average 2.618562091503268) internal successors, (10016), 3826 states have internal predecessors, (10016), 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-06-05 00:35:54,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3827 states to 3827 states and 10016 transitions. [2021-06-05 00:35:54,663 INFO L78 Accepts]: Start accepts. Automaton has 3827 states and 10016 transitions. Word has length 105 [2021-06-05 00:35:54,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 00:35:54,663 INFO L482 AbstractCegarLoop]: Abstraction has 3827 states and 10016 transitions. [2021-06-05 00:35:54,663 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 7.0) internal successors, (105), 15 states have internal predecessors, (105), 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-06-05 00:35:54,664 INFO L276 IsEmpty]: Start isEmpty. Operand 3827 states and 10016 transitions. [2021-06-05 00:35:54,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-06-05 00:35:54,668 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 00:35:54,668 INFO L521 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-05 00:35:54,668 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-06-05 00:35:54,668 INFO L430 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 00:35:54,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 00:35:54,669 INFO L82 PathProgramCache]: Analyzing trace with hash 585486, now seen corresponding path program 25 times [2021-06-05 00:35:54,669 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 00:35:54,669 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410327329] [2021-06-05 00:35:54,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 00:35:54,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 00:35:54,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 00:35:54,981 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 00:35:54,982 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410327329] [2021-06-05 00:35:54,982 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410327329] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 00:35:54,982 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 00:35:54,982 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-06-05 00:35:54,982 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109381163] [2021-06-05 00:35:54,982 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 00:35:54,998 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 00:35:54,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 00:35:54,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2021-06-05 00:35:54,999 INFO L87 Difference]: Start difference. First operand 3827 states and 10016 transitions. Second operand has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 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-06-05 00:35:55,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 00:35:55,874 INFO L93 Difference]: Finished difference Result 4743 states and 11906 transitions. [2021-06-05 00:35:55,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-06-05 00:35:55,874 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 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 105 [2021-06-05 00:35:55,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 00:35:55,878 INFO L225 Difference]: With dead ends: 4743 [2021-06-05 00:35:55,878 INFO L226 Difference]: Without dead ends: 4743 [2021-06-05 00:35:55,879 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 722.5ms TimeCoverageRelationStatistics Valid=262, Invalid=860, Unknown=0, NotChecked=0, Total=1122 [2021-06-05 00:35:55,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4743 states. [2021-06-05 00:35:55,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4743 to 3829. [2021-06-05 00:35:55,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3829 states, 3827 states have (on average 2.61850013065064) internal successors, (10021), 3828 states have internal predecessors, (10021), 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-06-05 00:35:55,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3829 states to 3829 states and 10021 transitions. [2021-06-05 00:35:55,921 INFO L78 Accepts]: Start accepts. Automaton has 3829 states and 10021 transitions. Word has length 105 [2021-06-05 00:35:55,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 00:35:55,921 INFO L482 AbstractCegarLoop]: Abstraction has 3829 states and 10021 transitions. [2021-06-05 00:35:55,922 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 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-06-05 00:35:55,922 INFO L276 IsEmpty]: Start isEmpty. Operand 3829 states and 10021 transitions. [2021-06-05 00:35:55,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-06-05 00:35:55,925 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 00:35:55,925 INFO L521 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-05 00:35:55,925 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-06-05 00:35:55,925 INFO L430 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 00:35:55,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 00:35:55,925 INFO L82 PathProgramCache]: Analyzing trace with hash 1986945210, now seen corresponding path program 26 times [2021-06-05 00:35:55,925 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 00:35:55,925 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862559915] [2021-06-05 00:35:55,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 00:35:55,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 00:35:56,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 00:35:56,311 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 00:35:56,311 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862559915] [2021-06-05 00:35:56,312 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [862559915] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 00:35:56,312 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 00:35:56,312 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-06-05 00:35:56,312 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619670816] [2021-06-05 00:35:56,312 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 00:35:56,312 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 00:35:56,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 00:35:56,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2021-06-05 00:35:56,313 INFO L87 Difference]: Start difference. First operand 3829 states and 10021 transitions. Second operand has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 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-06-05 00:35:57,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 00:35:57,304 INFO L93 Difference]: Finished difference Result 4826 states and 12065 transitions. [2021-06-05 00:35:57,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-06-05 00:35:57,305 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 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 105 [2021-06-05 00:35:57,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 00:35:57,310 INFO L225 Difference]: With dead ends: 4826 [2021-06-05 00:35:57,310 INFO L226 Difference]: Without dead ends: 4826 [2021-06-05 00:35:57,311 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 881.6ms TimeCoverageRelationStatistics Valid=287, Invalid=903, Unknown=0, NotChecked=0, Total=1190 [2021-06-05 00:35:57,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4826 states. [2021-06-05 00:35:57,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4826 to 3821. [2021-06-05 00:35:57,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3821 states, 3819 states have (on average 2.618748363445928) internal successors, (10001), 3820 states have internal predecessors, (10001), 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-06-05 00:35:57,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3821 states to 3821 states and 10001 transitions. [2021-06-05 00:35:57,380 INFO L78 Accepts]: Start accepts. Automaton has 3821 states and 10001 transitions. Word has length 105 [2021-06-05 00:35:57,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 00:35:57,380 INFO L482 AbstractCegarLoop]: Abstraction has 3821 states and 10001 transitions. [2021-06-05 00:35:57,380 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 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-06-05 00:35:57,381 INFO L276 IsEmpty]: Start isEmpty. Operand 3821 states and 10001 transitions. [2021-06-05 00:35:57,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-06-05 00:35:57,386 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 00:35:57,386 INFO L521 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-05 00:35:57,386 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-06-05 00:35:57,386 INFO L430 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 00:35:57,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 00:35:57,386 INFO L82 PathProgramCache]: Analyzing trace with hash 1605592104, now seen corresponding path program 27 times [2021-06-05 00:35:57,387 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 00:35:57,387 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471486833] [2021-06-05 00:35:57,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 00:35:57,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 00:35:57,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 00:35:57,782 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 00:35:57,782 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471486833] [2021-06-05 00:35:57,782 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [471486833] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 00:35:57,782 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 00:35:57,782 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-06-05 00:35:57,782 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104952697] [2021-06-05 00:35:57,783 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 00:35:57,783 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 00:35:57,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 00:35:57,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2021-06-05 00:35:57,784 INFO L87 Difference]: Start difference. First operand 3821 states and 10001 transitions. Second operand has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 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-06-05 00:35:58,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 00:35:58,664 INFO L93 Difference]: Finished difference Result 4320 states and 11007 transitions. [2021-06-05 00:35:58,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-06-05 00:35:58,665 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 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 105 [2021-06-05 00:35:58,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 00:35:58,669 INFO L225 Difference]: With dead ends: 4320 [2021-06-05 00:35:58,669 INFO L226 Difference]: Without dead ends: 4320 [2021-06-05 00:35:58,669 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 768.3ms TimeCoverageRelationStatistics Valid=264, Invalid=858, Unknown=0, NotChecked=0, Total=1122 [2021-06-05 00:35:58,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4320 states. [2021-06-05 00:35:58,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4320 to 3839. [2021-06-05 00:35:58,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3839 states, 3837 states have (on average 2.618191295282773) internal successors, (10046), 3838 states have internal predecessors, (10046), 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-06-05 00:35:58,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3839 states to 3839 states and 10046 transitions. [2021-06-05 00:35:58,712 INFO L78 Accepts]: Start accepts. Automaton has 3839 states and 10046 transitions. Word has length 105 [2021-06-05 00:35:58,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 00:35:58,712 INFO L482 AbstractCegarLoop]: Abstraction has 3839 states and 10046 transitions. [2021-06-05 00:35:58,712 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 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-06-05 00:35:58,712 INFO L276 IsEmpty]: Start isEmpty. Operand 3839 states and 10046 transitions. [2021-06-05 00:35:58,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-06-05 00:35:58,715 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 00:35:58,715 INFO L521 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-05 00:35:58,716 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-06-05 00:35:58,716 INFO L430 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 00:35:58,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 00:35:58,716 INFO L82 PathProgramCache]: Analyzing trace with hash -291468002, now seen corresponding path program 28 times [2021-06-05 00:35:58,716 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 00:35:58,716 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829392449] [2021-06-05 00:35:58,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 00:35:58,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 00:35:59,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 00:35:59,053 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 00:35:59,054 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829392449] [2021-06-05 00:35:59,054 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829392449] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 00:35:59,054 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 00:35:59,054 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-06-05 00:35:59,054 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585830629] [2021-06-05 00:35:59,054 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 00:35:59,054 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 00:35:59,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 00:35:59,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2021-06-05 00:35:59,055 INFO L87 Difference]: Start difference. First operand 3839 states and 10046 transitions. Second operand has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 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-06-05 00:35:59,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 00:35:59,882 INFO L93 Difference]: Finished difference Result 4533 states and 11432 transitions. [2021-06-05 00:35:59,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-06-05 00:35:59,883 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 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 105 [2021-06-05 00:35:59,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 00:35:59,886 INFO L225 Difference]: With dead ends: 4533 [2021-06-05 00:35:59,886 INFO L226 Difference]: Without dead ends: 4533 [2021-06-05 00:35:59,887 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 710.4ms TimeCoverageRelationStatistics Valid=263, Invalid=859, Unknown=0, NotChecked=0, Total=1122 [2021-06-05 00:35:59,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4533 states. [2021-06-05 00:35:59,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4533 to 3839. [2021-06-05 00:35:59,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3839 states, 3837 states have (on average 2.618191295282773) internal successors, (10046), 3838 states have internal predecessors, (10046), 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-06-05 00:35:59,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3839 states to 3839 states and 10046 transitions. [2021-06-05 00:35:59,926 INFO L78 Accepts]: Start accepts. Automaton has 3839 states and 10046 transitions. Word has length 105 [2021-06-05 00:35:59,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 00:35:59,926 INFO L482 AbstractCegarLoop]: Abstraction has 3839 states and 10046 transitions. [2021-06-05 00:35:59,926 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 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-06-05 00:35:59,926 INFO L276 IsEmpty]: Start isEmpty. Operand 3839 states and 10046 transitions. [2021-06-05 00:35:59,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-06-05 00:35:59,929 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 00:35:59,930 INFO L521 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-05 00:35:59,930 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-06-05 00:35:59,930 INFO L430 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 00:35:59,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 00:35:59,930 INFO L82 PathProgramCache]: Analyzing trace with hash 1694891722, now seen corresponding path program 29 times [2021-06-05 00:35:59,930 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 00:35:59,930 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600866858] [2021-06-05 00:35:59,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 00:35:59,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 00:36:00,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 00:36:00,314 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 00:36:00,314 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600866858] [2021-06-05 00:36:00,314 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600866858] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 00:36:00,314 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 00:36:00,314 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-06-05 00:36:00,314 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498528162] [2021-06-05 00:36:00,314 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 00:36:00,314 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 00:36:00,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 00:36:00,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2021-06-05 00:36:00,315 INFO L87 Difference]: Start difference. First operand 3839 states and 10046 transitions. Second operand has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 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-06-05 00:36:01,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 00:36:01,252 INFO L93 Difference]: Finished difference Result 4397 states and 11151 transitions. [2021-06-05 00:36:01,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-06-05 00:36:01,252 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 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 105 [2021-06-05 00:36:01,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 00:36:01,256 INFO L225 Difference]: With dead ends: 4397 [2021-06-05 00:36:01,256 INFO L226 Difference]: Without dead ends: 4397 [2021-06-05 00:36:01,257 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 807.2ms TimeCoverageRelationStatistics Valid=288, Invalid=902, Unknown=0, NotChecked=0, Total=1190 [2021-06-05 00:36:01,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4397 states. [2021-06-05 00:36:01,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4397 to 3831. [2021-06-05 00:36:01,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3831 states, 3829 states have (on average 2.618438234525986) internal successors, (10026), 3830 states have internal predecessors, (10026), 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-06-05 00:36:01,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3831 states to 3831 states and 10026 transitions. [2021-06-05 00:36:01,300 INFO L78 Accepts]: Start accepts. Automaton has 3831 states and 10026 transitions. Word has length 105 [2021-06-05 00:36:01,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 00:36:01,300 INFO L482 AbstractCegarLoop]: Abstraction has 3831 states and 10026 transitions. [2021-06-05 00:36:01,300 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 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-06-05 00:36:01,300 INFO L276 IsEmpty]: Start isEmpty. Operand 3831 states and 10026 transitions. [2021-06-05 00:36:01,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-06-05 00:36:01,305 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 00:36:01,305 INFO L521 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-05 00:36:01,305 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2021-06-05 00:36:01,305 INFO L430 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 00:36:01,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 00:36:01,306 INFO L82 PathProgramCache]: Analyzing trace with hash 1380809994, now seen corresponding path program 30 times [2021-06-05 00:36:01,306 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 00:36:01,306 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88272714] [2021-06-05 00:36:01,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 00:36:01,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 00:36:01,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 00:36:01,606 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 00:36:01,606 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88272714] [2021-06-05 00:36:01,606 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [88272714] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 00:36:01,606 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 00:36:01,606 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-06-05 00:36:01,606 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950642870] [2021-06-05 00:36:01,607 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 00:36:01,607 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 00:36:01,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 00:36:01,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2021-06-05 00:36:01,607 INFO L87 Difference]: Start difference. First operand 3831 states and 10026 transitions. Second operand has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 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-06-05 00:36:02,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 00:36:02,520 INFO L93 Difference]: Finished difference Result 4697 states and 11791 transitions. [2021-06-05 00:36:02,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-06-05 00:36:02,520 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 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 105 [2021-06-05 00:36:02,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 00:36:02,523 INFO L225 Difference]: With dead ends: 4697 [2021-06-05 00:36:02,523 INFO L226 Difference]: Without dead ends: 4697 [2021-06-05 00:36:02,524 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 759.7ms TimeCoverageRelationStatistics Valid=286, Invalid=836, Unknown=0, NotChecked=0, Total=1122 [2021-06-05 00:36:02,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4697 states. [2021-06-05 00:36:02,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4697 to 3893. [2021-06-05 00:36:02,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3893 states, 3891 states have (on average 2.6150089951169364) internal successors, (10175), 3892 states have internal predecessors, (10175), 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-06-05 00:36:02,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3893 states to 3893 states and 10175 transitions. [2021-06-05 00:36:02,559 INFO L78 Accepts]: Start accepts. Automaton has 3893 states and 10175 transitions. Word has length 105 [2021-06-05 00:36:02,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 00:36:02,559 INFO L482 AbstractCegarLoop]: Abstraction has 3893 states and 10175 transitions. [2021-06-05 00:36:02,560 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 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-06-05 00:36:02,560 INFO L276 IsEmpty]: Start isEmpty. Operand 3893 states and 10175 transitions. [2021-06-05 00:36:02,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-06-05 00:36:02,563 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 00:36:02,563 INFO L521 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-05 00:36:02,563 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2021-06-05 00:36:02,563 INFO L430 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 00:36:02,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 00:36:02,563 INFO L82 PathProgramCache]: Analyzing trace with hash -1168161044, now seen corresponding path program 31 times [2021-06-05 00:36:02,563 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 00:36:02,564 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284637721] [2021-06-05 00:36:02,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 00:36:02,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 00:36:02,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 00:36:02,899 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 00:36:02,899 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284637721] [2021-06-05 00:36:02,899 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284637721] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 00:36:02,900 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 00:36:02,900 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-06-05 00:36:02,900 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125331054] [2021-06-05 00:36:02,900 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 00:36:02,900 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 00:36:02,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 00:36:02,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2021-06-05 00:36:02,901 INFO L87 Difference]: Start difference. First operand 3893 states and 10175 transitions. Second operand has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 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-06-05 00:36:04,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 00:36:04,117 INFO L93 Difference]: Finished difference Result 6573 states and 16534 transitions. [2021-06-05 00:36:04,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-06-05 00:36:04,117 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 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 105 [2021-06-05 00:36:04,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 00:36:04,123 INFO L225 Difference]: With dead ends: 6573 [2021-06-05 00:36:04,123 INFO L226 Difference]: Without dead ends: 6573 [2021-06-05 00:36:04,124 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 1064.4ms TimeCoverageRelationStatistics Valid=297, Invalid=825, Unknown=0, NotChecked=0, Total=1122 [2021-06-05 00:36:04,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6573 states. [2021-06-05 00:36:04,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6573 to 3961. [2021-06-05 00:36:04,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3961 states, 3959 states have (on average 2.6221267996968933) internal successors, (10381), 3960 states have internal predecessors, (10381), 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-06-05 00:36:04,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3961 states to 3961 states and 10381 transitions. [2021-06-05 00:36:04,178 INFO L78 Accepts]: Start accepts. Automaton has 3961 states and 10381 transitions. Word has length 105 [2021-06-05 00:36:04,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 00:36:04,178 INFO L482 AbstractCegarLoop]: Abstraction has 3961 states and 10381 transitions. [2021-06-05 00:36:04,178 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 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-06-05 00:36:04,178 INFO L276 IsEmpty]: Start isEmpty. Operand 3961 states and 10381 transitions. [2021-06-05 00:36:04,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-06-05 00:36:04,181 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 00:36:04,181 INFO L521 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-05 00:36:04,181 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2021-06-05 00:36:04,181 INFO L430 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 00:36:04,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 00:36:04,182 INFO L82 PathProgramCache]: Analyzing trace with hash -111431832, now seen corresponding path program 32 times [2021-06-05 00:36:04,182 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 00:36:04,182 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007671081] [2021-06-05 00:36:04,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 00:36:04,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 00:36:04,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 00:36:04,529 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 00:36:04,529 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007671081] [2021-06-05 00:36:04,529 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007671081] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 00:36:04,529 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 00:36:04,529 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-06-05 00:36:04,529 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763733807] [2021-06-05 00:36:04,529 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 00:36:04,529 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 00:36:04,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 00:36:04,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2021-06-05 00:36:04,530 INFO L87 Difference]: Start difference. First operand 3961 states and 10381 transitions. Second operand has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 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-06-05 00:36:05,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 00:36:05,821 INFO L93 Difference]: Finished difference Result 6173 states and 15715 transitions. [2021-06-05 00:36:05,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-06-05 00:36:05,821 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 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 105 [2021-06-05 00:36:05,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 00:36:05,827 INFO L225 Difference]: With dead ends: 6173 [2021-06-05 00:36:05,827 INFO L226 Difference]: Without dead ends: 6173 [2021-06-05 00:36:05,827 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 1081.5ms TimeCoverageRelationStatistics Valid=288, Invalid=768, Unknown=0, NotChecked=0, Total=1056 [2021-06-05 00:36:05,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6173 states. [2021-06-05 00:36:05,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6173 to 4001. [2021-06-05 00:36:05,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4001 states, 3999 states have (on average 2.6319079769942486) internal successors, (10525), 4000 states have internal predecessors, (10525), 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-06-05 00:36:05,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4001 states to 4001 states and 10525 transitions. [2021-06-05 00:36:05,874 INFO L78 Accepts]: Start accepts. Automaton has 4001 states and 10525 transitions. Word has length 105 [2021-06-05 00:36:05,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 00:36:05,874 INFO L482 AbstractCegarLoop]: Abstraction has 4001 states and 10525 transitions. [2021-06-05 00:36:05,874 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 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-06-05 00:36:05,874 INFO L276 IsEmpty]: Start isEmpty. Operand 4001 states and 10525 transitions. [2021-06-05 00:36:05,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-06-05 00:36:05,879 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 00:36:05,879 INFO L521 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-05 00:36:05,879 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2021-06-05 00:36:05,879 INFO L430 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 00:36:05,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 00:36:05,879 INFO L82 PathProgramCache]: Analyzing trace with hash -409886238, now seen corresponding path program 33 times [2021-06-05 00:36:05,880 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 00:36:05,880 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380574065] [2021-06-05 00:36:05,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 00:36:05,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 00:36:06,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 00:36:06,190 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 00:36:06,190 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380574065] [2021-06-05 00:36:06,190 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380574065] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 00:36:06,190 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 00:36:06,190 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-06-05 00:36:06,190 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677751157] [2021-06-05 00:36:06,191 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 00:36:06,191 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 00:36:06,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 00:36:06,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2021-06-05 00:36:06,191 INFO L87 Difference]: Start difference. First operand 4001 states and 10525 transitions. Second operand has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 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-06-05 00:36:07,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 00:36:07,072 INFO L93 Difference]: Finished difference Result 4955 states and 12471 transitions. [2021-06-05 00:36:07,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-06-05 00:36:07,072 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 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 105 [2021-06-05 00:36:07,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 00:36:07,077 INFO L225 Difference]: With dead ends: 4955 [2021-06-05 00:36:07,077 INFO L226 Difference]: Without dead ends: 4955 [2021-06-05 00:36:07,077 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 721.1ms TimeCoverageRelationStatistics Valid=274, Invalid=848, Unknown=0, NotChecked=0, Total=1122 [2021-06-05 00:36:07,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4955 states. [2021-06-05 00:36:07,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4955 to 3968. [2021-06-05 00:36:07,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3968 states, 3966 states have (on average 2.6326273323247604) internal successors, (10441), 3967 states have internal predecessors, (10441), 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-06-05 00:36:07,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3968 states to 3968 states and 10441 transitions. [2021-06-05 00:36:07,125 INFO L78 Accepts]: Start accepts. Automaton has 3968 states and 10441 transitions. Word has length 105 [2021-06-05 00:36:07,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 00:36:07,125 INFO L482 AbstractCegarLoop]: Abstraction has 3968 states and 10441 transitions. [2021-06-05 00:36:07,125 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 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-06-05 00:36:07,125 INFO L276 IsEmpty]: Start isEmpty. Operand 3968 states and 10441 transitions. [2021-06-05 00:36:07,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-06-05 00:36:07,129 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 00:36:07,129 INFO L521 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-05 00:36:07,129 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2021-06-05 00:36:07,129 INFO L430 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 00:36:07,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 00:36:07,129 INFO L82 PathProgramCache]: Analyzing trace with hash 910792620, now seen corresponding path program 34 times [2021-06-05 00:36:07,129 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 00:36:07,129 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095638785] [2021-06-05 00:36:07,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 00:36:07,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 00:36:07,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 00:36:07,483 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 00:36:07,483 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095638785] [2021-06-05 00:36:07,483 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095638785] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 00:36:07,483 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 00:36:07,484 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-06-05 00:36:07,484 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713640879] [2021-06-05 00:36:07,484 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 00:36:07,484 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 00:36:07,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 00:36:07,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2021-06-05 00:36:07,484 INFO L87 Difference]: Start difference. First operand 3968 states and 10441 transitions. Second operand has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 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-06-05 00:36:08,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 00:36:08,383 INFO L93 Difference]: Finished difference Result 5105 states and 12779 transitions. [2021-06-05 00:36:08,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-06-05 00:36:08,384 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 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 105 [2021-06-05 00:36:08,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 00:36:08,388 INFO L225 Difference]: With dead ends: 5105 [2021-06-05 00:36:08,388 INFO L226 Difference]: Without dead ends: 5105 [2021-06-05 00:36:08,388 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 732.6ms TimeCoverageRelationStatistics Valid=274, Invalid=848, Unknown=0, NotChecked=0, Total=1122 [2021-06-05 00:36:08,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5105 states. [2021-06-05 00:36:08,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5105 to 3971. [2021-06-05 00:36:08,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3971 states, 3969 states have (on average 2.63265306122449) internal successors, (10449), 3970 states have internal predecessors, (10449), 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-06-05 00:36:08,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3971 states to 3971 states and 10449 transitions. [2021-06-05 00:36:08,447 INFO L78 Accepts]: Start accepts. Automaton has 3971 states and 10449 transitions. Word has length 105 [2021-06-05 00:36:08,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 00:36:08,447 INFO L482 AbstractCegarLoop]: Abstraction has 3971 states and 10449 transitions. [2021-06-05 00:36:08,447 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 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-06-05 00:36:08,447 INFO L276 IsEmpty]: Start isEmpty. Operand 3971 states and 10449 transitions. [2021-06-05 00:36:08,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-06-05 00:36:08,450 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 00:36:08,450 INFO L521 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-05 00:36:08,451 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2021-06-05 00:36:08,451 INFO L430 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 00:36:08,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 00:36:08,451 INFO L82 PathProgramCache]: Analyzing trace with hash -1936565376, now seen corresponding path program 35 times [2021-06-05 00:36:08,451 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 00:36:08,451 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20676270] [2021-06-05 00:36:08,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 00:36:08,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 00:36:08,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 00:36:08,780 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 00:36:08,780 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20676270] [2021-06-05 00:36:08,780 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20676270] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 00:36:08,780 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 00:36:08,780 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-06-05 00:36:08,780 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918808114] [2021-06-05 00:36:08,780 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 00:36:08,780 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 00:36:08,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 00:36:08,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2021-06-05 00:36:08,781 INFO L87 Difference]: Start difference. First operand 3971 states and 10449 transitions. Second operand has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 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-06-05 00:36:09,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 00:36:09,813 INFO L93 Difference]: Finished difference Result 4879 states and 12300 transitions. [2021-06-05 00:36:09,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-06-05 00:36:09,814 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 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 105 [2021-06-05 00:36:09,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 00:36:09,817 INFO L225 Difference]: With dead ends: 4879 [2021-06-05 00:36:09,817 INFO L226 Difference]: Without dead ends: 4879 [2021-06-05 00:36:09,818 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 845.4ms TimeCoverageRelationStatistics Valid=299, Invalid=891, Unknown=0, NotChecked=0, Total=1190 [2021-06-05 00:36:09,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4879 states. [2021-06-05 00:36:09,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4879 to 3969. [2021-06-05 00:36:09,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3969 states, 3967 states have (on average 2.6332240988152256) internal successors, (10446), 3968 states have internal predecessors, (10446), 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-06-05 00:36:09,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3969 states to 3969 states and 10446 transitions. [2021-06-05 00:36:09,866 INFO L78 Accepts]: Start accepts. Automaton has 3969 states and 10446 transitions. Word has length 105 [2021-06-05 00:36:09,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 00:36:09,866 INFO L482 AbstractCegarLoop]: Abstraction has 3969 states and 10446 transitions. [2021-06-05 00:36:09,867 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 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-06-05 00:36:09,867 INFO L276 IsEmpty]: Start isEmpty. Operand 3969 states and 10446 transitions. [2021-06-05 00:36:09,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-06-05 00:36:09,870 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 00:36:09,871 INFO L521 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-05 00:36:09,871 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2021-06-05 00:36:09,871 INFO L430 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 00:36:09,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 00:36:09,871 INFO L82 PathProgramCache]: Analyzing trace with hash 1118177890, now seen corresponding path program 36 times [2021-06-05 00:36:09,871 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 00:36:09,871 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874018021] [2021-06-05 00:36:09,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 00:36:09,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 00:36:10,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 00:36:10,195 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 00:36:10,195 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874018021] [2021-06-05 00:36:10,195 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874018021] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 00:36:10,196 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 00:36:10,196 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-06-05 00:36:10,196 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309211362] [2021-06-05 00:36:10,196 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 00:36:10,196 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 00:36:10,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 00:36:10,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2021-06-05 00:36:10,197 INFO L87 Difference]: Start difference. First operand 3969 states and 10446 transitions. Second operand has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 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-06-05 00:36:11,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 00:36:11,467 INFO L93 Difference]: Finished difference Result 6283 states and 15856 transitions. [2021-06-05 00:36:11,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-06-05 00:36:11,467 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 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 105 [2021-06-05 00:36:11,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 00:36:11,473 INFO L225 Difference]: With dead ends: 6283 [2021-06-05 00:36:11,473 INFO L226 Difference]: Without dead ends: 6283 [2021-06-05 00:36:11,474 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 1037.0ms TimeCoverageRelationStatistics Valid=296, Invalid=826, Unknown=0, NotChecked=0, Total=1122 [2021-06-05 00:36:11,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6283 states. [2021-06-05 00:36:11,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6283 to 3966. [2021-06-05 00:36:11,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3966 states, 3964 states have (on average 2.6331987891019173) internal successors, (10438), 3965 states have internal predecessors, (10438), 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-06-05 00:36:11,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3966 states to 3966 states and 10438 transitions. [2021-06-05 00:36:11,520 INFO L78 Accepts]: Start accepts. Automaton has 3966 states and 10438 transitions. Word has length 105 [2021-06-05 00:36:11,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 00:36:11,521 INFO L482 AbstractCegarLoop]: Abstraction has 3966 states and 10438 transitions. [2021-06-05 00:36:11,521 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 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-06-05 00:36:11,521 INFO L276 IsEmpty]: Start isEmpty. Operand 3966 states and 10438 transitions. [2021-06-05 00:36:11,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-06-05 00:36:11,524 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 00:36:11,524 INFO L521 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-05 00:36:11,524 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2021-06-05 00:36:11,524 INFO L430 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 00:36:11,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 00:36:11,524 INFO L82 PathProgramCache]: Analyzing trace with hash -2120060194, now seen corresponding path program 37 times [2021-06-05 00:36:11,524 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 00:36:11,525 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519884860] [2021-06-05 00:36:11,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 00:36:11,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 00:36:11,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 00:36:11,826 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 00:36:11,826 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519884860] [2021-06-05 00:36:11,826 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1519884860] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 00:36:11,826 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 00:36:11,826 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-06-05 00:36:11,826 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951218783] [2021-06-05 00:36:11,826 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 00:36:11,826 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 00:36:11,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 00:36:11,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2021-06-05 00:36:11,827 INFO L87 Difference]: Start difference. First operand 3966 states and 10438 transitions. Second operand has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 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-06-05 00:36:13,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 00:36:13,155 INFO L93 Difference]: Finished difference Result 7673 states and 19508 transitions. [2021-06-05 00:36:13,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-06-05 00:36:13,155 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 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 105 [2021-06-05 00:36:13,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 00:36:13,161 INFO L225 Difference]: With dead ends: 7673 [2021-06-05 00:36:13,161 INFO L226 Difference]: Without dead ends: 7673 [2021-06-05 00:36:13,162 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 1032.5ms TimeCoverageRelationStatistics Valid=287, Invalid=769, Unknown=0, NotChecked=0, Total=1056 [2021-06-05 00:36:13,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7673 states. [2021-06-05 00:36:13,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7673 to 3894. [2021-06-05 00:36:13,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3894 states, 3892 states have (on average 2.6264131551901335) internal successors, (10222), 3893 states have internal predecessors, (10222), 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-06-05 00:36:13,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3894 states to 3894 states and 10222 transitions. [2021-06-05 00:36:13,216 INFO L78 Accepts]: Start accepts. Automaton has 3894 states and 10222 transitions. Word has length 105 [2021-06-05 00:36:13,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 00:36:13,217 INFO L482 AbstractCegarLoop]: Abstraction has 3894 states and 10222 transitions. [2021-06-05 00:36:13,217 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 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-06-05 00:36:13,217 INFO L276 IsEmpty]: Start isEmpty. Operand 3894 states and 10222 transitions. [2021-06-05 00:36:13,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-06-05 00:36:13,220 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 00:36:13,220 INFO L521 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-05 00:36:13,220 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2021-06-05 00:36:13,220 INFO L430 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 00:36:13,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 00:36:13,220 INFO L82 PathProgramCache]: Analyzing trace with hash -463607158, now seen corresponding path program 38 times [2021-06-05 00:36:13,221 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 00:36:13,221 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968276919] [2021-06-05 00:36:13,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 00:36:13,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 00:36:13,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 00:36:13,568 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 00:36:13,568 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968276919] [2021-06-05 00:36:13,568 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968276919] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 00:36:13,568 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 00:36:13,568 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-06-05 00:36:13,569 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473602988] [2021-06-05 00:36:13,569 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 00:36:13,569 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 00:36:13,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 00:36:13,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2021-06-05 00:36:13,569 INFO L87 Difference]: Start difference. First operand 3894 states and 10222 transitions. Second operand has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 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-06-05 00:36:14,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 00:36:14,720 INFO L93 Difference]: Finished difference Result 5433 states and 13675 transitions. [2021-06-05 00:36:14,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-06-05 00:36:14,720 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 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 105 [2021-06-05 00:36:14,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 00:36:14,725 INFO L225 Difference]: With dead ends: 5433 [2021-06-05 00:36:14,725 INFO L226 Difference]: Without dead ends: 5433 [2021-06-05 00:36:14,725 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 1001.2ms TimeCoverageRelationStatistics Valid=285, Invalid=837, Unknown=0, NotChecked=0, Total=1122 [2021-06-05 00:36:14,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5433 states. [2021-06-05 00:36:14,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5433 to 3883. [2021-06-05 00:36:14,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3883 states, 3881 states have (on average 2.626642617881989) internal successors, (10194), 3882 states have internal predecessors, (10194), 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-06-05 00:36:14,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3883 states to 3883 states and 10194 transitions. [2021-06-05 00:36:14,770 INFO L78 Accepts]: Start accepts. Automaton has 3883 states and 10194 transitions. Word has length 105 [2021-06-05 00:36:14,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 00:36:14,770 INFO L482 AbstractCegarLoop]: Abstraction has 3883 states and 10194 transitions. [2021-06-05 00:36:14,770 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 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-06-05 00:36:14,770 INFO L276 IsEmpty]: Start isEmpty. Operand 3883 states and 10194 transitions. [2021-06-05 00:36:14,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-06-05 00:36:14,773 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 00:36:14,773 INFO L521 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-05 00:36:14,773 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2021-06-05 00:36:14,773 INFO L430 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 00:36:14,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 00:36:14,774 INFO L82 PathProgramCache]: Analyzing trace with hash 984002142, now seen corresponding path program 39 times [2021-06-05 00:36:14,774 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 00:36:14,774 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218019321] [2021-06-05 00:36:14,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 00:36:14,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 00:36:15,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 00:36:15,078 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 00:36:15,078 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218019321] [2021-06-05 00:36:15,078 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218019321] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 00:36:15,078 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 00:36:15,079 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-06-05 00:36:15,079 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401055395] [2021-06-05 00:36:15,079 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 00:36:15,079 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 00:36:15,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 00:36:15,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2021-06-05 00:36:15,079 INFO L87 Difference]: Start difference. First operand 3883 states and 10194 transitions. Second operand has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 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-06-05 00:36:16,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 00:36:16,303 INFO L93 Difference]: Finished difference Result 5473 states and 13772 transitions. [2021-06-05 00:36:16,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-06-05 00:36:16,304 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 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 105 [2021-06-05 00:36:16,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 00:36:16,308 INFO L225 Difference]: With dead ends: 5473 [2021-06-05 00:36:16,308 INFO L226 Difference]: Without dead ends: 5473 [2021-06-05 00:36:16,309 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 1029.1ms TimeCoverageRelationStatistics Valid=310, Invalid=880, Unknown=0, NotChecked=0, Total=1190 [2021-06-05 00:36:16,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5473 states. [2021-06-05 00:36:16,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5473 to 3880. [2021-06-05 00:36:16,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3880 states, 3878 states have (on average 2.626611655492522) internal successors, (10186), 3879 states have internal predecessors, (10186), 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-06-05 00:36:16,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3880 states to 3880 states and 10186 transitions. [2021-06-05 00:36:16,354 INFO L78 Accepts]: Start accepts. Automaton has 3880 states and 10186 transitions. Word has length 105 [2021-06-05 00:36:16,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 00:36:16,354 INFO L482 AbstractCegarLoop]: Abstraction has 3880 states and 10186 transitions. [2021-06-05 00:36:16,354 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 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-06-05 00:36:16,354 INFO L276 IsEmpty]: Start isEmpty. Operand 3880 states and 10186 transitions. [2021-06-05 00:36:16,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-06-05 00:36:16,357 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 00:36:16,357 INFO L521 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-05 00:36:16,357 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2021-06-05 00:36:16,357 INFO L430 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 00:36:16,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 00:36:16,357 INFO L82 PathProgramCache]: Analyzing trace with hash -193844854, now seen corresponding path program 40 times [2021-06-05 00:36:16,357 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 00:36:16,357 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7460103] [2021-06-05 00:36:16,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 00:36:16,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 00:36:16,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 00:36:16,709 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 00:36:16,709 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7460103] [2021-06-05 00:36:16,709 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7460103] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 00:36:16,709 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 00:36:16,709 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-06-05 00:36:16,709 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700136496] [2021-06-05 00:36:16,709 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 00:36:16,709 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 00:36:16,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 00:36:16,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2021-06-05 00:36:16,710 INFO L87 Difference]: Start difference. First operand 3880 states and 10186 transitions. Second operand has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 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-06-05 00:36:18,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 00:36:18,602 INFO L93 Difference]: Finished difference Result 6423 states and 16173 transitions. [2021-06-05 00:36:18,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-06-05 00:36:18,602 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 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 105 [2021-06-05 00:36:18,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 00:36:18,606 INFO L225 Difference]: With dead ends: 6423 [2021-06-05 00:36:18,607 INFO L226 Difference]: Without dead ends: 6423 [2021-06-05 00:36:18,607 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 1554.0ms TimeCoverageRelationStatistics Valid=435, Invalid=1125, Unknown=0, NotChecked=0, Total=1560 [2021-06-05 00:36:18,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6423 states. [2021-06-05 00:36:18,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6423 to 3091. [2021-06-05 00:36:18,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3091 states, 3089 states have (on average 2.6137908708319846) internal successors, (8074), 3090 states have internal predecessors, (8074), 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-06-05 00:36:18,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3091 states to 3091 states and 8074 transitions. [2021-06-05 00:36:18,644 INFO L78 Accepts]: Start accepts. Automaton has 3091 states and 8074 transitions. Word has length 105 [2021-06-05 00:36:18,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 00:36:18,644 INFO L482 AbstractCegarLoop]: Abstraction has 3091 states and 8074 transitions. [2021-06-05 00:36:18,644 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 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-06-05 00:36:18,644 INFO L276 IsEmpty]: Start isEmpty. Operand 3091 states and 8074 transitions. [2021-06-05 00:36:18,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-06-05 00:36:18,646 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 00:36:18,646 INFO L521 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-05 00:36:18,646 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2021-06-05 00:36:18,647 INFO L430 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 00:36:18,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 00:36:18,647 INFO L82 PathProgramCache]: Analyzing trace with hash -106322846, now seen corresponding path program 41 times [2021-06-05 00:36:18,647 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 00:36:18,647 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155370884] [2021-06-05 00:36:18,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 00:36:18,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 00:36:18,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 00:36:18,998 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 00:36:18,998 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155370884] [2021-06-05 00:36:18,998 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155370884] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 00:36:18,998 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 00:36:18,998 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-06-05 00:36:18,998 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828470921] [2021-06-05 00:36:18,998 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 00:36:18,998 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 00:36:18,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 00:36:18,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2021-06-05 00:36:18,999 INFO L87 Difference]: Start difference. First operand 3091 states and 8074 transitions. Second operand has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 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-06-05 00:36:20,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 00:36:20,326 INFO L93 Difference]: Finished difference Result 4802 states and 12082 transitions. [2021-06-05 00:36:20,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-06-05 00:36:20,326 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 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 105 [2021-06-05 00:36:20,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 00:36:20,330 INFO L225 Difference]: With dead ends: 4802 [2021-06-05 00:36:20,331 INFO L226 Difference]: Without dead ends: 4802 [2021-06-05 00:36:20,331 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 1137.3ms TimeCoverageRelationStatistics Valid=321, Invalid=869, Unknown=0, NotChecked=0, Total=1190 [2021-06-05 00:36:20,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4802 states. [2021-06-05 00:36:20,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4802 to 2861. [2021-06-05 00:36:20,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2861 states, 2860 states have (on average 2.6479020979020977) internal successors, (7573), 2860 states have internal predecessors, (7573), 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-06-05 00:36:20,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2861 states to 2861 states and 7573 transitions. [2021-06-05 00:36:20,368 INFO L78 Accepts]: Start accepts. Automaton has 2861 states and 7573 transitions. Word has length 105 [2021-06-05 00:36:20,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 00:36:20,368 INFO L482 AbstractCegarLoop]: Abstraction has 2861 states and 7573 transitions. [2021-06-05 00:36:20,368 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 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-06-05 00:36:20,368 INFO L276 IsEmpty]: Start isEmpty. Operand 2861 states and 7573 transitions. [2021-06-05 00:36:20,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2021-06-05 00:36:20,370 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 00:36:20,370 INFO L521 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-05 00:36:20,370 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2021-06-05 00:36:20,370 INFO L430 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 00:36:20,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 00:36:20,371 INFO L82 PathProgramCache]: Analyzing trace with hash -685691517, now seen corresponding path program 1 times [2021-06-05 00:36:20,371 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 00:36:20,371 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072253003] [2021-06-05 00:36:20,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 00:36:20,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 00:36:21,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 00:36:21,252 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 00:36:21,252 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072253003] [2021-06-05 00:36:21,252 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072253003] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 00:36:21,252 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 00:36:21,252 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2021-06-05 00:36:21,252 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616497300] [2021-06-05 00:36:21,253 INFO L462 AbstractCegarLoop]: Interpolant automaton has 28 states [2021-06-05 00:36:21,253 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 00:36:21,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-06-05 00:36:21,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=686, Unknown=0, NotChecked=0, Total=756 [2021-06-05 00:36:21,253 INFO L87 Difference]: Start difference. First operand 2861 states and 7573 transitions. Second operand has 28 states, 28 states have (on average 3.9642857142857144) internal successors, (111), 28 states have internal predecessors, (111), 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-06-05 00:36:23,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 00:36:23,623 INFO L93 Difference]: Finished difference Result 3968 states and 10076 transitions. [2021-06-05 00:36:23,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-06-05 00:36:23,624 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 3.9642857142857144) internal successors, (111), 28 states have internal predecessors, (111), 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 111 [2021-06-05 00:36:23,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 00:36:23,627 INFO L225 Difference]: With dead ends: 3968 [2021-06-05 00:36:23,627 INFO L226 Difference]: Without dead ends: 3877 [2021-06-05 00:36:23,627 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 546 ImplicationChecksByTransitivity, 2335.5ms TimeCoverageRelationStatistics Valid=464, Invalid=2398, Unknown=0, NotChecked=0, Total=2862 [2021-06-05 00:36:23,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3877 states. [2021-06-05 00:36:23,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3877 to 2861. [2021-06-05 00:36:23,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2861 states, 2860 states have (on average 2.644755244755245) internal successors, (7564), 2860 states have internal predecessors, (7564), 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-06-05 00:36:23,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2861 states to 2861 states and 7564 transitions. [2021-06-05 00:36:23,659 INFO L78 Accepts]: Start accepts. Automaton has 2861 states and 7564 transitions. Word has length 111 [2021-06-05 00:36:23,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 00:36:23,659 INFO L482 AbstractCegarLoop]: Abstraction has 2861 states and 7564 transitions. [2021-06-05 00:36:23,659 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 28 states, 28 states have (on average 3.9642857142857144) internal successors, (111), 28 states have internal predecessors, (111), 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-06-05 00:36:23,660 INFO L276 IsEmpty]: Start isEmpty. Operand 2861 states and 7564 transitions. [2021-06-05 00:36:23,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2021-06-05 00:36:23,662 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 00:36:23,662 INFO L521 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-05 00:36:23,662 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2021-06-05 00:36:23,662 INFO L430 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 00:36:23,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 00:36:23,662 INFO L82 PathProgramCache]: Analyzing trace with hash -521604609, now seen corresponding path program 2 times [2021-06-05 00:36:23,662 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 00:36:23,662 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516851574] [2021-06-05 00:36:23,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 00:36:23,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 00:36:24,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 00:36:24,349 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 00:36:24,349 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516851574] [2021-06-05 00:36:24,349 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516851574] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 00:36:24,349 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 00:36:24,349 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2021-06-05 00:36:24,349 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616877087] [2021-06-05 00:36:24,349 INFO L462 AbstractCegarLoop]: Interpolant automaton has 26 states [2021-06-05 00:36:24,349 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 00:36:24,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-06-05 00:36:24,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=585, Unknown=0, NotChecked=0, Total=650 [2021-06-05 00:36:24,350 INFO L87 Difference]: Start difference. First operand 2861 states and 7564 transitions. Second operand has 26 states, 26 states have (on average 4.269230769230769) internal successors, (111), 26 states have internal predecessors, (111), 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-06-05 00:36:26,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 00:36:26,646 INFO L93 Difference]: Finished difference Result 4103 states and 10475 transitions. [2021-06-05 00:36:26,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-06-05 00:36:26,646 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 4.269230769230769) internal successors, (111), 26 states have internal predecessors, (111), 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 111 [2021-06-05 00:36:26,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 00:36:26,650 INFO L225 Difference]: With dead ends: 4103 [2021-06-05 00:36:26,650 INFO L226 Difference]: Without dead ends: 3946 [2021-06-05 00:36:26,650 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 433 ImplicationChecksByTransitivity, 2179.4ms TimeCoverageRelationStatistics Valid=433, Invalid=2017, Unknown=0, NotChecked=0, Total=2450 [2021-06-05 00:36:26,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3946 states. [2021-06-05 00:36:26,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3946 to 3005. [2021-06-05 00:36:26,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3005 states, 3004 states have (on average 2.633821571238349) internal successors, (7912), 3004 states have internal predecessors, (7912), 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-06-05 00:36:26,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3005 states to 3005 states and 7912 transitions. [2021-06-05 00:36:26,682 INFO L78 Accepts]: Start accepts. Automaton has 3005 states and 7912 transitions. Word has length 111 [2021-06-05 00:36:26,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 00:36:26,682 INFO L482 AbstractCegarLoop]: Abstraction has 3005 states and 7912 transitions. [2021-06-05 00:36:26,682 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 26 states, 26 states have (on average 4.269230769230769) internal successors, (111), 26 states have internal predecessors, (111), 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-06-05 00:36:26,682 INFO L276 IsEmpty]: Start isEmpty. Operand 3005 states and 7912 transitions. [2021-06-05 00:36:26,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2021-06-05 00:36:26,684 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 00:36:26,684 INFO L521 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-05 00:36:26,685 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2021-06-05 00:36:26,685 INFO L430 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 00:36:26,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 00:36:26,685 INFO L82 PathProgramCache]: Analyzing trace with hash 17765309, now seen corresponding path program 3 times [2021-06-05 00:36:26,685 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 00:36:26,685 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219762809] [2021-06-05 00:36:26,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 00:36:26,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 00:36:27,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 00:36:27,287 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 00:36:27,287 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219762809] [2021-06-05 00:36:27,287 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219762809] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 00:36:27,287 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 00:36:27,287 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2021-06-05 00:36:27,287 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178879205] [2021-06-05 00:36:27,287 INFO L462 AbstractCegarLoop]: Interpolant automaton has 26 states [2021-06-05 00:36:27,287 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 00:36:27,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-06-05 00:36:27,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=586, Unknown=0, NotChecked=0, Total=650 [2021-06-05 00:36:27,288 INFO L87 Difference]: Start difference. First operand 3005 states and 7912 transitions. Second operand has 26 states, 26 states have (on average 4.269230769230769) internal successors, (111), 26 states have internal predecessors, (111), 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-06-05 00:36:29,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 00:36:29,791 INFO L93 Difference]: Finished difference Result 4001 states and 10200 transitions. [2021-06-05 00:36:29,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-06-05 00:36:29,791 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 4.269230769230769) internal successors, (111), 26 states have internal predecessors, (111), 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 111 [2021-06-05 00:36:29,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 00:36:29,795 INFO L225 Difference]: With dead ends: 4001 [2021-06-05 00:36:29,795 INFO L226 Difference]: Without dead ends: 3910 [2021-06-05 00:36:29,795 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 450 ImplicationChecksByTransitivity, 2249.5ms TimeCoverageRelationStatistics Valid=450, Invalid=2100, Unknown=0, NotChecked=0, Total=2550 [2021-06-05 00:36:29,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3910 states. [2021-06-05 00:36:29,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3910 to 2969. [2021-06-05 00:36:29,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2969 states, 2968 states have (on average 2.6334231805929917) internal successors, (7816), 2968 states have internal predecessors, (7816), 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-06-05 00:36:29,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2969 states to 2969 states and 7816 transitions. [2021-06-05 00:36:29,825 INFO L78 Accepts]: Start accepts. Automaton has 2969 states and 7816 transitions. Word has length 111 [2021-06-05 00:36:29,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 00:36:29,825 INFO L482 AbstractCegarLoop]: Abstraction has 2969 states and 7816 transitions. [2021-06-05 00:36:29,826 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 26 states, 26 states have (on average 4.269230769230769) internal successors, (111), 26 states have internal predecessors, (111), 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-06-05 00:36:29,826 INFO L276 IsEmpty]: Start isEmpty. Operand 2969 states and 7816 transitions. [2021-06-05 00:36:29,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2021-06-05 00:36:29,828 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 00:36:29,828 INFO L521 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-05 00:36:29,828 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2021-06-05 00:36:29,828 INFO L430 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 00:36:29,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 00:36:29,828 INFO L82 PathProgramCache]: Analyzing trace with hash -217387965, now seen corresponding path program 4 times [2021-06-05 00:36:29,828 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 00:36:29,829 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090016748] [2021-06-05 00:36:29,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 00:36:29,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 00:36:30,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 00:36:30,476 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 00:36:30,476 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090016748] [2021-06-05 00:36:30,476 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2090016748] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 00:36:30,476 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 00:36:30,476 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2021-06-05 00:36:30,476 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695860977] [2021-06-05 00:36:30,476 INFO L462 AbstractCegarLoop]: Interpolant automaton has 26 states [2021-06-05 00:36:30,476 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 00:36:30,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-06-05 00:36:30,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=589, Unknown=0, NotChecked=0, Total=650 [2021-06-05 00:36:30,477 INFO L87 Difference]: Start difference. First operand 2969 states and 7816 transitions. Second operand has 26 states, 26 states have (on average 4.269230769230769) internal successors, (111), 26 states have internal predecessors, (111), 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-06-05 00:36:31,999 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 63 [2021-06-05 00:36:32,164 WARN L205 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 66 [2021-06-05 00:36:32,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 00:36:32,809 INFO L93 Difference]: Finished difference Result 3940 states and 10067 transitions. [2021-06-05 00:36:32,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-06-05 00:36:32,810 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 4.269230769230769) internal successors, (111), 26 states have internal predecessors, (111), 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 111 [2021-06-05 00:36:32,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 00:36:32,813 INFO L225 Difference]: With dead ends: 3940 [2021-06-05 00:36:32,813 INFO L226 Difference]: Without dead ends: 3801 [2021-06-05 00:36:32,814 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 373 ImplicationChecksByTransitivity, 2152.9ms TimeCoverageRelationStatistics Valid=402, Invalid=1950, Unknown=0, NotChecked=0, Total=2352 [2021-06-05 00:36:32,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3801 states. [2021-06-05 00:36:32,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3801 to 2897. [2021-06-05 00:36:32,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2897 states, 2896 states have (on average 2.632596685082873) internal successors, (7624), 2896 states have internal predecessors, (7624), 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-06-05 00:36:32,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2897 states to 2897 states and 7624 transitions. [2021-06-05 00:36:32,846 INFO L78 Accepts]: Start accepts. Automaton has 2897 states and 7624 transitions. Word has length 111 [2021-06-05 00:36:32,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 00:36:32,846 INFO L482 AbstractCegarLoop]: Abstraction has 2897 states and 7624 transitions. [2021-06-05 00:36:32,847 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 26 states, 26 states have (on average 4.269230769230769) internal successors, (111), 26 states have internal predecessors, (111), 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-06-05 00:36:32,847 INFO L276 IsEmpty]: Start isEmpty. Operand 2897 states and 7624 transitions. [2021-06-05 00:36:32,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2021-06-05 00:36:32,849 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 00:36:32,849 INFO L521 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-05 00:36:32,849 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2021-06-05 00:36:32,849 INFO L430 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 00:36:32,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 00:36:32,849 INFO L82 PathProgramCache]: Analyzing trace with hash -1564019739, now seen corresponding path program 5 times [2021-06-05 00:36:32,849 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 00:36:32,849 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839304159] [2021-06-05 00:36:32,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 00:36:32,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 00:36:33,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 00:36:33,476 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 00:36:33,476 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839304159] [2021-06-05 00:36:33,477 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839304159] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 00:36:33,477 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 00:36:33,477 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2021-06-05 00:36:33,477 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338830321] [2021-06-05 00:36:33,477 INFO L462 AbstractCegarLoop]: Interpolant automaton has 26 states [2021-06-05 00:36:33,477 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 00:36:33,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-06-05 00:36:33,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=586, Unknown=0, NotChecked=0, Total=650 [2021-06-05 00:36:33,478 INFO L87 Difference]: Start difference. First operand 2897 states and 7624 transitions. Second operand has 26 states, 26 states have (on average 4.269230769230769) internal successors, (111), 26 states have internal predecessors, (111), 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-06-05 00:36:35,122 WARN L205 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 65 [2021-06-05 00:36:35,259 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 60 [2021-06-05 00:36:35,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 00:36:35,813 INFO L93 Difference]: Finished difference Result 3874 states and 9888 transitions. [2021-06-05 00:36:35,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-06-05 00:36:35,813 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 4.269230769230769) internal successors, (111), 26 states have internal predecessors, (111), 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 111 [2021-06-05 00:36:35,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 00:36:35,817 INFO L225 Difference]: With dead ends: 3874 [2021-06-05 00:36:35,818 INFO L226 Difference]: Without dead ends: 3657 [2021-06-05 00:36:35,818 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 407 ImplicationChecksByTransitivity, 2121.0ms TimeCoverageRelationStatistics Valid=405, Invalid=1947, Unknown=0, NotChecked=0, Total=2352 [2021-06-05 00:36:35,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3657 states. [2021-06-05 00:36:35,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3657 to 2753. [2021-06-05 00:36:35,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2753 states, 2752 states have (on average 2.6340843023255816) internal successors, (7249), 2752 states have internal predecessors, (7249), 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-06-05 00:36:35,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2753 states to 2753 states and 7249 transitions. [2021-06-05 00:36:35,849 INFO L78 Accepts]: Start accepts. Automaton has 2753 states and 7249 transitions. Word has length 111 [2021-06-05 00:36:35,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 00:36:35,849 INFO L482 AbstractCegarLoop]: Abstraction has 2753 states and 7249 transitions. [2021-06-05 00:36:35,849 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 26 states, 26 states have (on average 4.269230769230769) internal successors, (111), 26 states have internal predecessors, (111), 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-06-05 00:36:35,849 INFO L276 IsEmpty]: Start isEmpty. Operand 2753 states and 7249 transitions. [2021-06-05 00:36:35,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2021-06-05 00:36:35,851 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 00:36:35,851 INFO L521 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-05 00:36:35,851 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2021-06-05 00:36:35,852 INFO L430 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 00:36:35,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 00:36:35,852 INFO L82 PathProgramCache]: Analyzing trace with hash 857328187, now seen corresponding path program 6 times [2021-06-05 00:36:35,852 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 00:36:35,852 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280644336] [2021-06-05 00:36:35,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 00:36:35,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 00:36:36,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 00:36:36,683 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 00:36:36,683 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280644336] [2021-06-05 00:36:36,683 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280644336] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 00:36:36,683 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 00:36:36,683 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2021-06-05 00:36:36,683 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514688666] [2021-06-05 00:36:36,683 INFO L462 AbstractCegarLoop]: Interpolant automaton has 30 states [2021-06-05 00:36:36,683 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 00:36:36,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-06-05 00:36:36,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=793, Unknown=0, NotChecked=0, Total=870 [2021-06-05 00:36:36,684 INFO L87 Difference]: Start difference. First operand 2753 states and 7249 transitions. Second operand has 30 states, 30 states have (on average 3.7) internal successors, (111), 30 states have internal predecessors, (111), 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-06-05 00:36:39,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 00:36:39,488 INFO L93 Difference]: Finished difference Result 3749 states and 9472 transitions. [2021-06-05 00:36:39,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2021-06-05 00:36:39,489 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 3.7) internal successors, (111), 30 states have internal predecessors, (111), 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 111 [2021-06-05 00:36:39,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 00:36:39,492 INFO L225 Difference]: With dead ends: 3749 [2021-06-05 00:36:39,492 INFO L226 Difference]: Without dead ends: 3658 [2021-06-05 00:36:39,493 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 653 ImplicationChecksByTransitivity, 2561.3ms TimeCoverageRelationStatistics Valid=582, Invalid=2958, Unknown=0, NotChecked=0, Total=3540 [2021-06-05 00:36:39,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3658 states. [2021-06-05 00:36:39,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3658 to 2759. [2021-06-05 00:36:39,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2759 states, 2758 states have (on average 2.6316171138506164) internal successors, (7258), 2758 states have internal predecessors, (7258), 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-06-05 00:36:39,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2759 states to 2759 states and 7258 transitions. [2021-06-05 00:36:39,527 INFO L78 Accepts]: Start accepts. Automaton has 2759 states and 7258 transitions. Word has length 111 [2021-06-05 00:36:39,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 00:36:39,527 INFO L482 AbstractCegarLoop]: Abstraction has 2759 states and 7258 transitions. [2021-06-05 00:36:39,527 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 30 states, 30 states have (on average 3.7) internal successors, (111), 30 states have internal predecessors, (111), 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-06-05 00:36:39,527 INFO L276 IsEmpty]: Start isEmpty. Operand 2759 states and 7258 transitions. [2021-06-05 00:36:39,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2021-06-05 00:36:39,529 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 00:36:39,529 INFO L521 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-05 00:36:39,529 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2021-06-05 00:36:39,530 INFO L430 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 00:36:39,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 00:36:39,530 INFO L82 PathProgramCache]: Analyzing trace with hash 1824706281, now seen corresponding path program 7 times [2021-06-05 00:36:39,530 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 00:36:39,530 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197064401] [2021-06-05 00:36:39,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 00:36:39,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-05 00:36:39,556 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-05 00:36:39,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-05 00:36:39,584 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-05 00:36:39,622 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-05 00:36:39,622 INFO L622 BasicCegarLoop]: Counterexample might be feasible [2021-06-05 00:36:39,622 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2021-06-05 00:36:39,624 INFO L246 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-06-05 00:36:39,701 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.06 12:36:39 BasicIcfg [2021-06-05 00:36:39,701 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-06-05 00:36:39,702 INFO L168 Benchmark]: Toolchain (without parser) took 97599.00 ms. Allocated memory was 358.6 MB in the beginning and 1.4 GB in the end (delta: 1.1 GB). Free memory was 318.6 MB in the beginning and 669.4 MB in the end (delta: -350.9 MB). Peak memory consumption was 706.6 MB. Max. memory is 16.0 GB. [2021-06-05 00:36:39,702 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 358.6 MB. Free memory is still 338.6 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-06-05 00:36:39,702 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1137.19 ms. Allocated memory is still 358.6 MB. Free memory was 318.4 MB in the beginning and 303.9 MB in the end (delta: 14.5 MB). Peak memory consumption was 76.9 MB. Max. memory is 16.0 GB. [2021-06-05 00:36:39,702 INFO L168 Benchmark]: Boogie Procedure Inliner took 50.96 ms. Allocated memory is still 358.6 MB. Free memory was 303.9 MB in the beginning and 299.7 MB in the end (delta: 4.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-06-05 00:36:39,702 INFO L168 Benchmark]: Boogie Preprocessor took 31.78 ms. Allocated memory is still 358.6 MB. Free memory was 299.7 MB in the beginning and 297.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-06-05 00:36:39,702 INFO L168 Benchmark]: RCFGBuilder took 643.64 ms. Allocated memory is still 358.6 MB. Free memory was 297.6 MB in the beginning and 248.3 MB in the end (delta: 49.3 MB). Peak memory consumption was 50.3 MB. Max. memory is 16.0 GB. [2021-06-05 00:36:39,702 INFO L168 Benchmark]: TraceAbstraction took 95729.54 ms. Allocated memory was 358.6 MB in the beginning and 1.4 GB in the end (delta: 1.1 GB). Free memory was 248.3 MB in the beginning and 669.4 MB in the end (delta: -421.1 MB). Peak memory consumption was 634.8 MB. Max. memory is 16.0 GB. [2021-06-05 00:36:39,703 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.17 ms. Allocated memory is still 358.6 MB. Free memory is still 338.6 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 1137.19 ms. Allocated memory is still 358.6 MB. Free memory was 318.4 MB in the beginning and 303.9 MB in the end (delta: 14.5 MB). Peak memory consumption was 76.9 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 50.96 ms. Allocated memory is still 358.6 MB. Free memory was 303.9 MB in the beginning and 299.7 MB in the end (delta: 4.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 31.78 ms. Allocated memory is still 358.6 MB. Free memory was 299.7 MB in the beginning and 297.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 643.64 ms. Allocated memory is still 358.6 MB. Free memory was 297.6 MB in the beginning and 248.3 MB in the end (delta: 49.3 MB). Peak memory consumption was 50.3 MB. Max. memory is 16.0 GB. * TraceAbstraction took 95729.54 ms. Allocated memory was 358.6 MB in the beginning and 1.4 GB in the end (delta: 1.1 GB). Free memory was 248.3 MB in the beginning and 669.4 MB in the end (delta: -421.1 MB). Peak memory consumption was 634.8 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1675]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L1676] 0 pthread_t t1,t2; VAL [t1={7:0}, t2={8:0}] [L1688] 0 struct device *my_dev; VAL [my_dev={0:0}, t1={7:0}, t2={8:0}] [L1727] 0 return 0; VAL [my_dev={0:0}, t1={7:0}, t2={8:0}] [L1733] 0 int ret = my_drv_init(); VAL [my_dev={0:0}, t1={7:0}, t2={8:0}] [L1734] COND TRUE 0 ret==0 VAL [my_dev={0:0}, t1={7:0}, t2={8:0}] [L1735] 0 int probe_ret; VAL [my_dev={0:0}, t1={7:0}, t2={8:0}] [L1736] 0 struct my_data data; VAL [my_dev={0:0}, t1={7:0}, t2={8:0}] [L1705] 0 data->shared.a = 0 VAL [my_dev={0:0}, t1={7:0}, t2={8:0}] [L1706] 0 data->shared.b = 0 VAL [my_dev={0:0}, t1={7:0}, t2={8:0}] [L1707] 0 data->shared.a VAL [my_dev={0:0}, t1={7:0}, t2={8:0}] [L1675] COND FALSE 0 !(!expression) VAL [my_dev={0:0}, t1={7:0}, t2={8:0}] [L1708] 0 data->shared.b VAL [my_dev={0:0}, t1={7:0}, t2={8:0}] [L1675] COND FALSE 0 !(!expression) VAL [my_dev={0:0}, t1={7:0}, t2={8:0}] [L1709] 0 int res = __VERIFIER_nondet_int(); VAL [my_dev={0:0}, t1={7:0}, t2={8:0}] [L1710] COND FALSE 0 !(\read(res)) VAL [my_dev={0:0}, t1={7:0}, t2={8:0}] [L1712] 0 my_dev = &data->dev VAL [my_dev={9:24}, t1={7:0}, t2={8:0}] [L1713] FCALL, FORK 0 pthread_create(&t1, ((void *)0), my_callback, ((void *)0)) VAL [arg={0:0}, my_dev={9:24}, t1={7:0}, t2={8:0}] [L1690] 1 struct my_data *data; VAL [arg={0:0}, arg={0:0}, my_dev={9:24}, t1={7:0}, t2={8:0}] [L1714] FCALL, FORK 0 pthread_create(&t2, ((void *)0), my_callback, ((void *)0)) VAL [arg={0:0}, arg={0:0}, my_dev={9:24}, t1={7:0}, t2={8:0}] [L1690] 2 struct my_data *data; VAL [arg={0:0}, arg={0:0}, my_dev={9:24}, t1={7:0}, t2={8:0}] [L1691] 2 const typeof( ((struct my_data *)0)->dev ) *__mptr = (my_dev); VAL [__mptr={9:24}, arg={0:0}, arg={0:0}, my_dev={9:24}, t1={7:0}, t2={8:0}] [L1691] 2 data = ({ const typeof( ((struct my_data *)0)->dev ) *__mptr = (my_dev); (struct my_data *)( (char *)__mptr - ((unsigned long) &((struct my_data *)0)->dev) );}) VAL [__mptr={9:24}, arg={0:0}, arg={0:0}, data={9:0}, my_dev={9:24}, t1={7:0}, t2={8:0}] [L1693] 2 data->shared.a = 1 VAL [__mptr={9:24}, arg={0:0}, arg={0:0}, data={9:0}, my_dev={9:24}, t1={7:0}, t2={8:0}] [L1696] EXPR 2 data->shared.b [L1696] 2 int lb = data->shared.b; [L1715] 0 return 0; VAL [__mptr={9:24}, arg={0:0}, arg={0:0}, data={9:0}, lb=0, my_dev={9:24}, t1={7:0}, t2={8:0}] [L1737] 0 probe_ret = my_drv_probe(&data) VAL [__mptr={9:24}, arg={0:0}, arg={0:0}, data={9:0}, lb=0, my_dev={9:24}, t1={7:0}, t2={8:0}] [L1738] COND TRUE 0 probe_ret==0 VAL [__mptr={9:24}, arg={0:0}, arg={0:0}, data={9:0}, lb=0, my_dev={9:24}, t1={7:0}, t2={8:0}] [L1721] 0 void *status; VAL [__mptr={9:24}, arg={0:0}, arg={0:0}, data={9:0}, lb=0, my_dev={9:24}, t1={7:0}, t2={8:0}] [L1722] 0 \read(t1) VAL [__mptr={9:24}, arg={0:0}, arg={0:0}, data={9:0}, lb=0, my_dev={9:24}, t1={7:0}, t2={8:0}] [L1691] 1 const typeof( ((struct my_data *)0)->dev ) *__mptr = (my_dev); VAL [__mptr={9:24}, arg={0:0}, arg={0:0}, data={9:0}, lb=0, my_dev={9:24}, t1={7:0}, t2={8:0}] [L1691] 1 data = ({ const typeof( ((struct my_data *)0)->dev ) *__mptr = (my_dev); (struct my_data *)( (char *)__mptr - ((unsigned long) &((struct my_data *)0)->dev) );}) VAL [__mptr={9:24}, arg={0:0}, arg={0:0}, data={9:0}, lb=0, my_dev={9:24}, t1={7:0}, t2={8:0}] [L1693] 1 data->shared.a = 1 VAL [__mptr={9:24}, arg={0:0}, arg={0:0}, data={9:0}, lb=0, my_dev={9:24}, t1={7:0}, t2={8:0}] [L1696] EXPR 1 data->shared.b [L1696] 1 int lb = data->shared.b; [L1699] 1 data->shared.b = lb + 1 VAL [__mptr={9:24}, arg={0:0}, arg={0:0}, data={9:0}, lb=0, my_dev={9:24}, t1={7:0}, t2={8:0}] [L1701] 1 return 0; VAL [\result={0:0}, __mptr={9:24}, arg={0:0}, arg={0:0}, data={9:0}, lb=0, my_dev={9:24}, t1={7:0}, t2={8:0}] [L1699] 2 data->shared.b = lb + 1 VAL [\result={0:0}, __mptr={9:24}, arg={0:0}, arg={0:0}, data={9:0}, lb=0, my_dev={9:24}, t1={7:0}, t2={8:0}] [L1701] 2 return 0; VAL [\result={0:0}, __mptr={9:24}, arg={0:0}, arg={0:0}, data={9:0}, lb=0, my_dev={9:24}, t1={7:0}, t2={8:0}] [L1722] FCALL, JOIN 1 pthread_join(t1, &status) VAL [\result={0:0}, __mptr={9:24}, arg={0:0}, arg={0:0}, data={9:0}, lb=0, my_dev={9:24}, t1={7:0}, t2={8:0}] [L1723] 0 \read(t2) VAL [\result={0:0}, __mptr={9:24}, arg={0:0}, arg={0:0}, data={9:0}, lb=0, my_dev={9:24}, t1={7:0}, t2={8:0}] [L1723] FCALL, JOIN 2 pthread_join(t2, &status) VAL [\result={0:0}, __mptr={9:24}, arg={0:0}, arg={0:0}, data={9:0}, lb=0, my_dev={9:24}, t1={7:0}, t2={8:0}] [L1740] 0 data.shared.a VAL [\result={0:0}, __mptr={9:24}, arg={0:0}, arg={0:0}, data={9:0}, lb=0, my_dev={9:24}, t1={7:0}, t2={8:0}] [L1675] COND FALSE 0 !(!expression) VAL [\result={0:0}, __mptr={9:24}, arg={0:0}, arg={0:0}, data={9:0}, lb=0, my_dev={9:24}, t1={7:0}, t2={8:0}] [L1741] 0 data.shared.b VAL [\result={0:0}, __mptr={9:24}, arg={0:0}, arg={0:0}, data={9:0}, lb=0, my_dev={9:24}, t1={7:0}, t2={8:0}] [L1675] COND TRUE 0 !expression VAL [\result={0:0}, __mptr={9:24}, arg={0:0}, arg={0:0}, data={9:0}, lb=0, my_dev={9:24}, t1={7:0}, t2={8:0}] [L1675] 0 reach_error() VAL [\result={0:0}, __mptr={9:24}, arg={0:0}, arg={0:0}, data={9:0}, lb=0, my_dev={9:24}, t1={7:0}, t2={8:0}] - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 4 procedures, 164 locations, 8 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 95497.3ms, OverallIterations: 56, TraceHistogramMax: 1, EmptinessCheckTime: 256.9ms, AutomataDifference: 69144.2ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 220.6ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 10537 SDtfs, 33211 SDslu, 73828 SDs, 0 SdLazy, 36316 SolverSat, 3000 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 18359.8ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2040 GetRequests, 171 SyntacticMatches, 64 SemanticMatches, 1805 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10672 ImplicationChecksByTransitivity, 57917.2ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=4325occurred in iteration=4, InterpolantAutomatonStates: 1196, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 3125.6ms AutomataMinimizationTime, 55 MinimizatonAttempts, 63516 StatesRemovedByMinimization, 54 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 128.8ms SsaConstructionTime, 1114.9ms SatisfiabilityAnalysisTime, 20725.4ms InterpolantComputationTime, 5679 NumberOfCodeBlocks, 5679 NumberOfCodeBlocksAsserted, 56 NumberOfCheckSat, 5513 ConstructedInterpolants, 0 QuantifiedInterpolants, 77296 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 55 InterpolantComputations, 55 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...