/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-Separate.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-770125f [2021-05-21 23:52:57,838 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-05-21 23:52:57,840 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-05-21 23:52:57,908 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-05-21 23:52:57,909 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-05-21 23:52:57,911 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-05-21 23:52:57,914 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-05-21 23:52:57,919 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-05-21 23:52:57,921 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-05-21 23:52:57,925 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-05-21 23:52:57,928 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-05-21 23:52:57,930 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-05-21 23:52:57,930 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-05-21 23:52:57,932 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-05-21 23:52:57,945 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-05-21 23:52:57,947 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-05-21 23:52:57,949 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-05-21 23:52:57,950 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-05-21 23:52:57,952 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-05-21 23:52:57,957 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-05-21 23:52:57,958 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-05-21 23:52:57,959 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-05-21 23:52:57,960 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-05-21 23:52:57,962 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-05-21 23:52:57,967 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-05-21 23:52:57,968 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-05-21 23:52:57,968 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-05-21 23:52:57,979 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-05-21 23:52:57,979 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-05-21 23:52:57,980 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-05-21 23:52:57,980 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-05-21 23:52:57,981 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-05-21 23:52:57,982 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-05-21 23:52:57,983 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-05-21 23:52:57,983 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-05-21 23:52:57,984 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-05-21 23:52:57,984 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-05-21 23:52:57,984 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-05-21 23:52:57,984 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-05-21 23:52:57,985 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-05-21 23:52:57,986 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-05-21 23:52:57,989 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-Separate.epf [2021-05-21 23:52:58,054 INFO L113 SettingsManager]: Loading preferences was successful [2021-05-21 23:52:58,055 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-05-21 23:52:58,055 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-05-21 23:52:58,055 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-05-21 23:52:58,057 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-05-21 23:52:58,058 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-05-21 23:52:58,058 INFO L138 SettingsManager]: * Use SBE=true [2021-05-21 23:52:58,058 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-05-21 23:52:58,058 INFO L138 SettingsManager]: * sizeof long=4 [2021-05-21 23:52:58,058 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-05-21 23:52:58,059 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-05-21 23:52:58,059 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-05-21 23:52:58,059 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-05-21 23:52:58,059 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-05-21 23:52:58,059 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-05-21 23:52:58,060 INFO L138 SettingsManager]: * sizeof long double=12 [2021-05-21 23:52:58,060 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-05-21 23:52:58,060 INFO L138 SettingsManager]: * Use constant arrays=true [2021-05-21 23:52:58,060 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-05-21 23:52:58,060 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-05-21 23:52:58,060 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-05-21 23:52:58,060 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-05-21 23:52:58,060 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-05-21 23:52:58,061 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-05-21 23:52:58,061 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-05-21 23:52:58,061 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-05-21 23:52:58,061 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-05-21 23:52:58,061 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-05-21 23:52:58,061 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-05-21 23:52:58,061 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-05-21 23:52:58,061 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-05-21 23:52:58,061 INFO L138 SettingsManager]: * Check the insufficient thread errors last=true [2021-05-21 23:52:58,062 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-05-21 23:52:58,641 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-05-21 23:52:58,685 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-05-21 23:52:58,687 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-05-21 23:52:58,688 INFO L271 PluginConnector]: Initializing CDTParser... [2021-05-21 23:52:58,697 INFO L275 PluginConnector]: CDTParser initialized [2021-05-21 23:52:58,698 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-05-21 23:52:58,809 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/723309b54/4d0af41385af4c4d81eb43cf5406100e/FLAGa717941ba [2021-05-21 23:52:59,771 INFO L306 CDTParser]: Found 1 translation units. [2021-05-21 23:52:59,771 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-3_2-container_of-global.i [2021-05-21 23:52:59,827 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/723309b54/4d0af41385af4c4d81eb43cf5406100e/FLAGa717941ba [2021-05-21 23:53:00,292 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/723309b54/4d0af41385af4c4d81eb43cf5406100e [2021-05-21 23:53:00,294 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-05-21 23:53:00,295 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-05-21 23:53:00,296 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-05-21 23:53:00,296 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-05-21 23:53:00,316 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-05-21 23:53:00,316 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.05 11:53:00" (1/1) ... [2021-05-21 23:53:00,317 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1884ea48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.05 11:53:00, skipping insertion in model container [2021-05-21 23:53:00,317 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.05 11:53:00" (1/1) ... [2021-05-21 23:53:00,323 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-05-21 23:53:00,422 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-05-21 23:53:00,644 WARN L612 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2021-05-21 23:53:01,326 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-05-21 23:53:01,358 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-05-21 23:53:01,394 INFO L203 MainTranslator]: Completed pre-run [2021-05-21 23:53:01,426 WARN L612 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2021-05-21 23:53:01,488 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-05-21 23:53:01,514 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-05-21 23:53:01,854 INFO L208 MainTranslator]: Completed translation [2021-05-21 23:53:01,854 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.05 11:53:01 WrapperNode [2021-05-21 23:53:01,854 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-05-21 23:53:01,855 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-05-21 23:53:01,855 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-05-21 23:53:01,856 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-05-21 23:53:01,861 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.05 11:53:01" (1/1) ... [2021-05-21 23:53:01,904 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.05 11:53:01" (1/1) ... [2021-05-21 23:53:01,939 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-05-21 23:53:01,940 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-05-21 23:53:01,940 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-05-21 23:53:01,940 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-05-21 23:53:01,946 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.05 11:53:01" (1/1) ... [2021-05-21 23:53:01,946 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.05 11:53:01" (1/1) ... [2021-05-21 23:53:01,962 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.05 11:53:01" (1/1) ... [2021-05-21 23:53:01,963 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.05 11:53:01" (1/1) ... [2021-05-21 23:53:01,972 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.05 11:53:01" (1/1) ... [2021-05-21 23:53:01,974 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.05 11:53:01" (1/1) ... [2021-05-21 23:53:01,978 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.05 11:53:01" (1/1) ... [2021-05-21 23:53:01,983 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-05-21 23:53:01,984 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-05-21 23:53:01,984 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-05-21 23:53:01,984 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-05-21 23:53:01,985 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.05 11:53:01" (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-05-21 23:53:02,057 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-05-21 23:53:02,058 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-05-21 23:53:02,058 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-05-21 23:53:02,059 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-05-21 23:53:02,059 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-05-21 23:53:02,059 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-05-21 23:53:02,059 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-05-21 23:53:02,059 INFO L130 BoogieDeclarations]: Found specification of procedure my_callback [2021-05-21 23:53:02,059 INFO L138 BoogieDeclarations]: Found implementation of procedure my_callback [2021-05-21 23:53:02,059 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-05-21 23:53:02,059 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-05-21 23:53:02,059 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-05-21 23:53:02,061 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-05-21 23:53:02,612 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-05-21 23:53:02,612 INFO L299 CfgBuilder]: Removed 24 assume(true) statements. [2021-05-21 23:53:02,614 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.05 11:53:02 BoogieIcfgContainer [2021-05-21 23:53:02,614 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-05-21 23:53:02,615 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-05-21 23:53:02,615 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-05-21 23:53:02,618 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-05-21 23:53:02,618 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.05 11:53:00" (1/3) ... [2021-05-21 23:53:02,618 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@86d27eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.05 11:53:02, skipping insertion in model container [2021-05-21 23:53:02,619 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.05 11:53:01" (2/3) ... [2021-05-21 23:53:02,619 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@86d27eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.05 11:53:02, skipping insertion in model container [2021-05-21 23:53:02,619 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.05 11:53:02" (3/3) ... [2021-05-21 23:53:02,625 INFO L111 eAbstractionObserver]: Analyzing ICFG race-3_2-container_of-global.i [2021-05-21 23:53:02,630 WARN L148 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-05-21 23:53:02,630 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-05-21 23:53:02,631 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2021-05-21 23:53:02,631 INFO L478 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-05-21 23:53:02,673 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 23:53:02,673 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 23:53:02,673 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 23:53:02,673 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 23:53:02,673 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 23:53:02,673 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 23:53:02,673 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 23:53:02,673 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 23:53:02,674 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 23:53:02,674 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 23:53:02,674 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 23:53:02,674 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 23:53:02,674 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 23:53:02,674 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 23:53:02,674 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 23:53:02,674 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 23:53:02,675 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 23:53:02,675 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 23:53:02,675 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 23:53:02,675 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 23:53:02,675 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 23:53:02,675 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 23:53:02,675 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 23:53:02,675 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 23:53:02,675 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 23:53:02,675 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 23:53:02,675 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 23:53:02,676 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 23:53:02,676 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 23:53:02,676 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 23:53:02,676 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 23:53:02,676 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~lb~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 23:53:02,676 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 23:53:02,676 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 23:53:02,676 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 23:53:02,677 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~lb~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 23:53:02,677 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 23:53:02,677 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 23:53:02,677 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~lb~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 23:53:02,677 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 23:53:02,677 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 23:53:02,677 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~lb~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 23:53:02,678 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 23:53:02,678 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 23:53:02,678 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 23:53:02,678 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 23:53:02,678 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 23:53:02,678 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 23:53:02,678 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 23:53:02,678 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 23:53:02,679 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 23:53:02,679 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 23:53:02,679 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 23:53:02,679 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 23:53:02,679 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 23:53:02,679 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 23:53:02,679 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 23:53:02,679 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 23:53:02,679 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 23:53:02,680 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 23:53:02,680 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 23:53:02,680 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 23:53:02,680 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 23:53:02,680 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 23:53:02,680 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 23:53:02,680 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 23:53:02,680 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 23:53:02,680 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 23:53:02,681 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 23:53:02,681 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 23:53:02,681 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 23:53:02,682 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 23:53:02,682 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 23:53:02,682 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 23:53:02,682 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 23:53:02,682 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 23:53:02,682 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 23:53:02,682 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~lb~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 23:53:02,683 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 23:53:02,683 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 23:53:02,683 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 23:53:02,683 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~lb~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 23:53:02,683 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 23:53:02,683 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 23:53:02,683 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~lb~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 23:53:02,684 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 23:53:02,684 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 23:53:02,684 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~lb~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 23:53:02,684 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 23:53:02,684 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 23:53:02,684 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 23:53:02,684 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 23:53:02,686 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 23:53:02,686 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 23:53:02,687 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 23:53:02,687 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 23:53:02,687 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~lb~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 23:53:02,687 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 23:53:02,687 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 23:53:02,687 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 23:53:02,687 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 23:53:02,687 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 23:53:02,690 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 23:53:02,690 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 23:53:02,690 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 23:53:02,690 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 23:53:02,690 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 23:53:02,690 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~lb~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 23:53:02,691 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 23:53:02,691 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 23:53:02,691 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 23:53:02,691 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-21 23:53:02,715 INFO L149 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2021-05-21 23:53:02,735 INFO L255 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-05-21 23:53:02,751 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-05-21 23:53:02,751 INFO L379 AbstractCegarLoop]: Hoare is false [2021-05-21 23:53:02,751 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-05-21 23:53:02,751 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-05-21 23:53:02,751 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-05-21 23:53:02,752 INFO L383 AbstractCegarLoop]: Difference is false [2021-05-21 23:53:02,752 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-05-21 23:53:02,752 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-05-21 23:53:02,763 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 158 places, 162 transitions, 346 flow [2021-05-21 23:53:02,905 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-05-21 23:53:02,918 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-05-21 23:53:02,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-05-21 23:53:02,924 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 23:53:02,924 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-05-21 23:53:02,925 INFO L430 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-21 23:53:02,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 23:53:02,928 INFO L82 PathProgramCache]: Analyzing trace with hash -1369970770, now seen corresponding path program 1 times [2021-05-21 23:53:02,935 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 23:53:02,936 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369261072] [2021-05-21 23:53:02,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 23:53:03,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 23:53:03,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-21 23:53:03,374 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 23:53:03,374 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369261072] [2021-05-21 23:53:03,374 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369261072] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 23:53:03,375 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 23:53:03,375 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-21 23:53:03,375 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279960888] [2021-05-21 23:53:03,379 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-21 23:53:03,379 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 23:53:03,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-21 23:53:03,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-05-21 23:53:03,403 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-05-21 23:53:03,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 23:53:03,667 INFO L93 Difference]: Finished difference Result 4075 states and 10961 transitions. [2021-05-21 23:53:03,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-05-21 23:53:03,669 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-05-21 23:53:03,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 23:53:03,702 INFO L225 Difference]: With dead ends: 4075 [2021-05-21 23:53:03,702 INFO L226 Difference]: Without dead ends: 3358 [2021-05-21 23:53:03,703 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 90.8ms TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-05-21 23:53:03,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3358 states. [2021-05-21 23:53:03,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3358 to 3357. [2021-05-21 23:53:03,876 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-05-21 23:53:03,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3357 states to 3357 states and 8983 transitions. [2021-05-21 23:53:03,891 INFO L78 Accepts]: Start accepts. Automaton has 3357 states and 8983 transitions. Word has length 36 [2021-05-21 23:53:03,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 23:53:03,892 INFO L482 AbstractCegarLoop]: Abstraction has 3357 states and 8983 transitions. [2021-05-21 23:53:03,893 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-05-21 23:53:03,893 INFO L276 IsEmpty]: Start isEmpty. Operand 3357 states and 8983 transitions. [2021-05-21 23:53:03,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-05-21 23:53:03,894 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 23:53:03,894 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-05-21 23:53:03,894 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-05-21 23:53:03,894 INFO L430 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-21 23:53:03,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 23:53:03,898 INFO L82 PathProgramCache]: Analyzing trace with hash -1499060535, now seen corresponding path program 1 times [2021-05-21 23:53:03,898 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 23:53:03,898 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781178840] [2021-05-21 23:53:03,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 23:53:03,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 23:53:04,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-21 23:53:04,049 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 23:53:04,049 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781178840] [2021-05-21 23:53:04,049 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781178840] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 23:53:04,049 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 23:53:04,050 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-21 23:53:04,050 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668163775] [2021-05-21 23:53:04,051 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-21 23:53:04,051 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 23:53:04,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-21 23:53:04,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-05-21 23:53:04,052 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-05-21 23:53:04,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 23:53:04,221 INFO L93 Difference]: Finished difference Result 3359 states and 8985 transitions. [2021-05-21 23:53:04,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-05-21 23:53:04,221 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-05-21 23:53:04,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 23:53:04,235 INFO L225 Difference]: With dead ends: 3359 [2021-05-21 23:53:04,235 INFO L226 Difference]: Without dead ends: 3359 [2021-05-21 23:53:04,236 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 74.8ms TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2021-05-21 23:53:04,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3359 states. [2021-05-21 23:53:04,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3359 to 3355. [2021-05-21 23:53:04,327 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-05-21 23:53:04,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3355 states to 3355 states and 8981 transitions. [2021-05-21 23:53:04,341 INFO L78 Accepts]: Start accepts. Automaton has 3355 states and 8981 transitions. Word has length 42 [2021-05-21 23:53:04,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 23:53:04,341 INFO L482 AbstractCegarLoop]: Abstraction has 3355 states and 8981 transitions. [2021-05-21 23:53:04,341 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-05-21 23:53:04,342 INFO L276 IsEmpty]: Start isEmpty. Operand 3355 states and 8981 transitions. [2021-05-21 23:53:04,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-05-21 23:53:04,343 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 23:53:04,343 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-05-21 23:53:04,343 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-05-21 23:53:04,343 INFO L430 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-21 23:53:04,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 23:53:04,344 INFO L82 PathProgramCache]: Analyzing trace with hash 709377487, now seen corresponding path program 1 times [2021-05-21 23:53:04,344 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 23:53:04,344 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855509615] [2021-05-21 23:53:04,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 23:53:04,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 23:53:04,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-21 23:53:04,524 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 23:53:04,524 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855509615] [2021-05-21 23:53:04,524 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [855509615] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 23:53:04,524 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 23:53:04,524 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-21 23:53:04,525 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753778899] [2021-05-21 23:53:04,526 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-21 23:53:04,526 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 23:53:04,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-21 23:53:04,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-05-21 23:53:04,530 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-05-21 23:53:04,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 23:53:04,871 INFO L93 Difference]: Finished difference Result 4878 states and 13059 transitions. [2021-05-21 23:53:04,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-05-21 23:53:04,871 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-05-21 23:53:04,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 23:53:04,895 INFO L225 Difference]: With dead ends: 4878 [2021-05-21 23:53:04,895 INFO L226 Difference]: Without dead ends: 4878 [2021-05-21 23:53:04,896 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 121.3ms TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2021-05-21 23:53:04,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4878 states. [2021-05-21 23:53:04,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4878 to 3753. [2021-05-21 23:53:05,005 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-05-21 23:53:05,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3753 states to 3753 states and 10059 transitions. [2021-05-21 23:53:05,020 INFO L78 Accepts]: Start accepts. Automaton has 3753 states and 10059 transitions. Word has length 60 [2021-05-21 23:53:05,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 23:53:05,020 INFO L482 AbstractCegarLoop]: Abstraction has 3753 states and 10059 transitions. [2021-05-21 23:53:05,021 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-05-21 23:53:05,021 INFO L276 IsEmpty]: Start isEmpty. Operand 3753 states and 10059 transitions. [2021-05-21 23:53:05,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-05-21 23:53:05,023 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 23:53:05,023 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-05-21 23:53:05,023 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-05-21 23:53:05,023 INFO L430 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-21 23:53:05,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 23:53:05,024 INFO L82 PathProgramCache]: Analyzing trace with hash -1924610094, now seen corresponding path program 1 times [2021-05-21 23:53:05,024 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 23:53:05,024 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213636249] [2021-05-21 23:53:05,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 23:53:05,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 23:53:05,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-21 23:53:05,160 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 23:53:05,160 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213636249] [2021-05-21 23:53:05,160 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213636249] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 23:53:05,161 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 23:53:05,161 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-21 23:53:05,161 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972974405] [2021-05-21 23:53:05,161 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-21 23:53:05,161 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 23:53:05,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-21 23:53:05,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-05-21 23:53:05,165 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-05-21 23:53:05,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 23:53:05,440 INFO L93 Difference]: Finished difference Result 5276 states and 14062 transitions. [2021-05-21 23:53:05,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-05-21 23:53:05,441 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-05-21 23:53:05,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 23:53:05,460 INFO L225 Difference]: With dead ends: 5276 [2021-05-21 23:53:05,461 INFO L226 Difference]: Without dead ends: 4475 [2021-05-21 23:53:05,461 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 75.7ms TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2021-05-21 23:53:05,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4475 states. [2021-05-21 23:53:05,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4475 to 4325. [2021-05-21 23:53:05,599 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-05-21 23:53:05,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4325 states to 4325 states and 11637 transitions. [2021-05-21 23:53:05,614 INFO L78 Accepts]: Start accepts. Automaton has 4325 states and 11637 transitions. Word has length 66 [2021-05-21 23:53:05,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 23:53:05,615 INFO L482 AbstractCegarLoop]: Abstraction has 4325 states and 11637 transitions. [2021-05-21 23:53:05,615 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-05-21 23:53:05,615 INFO L276 IsEmpty]: Start isEmpty. Operand 4325 states and 11637 transitions. [2021-05-21 23:53:05,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-05-21 23:53:05,626 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 23:53:05,626 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-05-21 23:53:05,626 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-05-21 23:53:05,626 INFO L430 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-21 23:53:05,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 23:53:05,627 INFO L82 PathProgramCache]: Analyzing trace with hash -1721881747, now seen corresponding path program 1 times [2021-05-21 23:53:05,627 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 23:53:05,627 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619044958] [2021-05-21 23:53:05,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 23:53:05,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 23:53:05,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-21 23:53:05,739 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 23:53:05,739 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619044958] [2021-05-21 23:53:05,739 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619044958] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 23:53:05,739 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 23:53:05,739 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-21 23:53:05,739 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325672258] [2021-05-21 23:53:05,740 INFO L462 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-21 23:53:05,740 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 23:53:05,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-21 23:53:05,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-05-21 23:53:05,742 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-05-21 23:53:05,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 23:53:05,783 INFO L93 Difference]: Finished difference Result 1631 states and 4196 transitions. [2021-05-21 23:53:05,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-05-21 23:53:05,783 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-05-21 23:53:05,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 23:53:05,799 INFO L225 Difference]: With dead ends: 1631 [2021-05-21 23:53:05,799 INFO L226 Difference]: Without dead ends: 1631 [2021-05-21 23:53:05,804 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 30.2ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-05-21 23:53:05,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1631 states. [2021-05-21 23:53:05,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1631 to 1631. [2021-05-21 23:53:05,842 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-05-21 23:53:05,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1631 states to 1631 states and 4196 transitions. [2021-05-21 23:53:05,847 INFO L78 Accepts]: Start accepts. Automaton has 1631 states and 4196 transitions. Word has length 78 [2021-05-21 23:53:05,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 23:53:05,848 INFO L482 AbstractCegarLoop]: Abstraction has 1631 states and 4196 transitions. [2021-05-21 23:53:05,848 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-05-21 23:53:05,848 INFO L276 IsEmpty]: Start isEmpty. Operand 1631 states and 4196 transitions. [2021-05-21 23:53:05,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-05-21 23:53:05,852 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 23:53:05,853 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-05-21 23:53:05,853 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-05-21 23:53:05,853 INFO L430 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-21 23:53:05,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 23:53:05,853 INFO L82 PathProgramCache]: Analyzing trace with hash 648694468, now seen corresponding path program 1 times [2021-05-21 23:53:05,854 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 23:53:05,854 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805177763] [2021-05-21 23:53:05,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 23:53:05,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 23:53:06,958 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-21 23:53:06,959 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 23:53:06,959 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805177763] [2021-05-21 23:53:06,959 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805177763] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 23:53:06,959 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 23:53:06,959 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2021-05-21 23:53:06,959 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814664078] [2021-05-21 23:53:06,959 INFO L462 AbstractCegarLoop]: Interpolant automaton has 21 states [2021-05-21 23:53:06,959 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 23:53:06,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-05-21 23:53:06,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=357, Unknown=0, NotChecked=0, Total=420 [2021-05-21 23:53:06,960 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-05-21 23:53:09,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 23:53:09,421 INFO L93 Difference]: Finished difference Result 2436 states and 6209 transitions. [2021-05-21 23:53:09,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-05-21 23:53:09,422 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-05-21 23:53:09,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 23:53:09,431 INFO L225 Difference]: With dead ends: 2436 [2021-05-21 23:53:09,431 INFO L226 Difference]: Without dead ends: 2409 [2021-05-21 23:53:09,432 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 338 ImplicationChecksByTransitivity, 1942.7ms TimeCoverageRelationStatistics Valid=506, Invalid=1750, Unknown=0, NotChecked=0, Total=2256 [2021-05-21 23:53:09,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2409 states. [2021-05-21 23:53:09,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2409 to 2339. [2021-05-21 23:53:09,475 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-05-21 23:53:09,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2339 states to 2339 states and 6061 transitions. [2021-05-21 23:53:09,482 INFO L78 Accepts]: Start accepts. Automaton has 2339 states and 6061 transitions. Word has length 105 [2021-05-21 23:53:09,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 23:53:09,483 INFO L482 AbstractCegarLoop]: Abstraction has 2339 states and 6061 transitions. [2021-05-21 23:53:09,483 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-05-21 23:53:09,483 INFO L276 IsEmpty]: Start isEmpty. Operand 2339 states and 6061 transitions. [2021-05-21 23:53:09,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-05-21 23:53:09,488 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 23:53:09,488 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-05-21 23:53:09,488 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-05-21 23:53:09,488 INFO L430 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-21 23:53:09,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 23:53:09,489 INFO L82 PathProgramCache]: Analyzing trace with hash -1718444628, now seen corresponding path program 2 times [2021-05-21 23:53:09,489 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 23:53:09,489 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389315865] [2021-05-21 23:53:09,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 23:53:09,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 23:53:10,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-21 23:53:10,008 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 23:53:10,008 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389315865] [2021-05-21 23:53:10,008 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389315865] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 23:53:10,009 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 23:53:10,009 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2021-05-21 23:53:10,009 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985262524] [2021-05-21 23:53:10,009 INFO L462 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-05-21 23:53:10,009 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 23:53:10,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-05-21 23:53:10,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2021-05-21 23:53:10,010 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-05-21 23:53:11,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 23:53:11,221 INFO L93 Difference]: Finished difference Result 2399 states and 6173 transitions. [2021-05-21 23:53:11,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-05-21 23:53:11,221 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-05-21 23:53:11,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 23:53:11,230 INFO L225 Difference]: With dead ends: 2399 [2021-05-21 23:53:11,230 INFO L226 Difference]: Without dead ends: 2399 [2021-05-21 23:53:11,231 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 957.6ms TimeCoverageRelationStatistics Valid=369, Invalid=1037, Unknown=0, NotChecked=0, Total=1406 [2021-05-21 23:53:11,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2399 states. [2021-05-21 23:53:11,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2399 to 2339. [2021-05-21 23:53:11,305 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-05-21 23:53:11,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2339 states to 2339 states and 6059 transitions. [2021-05-21 23:53:11,312 INFO L78 Accepts]: Start accepts. Automaton has 2339 states and 6059 transitions. Word has length 105 [2021-05-21 23:53:11,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 23:53:11,312 INFO L482 AbstractCegarLoop]: Abstraction has 2339 states and 6059 transitions. [2021-05-21 23:53:11,313 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-05-21 23:53:11,313 INFO L276 IsEmpty]: Start isEmpty. Operand 2339 states and 6059 transitions. [2021-05-21 23:53:11,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-05-21 23:53:11,318 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 23:53:11,318 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-05-21 23:53:11,319 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-05-21 23:53:11,319 INFO L430 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-21 23:53:11,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 23:53:11,320 INFO L82 PathProgramCache]: Analyzing trace with hash 1294904632, now seen corresponding path program 1 times [2021-05-21 23:53:11,320 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 23:53:11,322 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668985718] [2021-05-21 23:53:11,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 23:53:11,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 23:53:11,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-21 23:53:11,961 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 23:53:11,962 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668985718] [2021-05-21 23:53:11,962 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668985718] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 23:53:11,962 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 23:53:11,962 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2021-05-21 23:53:11,962 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318209695] [2021-05-21 23:53:11,962 INFO L462 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-05-21 23:53:11,962 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 23:53:11,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-05-21 23:53:11,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=323, Unknown=0, NotChecked=0, Total=380 [2021-05-21 23:53:11,963 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-05-21 23:53:13,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 23:53:13,352 INFO L93 Difference]: Finished difference Result 2979 states and 7410 transitions. [2021-05-21 23:53:13,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-05-21 23:53:13,353 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-05-21 23:53:13,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 23:53:13,359 INFO L225 Difference]: With dead ends: 2979 [2021-05-21 23:53:13,359 INFO L226 Difference]: Without dead ends: 2979 [2021-05-21 23:53:13,360 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 1031.3ms TimeCoverageRelationStatistics Valid=282, Invalid=840, Unknown=0, NotChecked=0, Total=1122 [2021-05-21 23:53:13,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2979 states. [2021-05-21 23:53:13,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2979 to 2719. [2021-05-21 23:53:13,412 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-05-21 23:53:13,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2719 states to 2719 states and 6907 transitions. [2021-05-21 23:53:13,420 INFO L78 Accepts]: Start accepts. Automaton has 2719 states and 6907 transitions. Word has length 105 [2021-05-21 23:53:13,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 23:53:13,420 INFO L482 AbstractCegarLoop]: Abstraction has 2719 states and 6907 transitions. [2021-05-21 23:53:13,420 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-05-21 23:53:13,420 INFO L276 IsEmpty]: Start isEmpty. Operand 2719 states and 6907 transitions. [2021-05-21 23:53:13,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-05-21 23:53:13,425 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 23:53:13,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-05-21 23:53:13,426 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-05-21 23:53:13,426 INFO L430 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-21 23:53:13,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 23:53:13,426 INFO L82 PathProgramCache]: Analyzing trace with hash -564509166, now seen corresponding path program 3 times [2021-05-21 23:53:13,427 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 23:53:13,427 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775562635] [2021-05-21 23:53:13,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 23:53:13,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 23:53:14,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-21 23:53:14,130 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 23:53:14,130 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775562635] [2021-05-21 23:53:14,130 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775562635] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 23:53:14,130 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 23:53:14,130 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2021-05-21 23:53:14,131 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512499938] [2021-05-21 23:53:14,131 INFO L462 AbstractCegarLoop]: Interpolant automaton has 21 states [2021-05-21 23:53:14,131 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 23:53:14,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-05-21 23:53:14,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=326, Unknown=0, NotChecked=0, Total=420 [2021-05-21 23:53:14,132 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-05-21 23:53:16,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 23:53:16,662 INFO L93 Difference]: Finished difference Result 4261 states and 10631 transitions. [2021-05-21 23:53:16,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2021-05-21 23:53:16,663 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-05-21 23:53:16,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 23:53:16,670 INFO L225 Difference]: With dead ends: 4261 [2021-05-21 23:53:16,670 INFO L226 Difference]: Without dead ends: 4211 [2021-05-21 23:53:16,671 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 3 SyntacticMatches, 4 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 724 ImplicationChecksByTransitivity, 2040.7ms TimeCoverageRelationStatistics Valid=897, Invalid=2885, Unknown=0, NotChecked=0, Total=3782 [2021-05-21 23:53:16,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4211 states. [2021-05-21 23:53:16,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4211 to 3403. [2021-05-21 23:53:16,738 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-05-21 23:53:16,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3403 states to 3403 states and 8829 transitions. [2021-05-21 23:53:16,747 INFO L78 Accepts]: Start accepts. Automaton has 3403 states and 8829 transitions. Word has length 105 [2021-05-21 23:53:16,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 23:53:16,747 INFO L482 AbstractCegarLoop]: Abstraction has 3403 states and 8829 transitions. [2021-05-21 23:53:16,747 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-05-21 23:53:16,747 INFO L276 IsEmpty]: Start isEmpty. Operand 3403 states and 8829 transitions. [2021-05-21 23:53:16,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-05-21 23:53:16,754 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 23:53:16,754 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-05-21 23:53:16,754 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-05-21 23:53:16,754 INFO L430 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-21 23:53:16,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 23:53:16,754 INFO L82 PathProgramCache]: Analyzing trace with hash 659717812, now seen corresponding path program 2 times [2021-05-21 23:53:16,755 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 23:53:16,755 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227932180] [2021-05-21 23:53:16,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 23:53:16,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 23:53:17,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-21 23:53:17,079 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 23:53:17,080 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227932180] [2021-05-21 23:53:17,080 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227932180] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 23:53:17,080 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 23:53:17,080 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-05-21 23:53:17,080 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885405130] [2021-05-21 23:53:17,081 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-05-21 23:53:17,081 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 23:53:17,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-05-21 23:53:17,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2021-05-21 23:53:17,081 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-05-21 23:53:17,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 23:53:17,756 INFO L93 Difference]: Finished difference Result 4878 states and 12398 transitions. [2021-05-21 23:53:17,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-05-21 23:53:17,756 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-05-21 23:53:17,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 23:53:17,768 INFO L225 Difference]: With dead ends: 4878 [2021-05-21 23:53:17,769 INFO L226 Difference]: Without dead ends: 4878 [2021-05-21 23:53:17,769 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 510.6ms TimeCoverageRelationStatistics Valid=213, Invalid=489, Unknown=0, NotChecked=0, Total=702 [2021-05-21 23:53:17,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4878 states. [2021-05-21 23:53:17,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4878 to 3569. [2021-05-21 23:53:17,845 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-05-21 23:53:17,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3569 states to 3569 states and 9259 transitions. [2021-05-21 23:53:17,853 INFO L78 Accepts]: Start accepts. Automaton has 3569 states and 9259 transitions. Word has length 105 [2021-05-21 23:53:17,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 23:53:17,853 INFO L482 AbstractCegarLoop]: Abstraction has 3569 states and 9259 transitions. [2021-05-21 23:53:17,854 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-05-21 23:53:17,854 INFO L276 IsEmpty]: Start isEmpty. Operand 3569 states and 9259 transitions. [2021-05-21 23:53:17,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-05-21 23:53:17,861 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 23:53:17,861 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-05-21 23:53:17,861 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-05-21 23:53:17,861 INFO L430 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-21 23:53:17,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 23:53:17,861 INFO L82 PathProgramCache]: Analyzing trace with hash 205708624, now seen corresponding path program 3 times [2021-05-21 23:53:17,862 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 23:53:17,862 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764159494] [2021-05-21 23:53:17,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 23:53:17,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 23:53:18,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-21 23:53:18,181 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 23:53:18,181 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764159494] [2021-05-21 23:53:18,181 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764159494] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 23:53:18,182 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 23:53:18,182 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-05-21 23:53:18,182 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683732215] [2021-05-21 23:53:18,182 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-05-21 23:53:18,182 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 23:53:18,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-05-21 23:53:18,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2021-05-21 23:53:18,184 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-05-21 23:53:18,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 23:53:18,891 INFO L93 Difference]: Finished difference Result 5217 states and 13022 transitions. [2021-05-21 23:53:18,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-05-21 23:53:18,891 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-05-21 23:53:18,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 23:53:18,898 INFO L225 Difference]: With dead ends: 5217 [2021-05-21 23:53:18,898 INFO L226 Difference]: Without dead ends: 5217 [2021-05-21 23:53:18,898 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 525.8ms TimeCoverageRelationStatistics Valid=232, Invalid=580, Unknown=0, NotChecked=0, Total=812 [2021-05-21 23:53:18,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5217 states. [2021-05-21 23:53:18,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5217 to 3593. [2021-05-21 23:53:18,964 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-05-21 23:53:18,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3593 states to 3593 states and 9323 transitions. [2021-05-21 23:53:18,972 INFO L78 Accepts]: Start accepts. Automaton has 3593 states and 9323 transitions. Word has length 105 [2021-05-21 23:53:18,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 23:53:18,972 INFO L482 AbstractCegarLoop]: Abstraction has 3593 states and 9323 transitions. [2021-05-21 23:53:18,972 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-05-21 23:53:18,972 INFO L276 IsEmpty]: Start isEmpty. Operand 3593 states and 9323 transitions. [2021-05-21 23:53:18,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-05-21 23:53:18,979 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 23:53:18,980 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-05-21 23:53:18,980 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-05-21 23:53:18,980 INFO L430 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-21 23:53:18,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 23:53:18,980 INFO L82 PathProgramCache]: Analyzing trace with hash 549020954, now seen corresponding path program 4 times [2021-05-21 23:53:18,980 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 23:53:18,981 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222371550] [2021-05-21 23:53:18,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 23:53:19,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 23:53:19,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-21 23:53:19,507 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 23:53:19,508 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222371550] [2021-05-21 23:53:19,508 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222371550] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 23:53:19,508 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 23:53:19,508 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2021-05-21 23:53:19,508 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982762242] [2021-05-21 23:53:19,509 INFO L462 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-05-21 23:53:19,509 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 23:53:19,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-05-21 23:53:19,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=323, Unknown=0, NotChecked=0, Total=380 [2021-05-21 23:53:19,509 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-05-21 23:53:21,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 23:53:21,227 INFO L93 Difference]: Finished difference Result 4729 states and 11919 transitions. [2021-05-21 23:53:21,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-05-21 23:53:21,228 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-05-21 23:53:21,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 23:53:21,235 INFO L225 Difference]: With dead ends: 4729 [2021-05-21 23:53:21,235 INFO L226 Difference]: Without dead ends: 4729 [2021-05-21 23:53:21,235 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 237 ImplicationChecksByTransitivity, 1474.8ms TimeCoverageRelationStatistics Valid=417, Invalid=1143, Unknown=0, NotChecked=0, Total=1560 [2021-05-21 23:53:21,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4729 states. [2021-05-21 23:53:21,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4729 to 3653. [2021-05-21 23:53:21,297 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-05-21 23:53:21,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3653 states to 3653 states and 9491 transitions. [2021-05-21 23:53:21,305 INFO L78 Accepts]: Start accepts. Automaton has 3653 states and 9491 transitions. Word has length 105 [2021-05-21 23:53:21,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 23:53:21,306 INFO L482 AbstractCegarLoop]: Abstraction has 3653 states and 9491 transitions. [2021-05-21 23:53:21,306 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-05-21 23:53:21,306 INFO L276 IsEmpty]: Start isEmpty. Operand 3653 states and 9491 transitions. [2021-05-21 23:53:21,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-05-21 23:53:21,313 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 23:53:21,313 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-05-21 23:53:21,313 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-05-21 23:53:21,313 INFO L430 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-21 23:53:21,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 23:53:21,313 INFO L82 PathProgramCache]: Analyzing trace with hash -845299678, now seen corresponding path program 5 times [2021-05-21 23:53:21,313 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 23:53:21,314 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107726747] [2021-05-21 23:53:21,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 23:53:21,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 23:53:21,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-21 23:53:21,752 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 23:53:21,752 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107726747] [2021-05-21 23:53:21,752 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107726747] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 23:53:21,753 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 23:53:21,753 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-05-21 23:53:21,753 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484629614] [2021-05-21 23:53:21,753 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-05-21 23:53:21,753 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 23:53:21,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-05-21 23:53:21,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2021-05-21 23:53:21,754 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-05-21 23:53:23,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 23:53:23,006 INFO L93 Difference]: Finished difference Result 4795 states and 12232 transitions. [2021-05-21 23:53:23,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-05-21 23:53:23,007 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-05-21 23:53:23,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 23:53:23,013 INFO L225 Difference]: With dead ends: 4795 [2021-05-21 23:53:23,014 INFO L226 Difference]: Without dead ends: 4795 [2021-05-21 23:53:23,014 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 1065.3ms TimeCoverageRelationStatistics Valid=279, Invalid=713, Unknown=0, NotChecked=0, Total=992 [2021-05-21 23:53:23,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4795 states. [2021-05-21 23:53:23,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4795 to 3848. [2021-05-21 23:53:23,084 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-05-21 23:53:23,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3848 states to 3848 states and 10052 transitions. [2021-05-21 23:53:23,093 INFO L78 Accepts]: Start accepts. Automaton has 3848 states and 10052 transitions. Word has length 105 [2021-05-21 23:53:23,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 23:53:23,093 INFO L482 AbstractCegarLoop]: Abstraction has 3848 states and 10052 transitions. [2021-05-21 23:53:23,093 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-05-21 23:53:23,093 INFO L276 IsEmpty]: Start isEmpty. Operand 3848 states and 10052 transitions. [2021-05-21 23:53:23,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-05-21 23:53:23,101 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 23:53:23,101 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-05-21 23:53:23,101 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-05-21 23:53:23,101 INFO L430 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-21 23:53:23,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 23:53:23,101 INFO L82 PathProgramCache]: Analyzing trace with hash -1381004282, now seen corresponding path program 6 times [2021-05-21 23:53:23,101 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 23:53:23,102 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307293789] [2021-05-21 23:53:23,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 23:53:23,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 23:53:23,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-21 23:53:23,538 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 23:53:23,538 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307293789] [2021-05-21 23:53:23,539 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307293789] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 23:53:23,539 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 23:53:23,539 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-05-21 23:53:23,539 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003213045] [2021-05-21 23:53:23,539 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-05-21 23:53:23,539 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 23:53:23,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-05-21 23:53:23,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2021-05-21 23:53:23,540 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-05-21 23:53:24,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 23:53:24,955 INFO L93 Difference]: Finished difference Result 4572 states and 11662 transitions. [2021-05-21 23:53:24,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-05-21 23:53:24,955 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-05-21 23:53:24,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 23:53:24,959 INFO L225 Difference]: With dead ends: 4572 [2021-05-21 23:53:24,959 INFO L226 Difference]: Without dead ends: 4572 [2021-05-21 23:53:24,960 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 1189.7ms TimeCoverageRelationStatistics Valid=286, Invalid=770, Unknown=0, NotChecked=0, Total=1056 [2021-05-21 23:53:24,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4572 states. [2021-05-21 23:53:25,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4572 to 3850. [2021-05-21 23:53:25,032 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-05-21 23:53:25,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3850 states to 3850 states and 10057 transitions. [2021-05-21 23:53:25,041 INFO L78 Accepts]: Start accepts. Automaton has 3850 states and 10057 transitions. Word has length 105 [2021-05-21 23:53:25,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 23:53:25,041 INFO L482 AbstractCegarLoop]: Abstraction has 3850 states and 10057 transitions. [2021-05-21 23:53:25,041 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-05-21 23:53:25,041 INFO L276 IsEmpty]: Start isEmpty. Operand 3850 states and 10057 transitions. [2021-05-21 23:53:25,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-05-21 23:53:25,047 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 23:53:25,048 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-05-21 23:53:25,048 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-05-21 23:53:25,048 INFO L430 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-21 23:53:25,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 23:53:25,048 INFO L82 PathProgramCache]: Analyzing trace with hash 1036005680, now seen corresponding path program 7 times [2021-05-21 23:53:25,048 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 23:53:25,048 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37219723] [2021-05-21 23:53:25,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 23:53:25,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 23:53:25,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-21 23:53:25,351 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 23:53:25,351 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37219723] [2021-05-21 23:53:25,351 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37219723] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 23:53:25,351 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 23:53:25,351 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-05-21 23:53:25,351 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192957491] [2021-05-21 23:53:25,352 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-05-21 23:53:25,352 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 23:53:25,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-05-21 23:53:25,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2021-05-21 23:53:25,353 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-05-21 23:53:26,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 23:53:26,086 INFO L93 Difference]: Finished difference Result 4263 states and 10873 transitions. [2021-05-21 23:53:26,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-05-21 23:53:26,086 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-05-21 23:53:26,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 23:53:26,090 INFO L225 Difference]: With dead ends: 4263 [2021-05-21 23:53:26,090 INFO L226 Difference]: Without dead ends: 4263 [2021-05-21 23:53:26,091 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 575.7ms TimeCoverageRelationStatistics Valid=210, Invalid=602, Unknown=0, NotChecked=0, Total=812 [2021-05-21 23:53:26,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4263 states. [2021-05-21 23:53:26,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4263 to 3846. [2021-05-21 23:53:26,152 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-05-21 23:53:26,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3846 states to 3846 states and 10053 transitions. [2021-05-21 23:53:26,160 INFO L78 Accepts]: Start accepts. Automaton has 3846 states and 10053 transitions. Word has length 105 [2021-05-21 23:53:26,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 23:53:26,160 INFO L482 AbstractCegarLoop]: Abstraction has 3846 states and 10053 transitions. [2021-05-21 23:53:26,160 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-05-21 23:53:26,160 INFO L276 IsEmpty]: Start isEmpty. Operand 3846 states and 10053 transitions. [2021-05-21 23:53:26,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-05-21 23:53:26,168 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 23:53:26,168 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-05-21 23:53:26,168 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-05-21 23:53:26,169 INFO L430 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-21 23:53:26,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 23:53:26,169 INFO L82 PathProgramCache]: Analyzing trace with hash 419287134, now seen corresponding path program 8 times [2021-05-21 23:53:26,169 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 23:53:26,169 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018222797] [2021-05-21 23:53:26,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 23:53:26,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 23:53:26,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-21 23:53:26,575 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 23:53:26,575 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018222797] [2021-05-21 23:53:26,576 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018222797] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 23:53:26,577 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 23:53:26,577 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-05-21 23:53:26,577 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83317735] [2021-05-21 23:53:26,577 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-05-21 23:53:26,577 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 23:53:26,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-05-21 23:53:26,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2021-05-21 23:53:26,578 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-05-21 23:53:27,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 23:53:27,830 INFO L93 Difference]: Finished difference Result 4504 states and 11381 transitions. [2021-05-21 23:53:27,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-05-21 23:53:27,830 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-05-21 23:53:27,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 23:53:27,834 INFO L225 Difference]: With dead ends: 4504 [2021-05-21 23:53:27,834 INFO L226 Difference]: Without dead ends: 4504 [2021-05-21 23:53:27,835 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 1017.9ms TimeCoverageRelationStatistics Valid=284, Invalid=838, Unknown=0, NotChecked=0, Total=1122 [2021-05-21 23:53:27,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4504 states. [2021-05-21 23:53:27,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4504 to 3854. [2021-05-21 23:53:27,903 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-05-21 23:53:27,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3854 states to 3854 states and 10073 transitions. [2021-05-21 23:53:27,912 INFO L78 Accepts]: Start accepts. Automaton has 3854 states and 10073 transitions. Word has length 105 [2021-05-21 23:53:27,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 23:53:27,913 INFO L482 AbstractCegarLoop]: Abstraction has 3854 states and 10073 transitions. [2021-05-21 23:53:27,913 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-05-21 23:53:27,913 INFO L276 IsEmpty]: Start isEmpty. Operand 3854 states and 10073 transitions. [2021-05-21 23:53:27,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-05-21 23:53:27,919 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 23:53:27,919 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-05-21 23:53:27,920 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-05-21 23:53:27,920 INFO L430 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-21 23:53:27,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 23:53:27,920 INFO L82 PathProgramCache]: Analyzing trace with hash -1866032802, now seen corresponding path program 9 times [2021-05-21 23:53:27,920 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 23:53:27,920 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714413942] [2021-05-21 23:53:27,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 23:53:27,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 23:53:28,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-21 23:53:28,561 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 23:53:28,561 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714413942] [2021-05-21 23:53:28,561 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714413942] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 23:53:28,561 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 23:53:28,562 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2021-05-21 23:53:28,562 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732600000] [2021-05-21 23:53:28,562 INFO L462 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-05-21 23:53:28,562 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 23:53:28,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-05-21 23:53:28,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=329, Unknown=0, NotChecked=0, Total=380 [2021-05-21 23:53:28,563 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-05-21 23:53:30,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 23:53:30,133 INFO L93 Difference]: Finished difference Result 4806 states and 12131 transitions. [2021-05-21 23:53:30,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-05-21 23:53:30,134 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-05-21 23:53:30,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 23:53:30,138 INFO L225 Difference]: With dead ends: 4806 [2021-05-21 23:53:30,138 INFO L226 Difference]: Without dead ends: 4806 [2021-05-21 23:53:30,138 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 1463.2ms TimeCoverageRelationStatistics Valid=326, Invalid=1006, Unknown=0, NotChecked=0, Total=1332 [2021-05-21 23:53:30,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4806 states. [2021-05-21 23:53:30,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4806 to 3862. [2021-05-21 23:53:30,201 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-05-21 23:53:30,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3862 states to 3862 states and 10093 transitions. [2021-05-21 23:53:30,209 INFO L78 Accepts]: Start accepts. Automaton has 3862 states and 10093 transitions. Word has length 105 [2021-05-21 23:53:30,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 23:53:30,209 INFO L482 AbstractCegarLoop]: Abstraction has 3862 states and 10093 transitions. [2021-05-21 23:53:30,209 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-05-21 23:53:30,210 INFO L276 IsEmpty]: Start isEmpty. Operand 3862 states and 10093 transitions. [2021-05-21 23:53:30,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-05-21 23:53:30,216 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 23:53:30,216 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-05-21 23:53:30,216 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-05-21 23:53:30,216 INFO L430 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-21 23:53:30,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 23:53:30,216 INFO L82 PathProgramCache]: Analyzing trace with hash 179931456, now seen corresponding path program 10 times [2021-05-21 23:53:30,216 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 23:53:30,217 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962301584] [2021-05-21 23:53:30,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 23:53:30,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 23:53:30,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-21 23:53:30,603 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 23:53:30,603 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962301584] [2021-05-21 23:53:30,603 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962301584] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 23:53:30,603 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 23:53:30,603 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-05-21 23:53:30,603 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576074768] [2021-05-21 23:53:30,606 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-05-21 23:53:30,606 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 23:53:30,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-05-21 23:53:30,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2021-05-21 23:53:30,606 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-05-21 23:53:32,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 23:53:32,407 INFO L93 Difference]: Finished difference Result 5652 states and 13985 transitions. [2021-05-21 23:53:32,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-05-21 23:53:32,408 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-05-21 23:53:32,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 23:53:32,412 INFO L225 Difference]: With dead ends: 5652 [2021-05-21 23:53:32,412 INFO L226 Difference]: Without dead ends: 5652 [2021-05-21 23:53:32,412 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 278 ImplicationChecksByTransitivity, 1589.8ms TimeCoverageRelationStatistics Valid=459, Invalid=1263, Unknown=0, NotChecked=0, Total=1722 [2021-05-21 23:53:32,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5652 states. [2021-05-21 23:53:32,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5652 to 3830. [2021-05-21 23:53:32,481 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-05-21 23:53:32,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3830 states to 3830 states and 10001 transitions. [2021-05-21 23:53:32,489 INFO L78 Accepts]: Start accepts. Automaton has 3830 states and 10001 transitions. Word has length 105 [2021-05-21 23:53:32,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 23:53:32,489 INFO L482 AbstractCegarLoop]: Abstraction has 3830 states and 10001 transitions. [2021-05-21 23:53:32,490 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-05-21 23:53:32,490 INFO L276 IsEmpty]: Start isEmpty. Operand 3830 states and 10001 transitions. [2021-05-21 23:53:32,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-05-21 23:53:32,496 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 23:53:32,496 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-05-21 23:53:32,496 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-05-21 23:53:32,496 INFO L430 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-21 23:53:32,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 23:53:32,497 INFO L82 PathProgramCache]: Analyzing trace with hash -2114633644, now seen corresponding path program 11 times [2021-05-21 23:53:32,497 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 23:53:32,497 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226236940] [2021-05-21 23:53:32,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 23:53:32,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 23:53:32,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-21 23:53:32,870 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 23:53:32,870 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226236940] [2021-05-21 23:53:32,870 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226236940] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 23:53:32,870 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 23:53:32,870 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-05-21 23:53:32,870 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356099314] [2021-05-21 23:53:32,871 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-05-21 23:53:32,871 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 23:53:32,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-05-21 23:53:32,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2021-05-21 23:53:32,871 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-05-21 23:53:33,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 23:53:33,886 INFO L93 Difference]: Finished difference Result 4897 states and 12195 transitions. [2021-05-21 23:53:33,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-05-21 23:53:33,886 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-05-21 23:53:33,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 23:53:33,890 INFO L225 Difference]: With dead ends: 4897 [2021-05-21 23:53:33,891 INFO L226 Difference]: Without dead ends: 4897 [2021-05-21 23:53:33,891 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 793.3ms TimeCoverageRelationStatistics Valid=272, Invalid=850, Unknown=0, NotChecked=0, Total=1122 [2021-05-21 23:53:33,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4897 states. [2021-05-21 23:53:33,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4897 to 3836. [2021-05-21 23:53:33,953 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-05-21 23:53:33,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3836 states to 3836 states and 10016 transitions. [2021-05-21 23:53:33,961 INFO L78 Accepts]: Start accepts. Automaton has 3836 states and 10016 transitions. Word has length 105 [2021-05-21 23:53:33,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 23:53:33,962 INFO L482 AbstractCegarLoop]: Abstraction has 3836 states and 10016 transitions. [2021-05-21 23:53:33,962 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-05-21 23:53:33,962 INFO L276 IsEmpty]: Start isEmpty. Operand 3836 states and 10016 transitions. [2021-05-21 23:53:33,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-05-21 23:53:33,968 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 23:53:33,969 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-05-21 23:53:33,969 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-05-21 23:53:33,969 INFO L430 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-21 23:53:33,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 23:53:33,969 INFO L82 PathProgramCache]: Analyzing trace with hash -1809281472, now seen corresponding path program 12 times [2021-05-21 23:53:33,969 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 23:53:33,969 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213727028] [2021-05-21 23:53:33,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 23:53:33,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 23:53:34,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-21 23:53:34,422 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 23:53:34,422 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213727028] [2021-05-21 23:53:34,422 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213727028] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 23:53:34,422 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 23:53:34,422 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2021-05-21 23:53:34,422 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597718110] [2021-05-21 23:53:34,422 INFO L462 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-05-21 23:53:34,422 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 23:53:34,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-05-21 23:53:34,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=327, Unknown=0, NotChecked=0, Total=380 [2021-05-21 23:53:34,423 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-05-21 23:53:35,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 23:53:35,361 INFO L93 Difference]: Finished difference Result 4697 states and 11755 transitions. [2021-05-21 23:53:35,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-05-21 23:53:35,361 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-05-21 23:53:35,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 23:53:35,365 INFO L225 Difference]: With dead ends: 4697 [2021-05-21 23:53:35,366 INFO L226 Difference]: Without dead ends: 4697 [2021-05-21 23:53:35,366 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 848.8ms TimeCoverageRelationStatistics Valid=289, Invalid=971, Unknown=0, NotChecked=0, Total=1260 [2021-05-21 23:53:35,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4697 states. [2021-05-21 23:53:35,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4697 to 3855. [2021-05-21 23:53:35,422 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-05-21 23:53:35,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3855 states to 3855 states and 10059 transitions. [2021-05-21 23:53:35,430 INFO L78 Accepts]: Start accepts. Automaton has 3855 states and 10059 transitions. Word has length 105 [2021-05-21 23:53:35,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 23:53:35,430 INFO L482 AbstractCegarLoop]: Abstraction has 3855 states and 10059 transitions. [2021-05-21 23:53:35,431 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-05-21 23:53:35,431 INFO L276 IsEmpty]: Start isEmpty. Operand 3855 states and 10059 transitions. [2021-05-21 23:53:35,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-05-21 23:53:35,437 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 23:53:35,437 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-05-21 23:53:35,437 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-05-21 23:53:35,437 INFO L430 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-21 23:53:35,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 23:53:35,437 INFO L82 PathProgramCache]: Analyzing trace with hash 2136499800, now seen corresponding path program 13 times [2021-05-21 23:53:35,438 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 23:53:35,438 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853350065] [2021-05-21 23:53:35,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 23:53:35,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 23:53:35,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-21 23:53:35,750 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 23:53:35,750 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853350065] [2021-05-21 23:53:35,750 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853350065] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 23:53:35,750 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 23:53:35,750 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-05-21 23:53:35,750 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137587825] [2021-05-21 23:53:35,751 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-05-21 23:53:35,751 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 23:53:35,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-05-21 23:53:35,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2021-05-21 23:53:35,751 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-05-21 23:53:36,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 23:53:36,510 INFO L93 Difference]: Finished difference Result 4967 states and 12337 transitions. [2021-05-21 23:53:36,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-05-21 23:53:36,511 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-05-21 23:53:36,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 23:53:36,516 INFO L225 Difference]: With dead ends: 4967 [2021-05-21 23:53:36,516 INFO L226 Difference]: Without dead ends: 4967 [2021-05-21 23:53:36,516 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 614.6ms TimeCoverageRelationStatistics Valid=221, Invalid=591, Unknown=0, NotChecked=0, Total=812 [2021-05-21 23:53:36,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4967 states. [2021-05-21 23:53:36,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4967 to 3911. [2021-05-21 23:53:36,581 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-05-21 23:53:36,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3911 states to 3911 states and 10200 transitions. [2021-05-21 23:53:36,590 INFO L78 Accepts]: Start accepts. Automaton has 3911 states and 10200 transitions. Word has length 105 [2021-05-21 23:53:36,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 23:53:36,590 INFO L482 AbstractCegarLoop]: Abstraction has 3911 states and 10200 transitions. [2021-05-21 23:53:36,590 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-05-21 23:53:36,590 INFO L276 IsEmpty]: Start isEmpty. Operand 3911 states and 10200 transitions. [2021-05-21 23:53:36,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-05-21 23:53:36,596 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 23:53:36,596 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-05-21 23:53:36,596 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-05-21 23:53:36,596 INFO L430 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-21 23:53:36,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 23:53:36,597 INFO L82 PathProgramCache]: Analyzing trace with hash 1608280384, now seen corresponding path program 14 times [2021-05-21 23:53:36,597 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 23:53:36,597 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219420360] [2021-05-21 23:53:36,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 23:53:36,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 23:53:36,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-21 23:53:36,976 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 23:53:36,976 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219420360] [2021-05-21 23:53:36,976 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219420360] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 23:53:36,976 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 23:53:36,976 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-05-21 23:53:36,976 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326428633] [2021-05-21 23:53:36,976 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-05-21 23:53:36,976 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 23:53:36,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-05-21 23:53:36,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2021-05-21 23:53:36,977 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-05-21 23:53:38,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 23:53:38,168 INFO L93 Difference]: Finished difference Result 4759 states and 11904 transitions. [2021-05-21 23:53:38,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-05-21 23:53:38,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-05-21 23:53:38,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 23:53:38,172 INFO L225 Difference]: With dead ends: 4759 [2021-05-21 23:53:38,172 INFO L226 Difference]: Without dead ends: 4759 [2021-05-21 23:53:38,173 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 1006.4ms TimeCoverageRelationStatistics Valid=273, Invalid=849, Unknown=0, NotChecked=0, Total=1122 [2021-05-21 23:53:38,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4759 states. [2021-05-21 23:53:38,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4759 to 3911. [2021-05-21 23:53:38,227 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-05-21 23:53:38,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3911 states to 3911 states and 10200 transitions. [2021-05-21 23:53:38,235 INFO L78 Accepts]: Start accepts. Automaton has 3911 states and 10200 transitions. Word has length 105 [2021-05-21 23:53:38,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 23:53:38,236 INFO L482 AbstractCegarLoop]: Abstraction has 3911 states and 10200 transitions. [2021-05-21 23:53:38,236 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-05-21 23:53:38,236 INFO L276 IsEmpty]: Start isEmpty. Operand 3911 states and 10200 transitions. [2021-05-21 23:53:38,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-05-21 23:53:38,241 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 23:53:38,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05-21 23:53:38,241 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-05-21 23:53:38,242 INFO L430 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-21 23:53:38,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 23:53:38,242 INFO L82 PathProgramCache]: Analyzing trace with hash 1667670798, now seen corresponding path program 15 times [2021-05-21 23:53:38,242 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 23:53:38,242 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506606502] [2021-05-21 23:53:38,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 23:53:38,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 23:53:38,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-21 23:53:38,609 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 23:53:38,609 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506606502] [2021-05-21 23:53:38,609 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506606502] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 23:53:38,609 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 23:53:38,609 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-05-21 23:53:38,609 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993623450] [2021-05-21 23:53:38,609 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-05-21 23:53:38,610 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 23:53:38,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-05-21 23:53:38,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2021-05-21 23:53:38,611 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-05-21 23:53:39,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 23:53:39,773 INFO L93 Difference]: Finished difference Result 4830 states and 12033 transitions. [2021-05-21 23:53:39,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-05-21 23:53:39,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-05-21 23:53:39,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 23:53:39,778 INFO L225 Difference]: With dead ends: 4830 [2021-05-21 23:53:39,779 INFO L226 Difference]: Without dead ends: 4830 [2021-05-21 23:53:39,779 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 996.8ms TimeCoverageRelationStatistics Valid=298, Invalid=892, Unknown=0, NotChecked=0, Total=1190 [2021-05-21 23:53:39,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4830 states. [2021-05-21 23:53:39,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4830 to 3909. [2021-05-21 23:53:39,824 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-05-21 23:53:39,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3909 states to 3909 states and 10195 transitions. [2021-05-21 23:53:39,832 INFO L78 Accepts]: Start accepts. Automaton has 3909 states and 10195 transitions. Word has length 105 [2021-05-21 23:53:39,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 23:53:39,832 INFO L482 AbstractCegarLoop]: Abstraction has 3909 states and 10195 transitions. [2021-05-21 23:53:39,832 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-05-21 23:53:39,832 INFO L276 IsEmpty]: Start isEmpty. Operand 3909 states and 10195 transitions. [2021-05-21 23:53:39,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-05-21 23:53:39,837 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 23:53:39,837 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-05-21 23:53:39,837 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-05-21 23:53:39,837 INFO L430 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-21 23:53:39,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 23:53:39,838 INFO L82 PathProgramCache]: Analyzing trace with hash 1842427648, now seen corresponding path program 16 times [2021-05-21 23:53:39,838 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 23:53:39,838 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501775311] [2021-05-21 23:53:39,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 23:53:39,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 23:53:40,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-21 23:53:40,121 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 23:53:40,122 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501775311] [2021-05-21 23:53:40,122 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501775311] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 23:53:40,122 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 23:53:40,122 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-05-21 23:53:40,122 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117126999] [2021-05-21 23:53:40,122 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-05-21 23:53:40,122 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 23:53:40,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-05-21 23:53:40,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2021-05-21 23:53:40,123 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-05-21 23:53:40,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 23:53:40,766 INFO L93 Difference]: Finished difference Result 5081 states and 12655 transitions. [2021-05-21 23:53:40,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-05-21 23:53:40,766 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-05-21 23:53:40,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 23:53:40,771 INFO L225 Difference]: With dead ends: 5081 [2021-05-21 23:53:40,771 INFO L226 Difference]: Without dead ends: 5081 [2021-05-21 23:53:40,771 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 457.1ms TimeCoverageRelationStatistics Valid=232, Invalid=580, Unknown=0, NotChecked=0, Total=812 [2021-05-21 23:53:40,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5081 states. [2021-05-21 23:53:40,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5081 to 3873. [2021-05-21 23:53:40,818 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-05-21 23:53:40,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3873 states to 3873 states and 10099 transitions. [2021-05-21 23:53:40,823 INFO L78 Accepts]: Start accepts. Automaton has 3873 states and 10099 transitions. Word has length 105 [2021-05-21 23:53:40,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 23:53:40,823 INFO L482 AbstractCegarLoop]: Abstraction has 3873 states and 10099 transitions. [2021-05-21 23:53:40,823 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-05-21 23:53:40,823 INFO L276 IsEmpty]: Start isEmpty. Operand 3873 states and 10099 transitions. [2021-05-21 23:53:40,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-05-21 23:53:40,827 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 23:53:40,827 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-05-21 23:53:40,827 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-05-21 23:53:40,827 INFO L430 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-21 23:53:40,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 23:53:40,828 INFO L82 PathProgramCache]: Analyzing trace with hash 2017781410, now seen corresponding path program 17 times [2021-05-21 23:53:40,828 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 23:53:40,828 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463026796] [2021-05-21 23:53:40,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 23:53:40,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 23:53:41,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-21 23:53:41,165 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 23:53:41,165 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463026796] [2021-05-21 23:53:41,165 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463026796] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 23:53:41,165 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 23:53:41,165 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-05-21 23:53:41,165 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127095443] [2021-05-21 23:53:41,165 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-05-21 23:53:41,165 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 23:53:41,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-05-21 23:53:41,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2021-05-21 23:53:41,166 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-05-21 23:53:42,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 23:53:42,609 INFO L93 Difference]: Finished difference Result 5410 states and 13710 transitions. [2021-05-21 23:53:42,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-05-21 23:53:42,609 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-05-21 23:53:42,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 23:53:42,614 INFO L225 Difference]: With dead ends: 5410 [2021-05-21 23:53:42,614 INFO L226 Difference]: Without dead ends: 5410 [2021-05-21 23:53:42,614 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 1156.6ms TimeCoverageRelationStatistics Valid=295, Invalid=827, Unknown=0, NotChecked=0, Total=1122 [2021-05-21 23:53:42,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5410 states. [2021-05-21 23:53:42,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5410 to 3921. [2021-05-21 23:53:42,660 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-05-21 23:53:42,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3921 states to 3921 states and 10243 transitions. [2021-05-21 23:53:42,665 INFO L78 Accepts]: Start accepts. Automaton has 3921 states and 10243 transitions. Word has length 105 [2021-05-21 23:53:42,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 23:53:42,665 INFO L482 AbstractCegarLoop]: Abstraction has 3921 states and 10243 transitions. [2021-05-21 23:53:42,666 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-05-21 23:53:42,666 INFO L276 IsEmpty]: Start isEmpty. Operand 3921 states and 10243 transitions. [2021-05-21 23:53:42,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-05-21 23:53:42,669 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 23:53:42,669 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-05-21 23:53:42,669 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-05-21 23:53:42,669 INFO L430 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-21 23:53:42,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 23:53:42,669 INFO L82 PathProgramCache]: Analyzing trace with hash -1220456674, now seen corresponding path program 18 times [2021-05-21 23:53:42,669 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 23:53:42,669 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431927662] [2021-05-21 23:53:42,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 23:53:42,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 23:53:43,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-21 23:53:43,009 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 23:53:43,009 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431927662] [2021-05-21 23:53:43,009 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [431927662] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 23:53:43,009 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 23:53:43,009 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-05-21 23:53:43,010 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055942950] [2021-05-21 23:53:43,010 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-05-21 23:53:43,010 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 23:53:43,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-05-21 23:53:43,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2021-05-21 23:53:43,011 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-05-21 23:53:44,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 23:53:44,258 INFO L93 Difference]: Finished difference Result 6126 states and 15571 transitions. [2021-05-21 23:53:44,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-05-21 23:53:44,259 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-05-21 23:53:44,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 23:53:44,264 INFO L225 Difference]: With dead ends: 6126 [2021-05-21 23:53:44,264 INFO L226 Difference]: Without dead ends: 6126 [2021-05-21 23:53:44,265 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 1059.2ms TimeCoverageRelationStatistics Valid=286, Invalid=770, Unknown=0, NotChecked=0, Total=1056 [2021-05-21 23:53:44,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6126 states. [2021-05-21 23:53:44,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6126 to 3921. [2021-05-21 23:53:44,311 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-05-21 23:53:44,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3921 states to 3921 states and 10243 transitions. [2021-05-21 23:53:44,316 INFO L78 Accepts]: Start accepts. Automaton has 3921 states and 10243 transitions. Word has length 105 [2021-05-21 23:53:44,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 23:53:44,317 INFO L482 AbstractCegarLoop]: Abstraction has 3921 states and 10243 transitions. [2021-05-21 23:53:44,317 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-05-21 23:53:44,317 INFO L276 IsEmpty]: Start isEmpty. Operand 3921 states and 10243 transitions. [2021-05-21 23:53:44,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-05-21 23:53:44,321 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 23:53:44,321 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-05-21 23:53:44,322 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-05-21 23:53:44,322 INFO L430 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-21 23:53:44,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 23:53:44,322 INFO L82 PathProgramCache]: Analyzing trace with hash 435996362, now seen corresponding path program 19 times [2021-05-21 23:53:44,322 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 23:53:44,322 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101337934] [2021-05-21 23:53:44,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 23:53:44,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 23:53:44,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-21 23:53:44,700 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 23:53:44,701 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101337934] [2021-05-21 23:53:44,701 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101337934] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 23:53:44,701 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 23:53:44,701 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-05-21 23:53:44,701 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118658486] [2021-05-21 23:53:44,701 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-05-21 23:53:44,701 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 23:53:44,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-05-21 23:53:44,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2021-05-21 23:53:44,702 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-05-21 23:53:45,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 23:53:45,826 INFO L93 Difference]: Finished difference Result 5608 states and 14108 transitions. [2021-05-21 23:53:45,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-05-21 23:53:45,826 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-05-21 23:53:45,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 23:53:45,831 INFO L225 Difference]: With dead ends: 5608 [2021-05-21 23:53:45,831 INFO L226 Difference]: Without dead ends: 5608 [2021-05-21 23:53:45,832 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 962.0ms TimeCoverageRelationStatistics Valid=284, Invalid=838, Unknown=0, NotChecked=0, Total=1122 [2021-05-21 23:53:45,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5608 states. [2021-05-21 23:53:45,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5608 to 3923. [2021-05-21 23:53:45,880 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-05-21 23:53:45,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3923 states to 3923 states and 10248 transitions. [2021-05-21 23:53:45,888 INFO L78 Accepts]: Start accepts. Automaton has 3923 states and 10248 transitions. Word has length 105 [2021-05-21 23:53:45,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 23:53:45,889 INFO L482 AbstractCegarLoop]: Abstraction has 3923 states and 10248 transitions. [2021-05-21 23:53:45,889 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-05-21 23:53:45,889 INFO L276 IsEmpty]: Start isEmpty. Operand 3923 states and 10248 transitions. [2021-05-21 23:53:45,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-05-21 23:53:45,894 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 23:53:45,894 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-05-21 23:53:45,894 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-05-21 23:53:45,894 INFO L430 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-21 23:53:45,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 23:53:45,894 INFO L82 PathProgramCache]: Analyzing trace with hash 1883605662, now seen corresponding path program 20 times [2021-05-21 23:53:45,895 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 23:53:45,895 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135059154] [2021-05-21 23:53:45,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 23:53:45,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 23:53:46,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-21 23:53:46,265 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 23:53:46,266 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135059154] [2021-05-21 23:53:46,266 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1135059154] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 23:53:46,266 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 23:53:46,266 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-05-21 23:53:46,266 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619581359] [2021-05-21 23:53:46,266 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-05-21 23:53:46,266 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 23:53:46,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-05-21 23:53:46,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2021-05-21 23:53:46,267 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-05-21 23:53:47,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 23:53:47,553 INFO L93 Difference]: Finished difference Result 5579 states and 14042 transitions. [2021-05-21 23:53:47,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-05-21 23:53:47,553 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-05-21 23:53:47,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 23:53:47,558 INFO L225 Difference]: With dead ends: 5579 [2021-05-21 23:53:47,558 INFO L226 Difference]: Without dead ends: 5579 [2021-05-21 23:53:47,558 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 1092.2ms TimeCoverageRelationStatistics Valid=309, Invalid=881, Unknown=0, NotChecked=0, Total=1190 [2021-05-21 23:53:47,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5579 states. [2021-05-21 23:53:47,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5579 to 3921. [2021-05-21 23:53:47,599 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-05-21 23:53:47,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3921 states to 3921 states and 10243 transitions. [2021-05-21 23:53:47,604 INFO L78 Accepts]: Start accepts. Automaton has 3921 states and 10243 transitions. Word has length 105 [2021-05-21 23:53:47,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 23:53:47,605 INFO L482 AbstractCegarLoop]: Abstraction has 3921 states and 10243 transitions. [2021-05-21 23:53:47,605 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-05-21 23:53:47,605 INFO L276 IsEmpty]: Start isEmpty. Operand 3921 states and 10243 transitions. [2021-05-21 23:53:47,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-05-21 23:53:47,608 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 23:53:47,608 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-05-21 23:53:47,608 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-05-21 23:53:47,608 INFO L430 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-21 23:53:47,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 23:53:47,609 INFO L82 PathProgramCache]: Analyzing trace with hash 705758666, now seen corresponding path program 21 times [2021-05-21 23:53:47,609 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 23:53:47,609 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577708014] [2021-05-21 23:53:47,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 23:53:47,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 23:53:47,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-21 23:53:47,944 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 23:53:47,944 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577708014] [2021-05-21 23:53:47,944 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577708014] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 23:53:47,944 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 23:53:47,944 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-05-21 23:53:47,944 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861352292] [2021-05-21 23:53:47,944 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-05-21 23:53:47,944 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 23:53:47,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-05-21 23:53:47,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2021-05-21 23:53:47,945 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-05-21 23:53:49,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 23:53:49,787 INFO L93 Difference]: Finished difference Result 6811 states and 17055 transitions. [2021-05-21 23:53:49,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-05-21 23:53:49,788 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-05-21 23:53:49,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 23:53:49,792 INFO L225 Difference]: With dead ends: 6811 [2021-05-21 23:53:49,792 INFO L226 Difference]: Without dead ends: 6811 [2021-05-21 23:53:49,793 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 1502.5ms TimeCoverageRelationStatistics Valid=434, Invalid=1126, Unknown=0, NotChecked=0, Total=1560 [2021-05-21 23:53:49,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6811 states. [2021-05-21 23:53:49,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6811 to 3933. [2021-05-21 23:53:49,842 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-05-21 23:53:49,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3933 states to 3933 states and 10279 transitions. [2021-05-21 23:53:49,849 INFO L78 Accepts]: Start accepts. Automaton has 3933 states and 10279 transitions. Word has length 105 [2021-05-21 23:53:49,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 23:53:49,850 INFO L482 AbstractCegarLoop]: Abstraction has 3933 states and 10279 transitions. [2021-05-21 23:53:49,850 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-05-21 23:53:49,850 INFO L276 IsEmpty]: Start isEmpty. Operand 3933 states and 10279 transitions. [2021-05-21 23:53:49,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-05-21 23:53:49,853 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 23:53:49,853 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-05-21 23:53:49,853 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-05-21 23:53:49,853 INFO L430 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-21 23:53:49,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 23:53:49,854 INFO L82 PathProgramCache]: Analyzing trace with hash 793280674, now seen corresponding path program 22 times [2021-05-21 23:53:49,854 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 23:53:49,854 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499406955] [2021-05-21 23:53:49,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 23:53:49,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 23:53:50,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-21 23:53:50,210 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 23:53:50,210 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499406955] [2021-05-21 23:53:50,210 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499406955] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 23:53:50,210 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 23:53:50,210 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-05-21 23:53:50,210 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160648772] [2021-05-21 23:53:50,211 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-05-21 23:53:50,211 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 23:53:50,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-05-21 23:53:50,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2021-05-21 23:53:50,211 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-05-21 23:53:51,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 23:53:51,563 INFO L93 Difference]: Finished difference Result 5948 states and 14912 transitions. [2021-05-21 23:53:51,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-05-21 23:53:51,564 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-05-21 23:53:51,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 23:53:51,567 INFO L225 Difference]: With dead ends: 5948 [2021-05-21 23:53:51,567 INFO L226 Difference]: Without dead ends: 5948 [2021-05-21 23:53:51,568 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 1150.3ms TimeCoverageRelationStatistics Valid=320, Invalid=870, Unknown=0, NotChecked=0, Total=1190 [2021-05-21 23:53:51,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5948 states. [2021-05-21 23:53:51,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5948 to 3921. [2021-05-21 23:53:51,608 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-05-21 23:53:51,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3921 states to 3921 states and 10243 transitions. [2021-05-21 23:53:51,613 INFO L78 Accepts]: Start accepts. Automaton has 3921 states and 10243 transitions. Word has length 105 [2021-05-21 23:53:51,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 23:53:51,613 INFO L482 AbstractCegarLoop]: Abstraction has 3921 states and 10243 transitions. [2021-05-21 23:53:51,613 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-05-21 23:53:51,613 INFO L276 IsEmpty]: Start isEmpty. Operand 3921 states and 10243 transitions. [2021-05-21 23:53:51,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-05-21 23:53:51,616 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 23:53:51,616 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-05-21 23:53:51,616 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-05-21 23:53:51,617 INFO L430 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-21 23:53:51,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 23:53:51,617 INFO L82 PathProgramCache]: Analyzing trace with hash -1795359232, now seen corresponding path program 23 times [2021-05-21 23:53:51,617 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 23:53:51,617 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854473627] [2021-05-21 23:53:51,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 23:53:51,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 23:53:51,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-21 23:53:51,987 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 23:53:51,987 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854473627] [2021-05-21 23:53:51,987 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854473627] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 23:53:51,987 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 23:53:51,987 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-05-21 23:53:51,987 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307621742] [2021-05-21 23:53:51,987 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-05-21 23:53:51,987 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 23:53:51,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-05-21 23:53:51,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2021-05-21 23:53:51,988 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-05-21 23:53:52,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 23:53:52,872 INFO L93 Difference]: Finished difference Result 4465 states and 11330 transitions. [2021-05-21 23:53:52,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-05-21 23:53:52,872 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-05-21 23:53:52,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 23:53:52,876 INFO L225 Difference]: With dead ends: 4465 [2021-05-21 23:53:52,876 INFO L226 Difference]: Without dead ends: 4465 [2021-05-21 23:53:52,877 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 764.9ms TimeCoverageRelationStatistics Valid=262, Invalid=860, Unknown=0, NotChecked=0, Total=1122 [2021-05-21 23:53:52,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4465 states. [2021-05-21 23:53:52,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4465 to 3903. [2021-05-21 23:53:52,922 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-05-21 23:53:52,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3903 states to 3903 states and 10198 transitions. [2021-05-21 23:53:52,929 INFO L78 Accepts]: Start accepts. Automaton has 3903 states and 10198 transitions. Word has length 105 [2021-05-21 23:53:52,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 23:53:52,929 INFO L482 AbstractCegarLoop]: Abstraction has 3903 states and 10198 transitions. [2021-05-21 23:53:52,929 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-05-21 23:53:52,929 INFO L276 IsEmpty]: Start isEmpty. Operand 3903 states and 10198 transitions. [2021-05-21 23:53:52,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-05-21 23:53:52,932 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 23:53:52,933 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-05-21 23:53:52,933 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-05-21 23:53:52,933 INFO L430 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-21 23:53:52,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 23:53:52,933 INFO L82 PathProgramCache]: Analyzing trace with hash -1490007060, now seen corresponding path program 24 times [2021-05-21 23:53:52,933 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 23:53:52,933 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118406758] [2021-05-21 23:53:52,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 23:53:52,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 23:53:53,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-21 23:53:53,182 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 23:53:53,182 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118406758] [2021-05-21 23:53:53,182 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118406758] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 23:53:53,182 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 23:53:53,182 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-05-21 23:53:53,182 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713967501] [2021-05-21 23:53:53,183 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-05-21 23:53:53,183 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 23:53:53,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-05-21 23:53:53,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2021-05-21 23:53:53,183 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-05-21 23:53:53,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 23:53:53,727 INFO L93 Difference]: Finished difference Result 4518 states and 11434 transitions. [2021-05-21 23:53:53,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-05-21 23:53:53,728 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-05-21 23:53:53,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 23:53:53,732 INFO L225 Difference]: With dead ends: 4518 [2021-05-21 23:53:53,732 INFO L226 Difference]: Without dead ends: 4518 [2021-05-21 23:53:53,732 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 465.0ms TimeCoverageRelationStatistics Valid=210, Invalid=602, Unknown=0, NotChecked=0, Total=812 [2021-05-21 23:53:53,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4518 states. [2021-05-21 23:53:53,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4518 to 3827. [2021-05-21 23:53:53,773 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-05-21 23:53:53,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3827 states to 3827 states and 10016 transitions. [2021-05-21 23:53:53,778 INFO L78 Accepts]: Start accepts. Automaton has 3827 states and 10016 transitions. Word has length 105 [2021-05-21 23:53:53,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 23:53:53,778 INFO L482 AbstractCegarLoop]: Abstraction has 3827 states and 10016 transitions. [2021-05-21 23:53:53,778 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-05-21 23:53:53,779 INFO L276 IsEmpty]: Start isEmpty. Operand 3827 states and 10016 transitions. [2021-05-21 23:53:53,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-05-21 23:53:53,782 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 23:53:53,782 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-05-21 23:53:53,783 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-05-21 23:53:53,783 INFO L430 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-21 23:53:53,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 23:53:53,783 INFO L82 PathProgramCache]: Analyzing trace with hash 585486, now seen corresponding path program 25 times [2021-05-21 23:53:53,783 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 23:53:53,783 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414792230] [2021-05-21 23:53:53,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 23:53:53,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 23:53:54,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-21 23:53:54,117 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 23:53:54,117 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414792230] [2021-05-21 23:53:54,117 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414792230] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 23:53:54,117 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 23:53:54,117 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-05-21 23:53:54,117 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545505817] [2021-05-21 23:53:54,118 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-05-21 23:53:54,118 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 23:53:54,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-05-21 23:53:54,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2021-05-21 23:53:54,118 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-05-21 23:53:55,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 23:53:55,008 INFO L93 Difference]: Finished difference Result 4743 states and 11906 transitions. [2021-05-21 23:53:55,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-05-21 23:53:55,008 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-05-21 23:53:55,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 23:53:55,012 INFO L225 Difference]: With dead ends: 4743 [2021-05-21 23:53:55,012 INFO L226 Difference]: Without dead ends: 4743 [2021-05-21 23:53:55,013 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 739.7ms TimeCoverageRelationStatistics Valid=262, Invalid=860, Unknown=0, NotChecked=0, Total=1122 [2021-05-21 23:53:55,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4743 states. [2021-05-21 23:53:55,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4743 to 3829. [2021-05-21 23:53:55,055 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-05-21 23:53:55,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3829 states to 3829 states and 10021 transitions. [2021-05-21 23:53:55,060 INFO L78 Accepts]: Start accepts. Automaton has 3829 states and 10021 transitions. Word has length 105 [2021-05-21 23:53:55,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 23:53:55,060 INFO L482 AbstractCegarLoop]: Abstraction has 3829 states and 10021 transitions. [2021-05-21 23:53:55,061 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-05-21 23:53:55,061 INFO L276 IsEmpty]: Start isEmpty. Operand 3829 states and 10021 transitions. [2021-05-21 23:53:55,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-05-21 23:53:55,064 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 23:53:55,064 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-05-21 23:53:55,064 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-05-21 23:53:55,064 INFO L430 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-21 23:53:55,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 23:53:55,064 INFO L82 PathProgramCache]: Analyzing trace with hash 1986945210, now seen corresponding path program 26 times [2021-05-21 23:53:55,065 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 23:53:55,065 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267570893] [2021-05-21 23:53:55,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 23:53:55,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 23:53:55,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-21 23:53:55,428 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 23:53:55,428 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267570893] [2021-05-21 23:53:55,428 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267570893] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 23:53:55,428 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 23:53:55,428 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-05-21 23:53:55,428 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257139643] [2021-05-21 23:53:55,428 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-05-21 23:53:55,428 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 23:53:55,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-05-21 23:53:55,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2021-05-21 23:53:55,429 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-05-21 23:53:56,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 23:53:56,493 INFO L93 Difference]: Finished difference Result 4826 states and 12065 transitions. [2021-05-21 23:53:56,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-05-21 23:53:56,494 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-05-21 23:53:56,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 23:53:56,499 INFO L225 Difference]: With dead ends: 4826 [2021-05-21 23:53:56,499 INFO L226 Difference]: Without dead ends: 4826 [2021-05-21 23:53:56,500 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 911.4ms TimeCoverageRelationStatistics Valid=287, Invalid=903, Unknown=0, NotChecked=0, Total=1190 [2021-05-21 23:53:56,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4826 states. [2021-05-21 23:53:56,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4826 to 3821. [2021-05-21 23:53:56,554 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-05-21 23:53:56,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3821 states to 3821 states and 10001 transitions. [2021-05-21 23:53:56,561 INFO L78 Accepts]: Start accepts. Automaton has 3821 states and 10001 transitions. Word has length 105 [2021-05-21 23:53:56,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 23:53:56,562 INFO L482 AbstractCegarLoop]: Abstraction has 3821 states and 10001 transitions. [2021-05-21 23:53:56,562 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-05-21 23:53:56,562 INFO L276 IsEmpty]: Start isEmpty. Operand 3821 states and 10001 transitions. [2021-05-21 23:53:56,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-05-21 23:53:56,567 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 23:53:56,567 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-05-21 23:53:56,567 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-05-21 23:53:56,567 INFO L430 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-21 23:53:56,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 23:53:56,567 INFO L82 PathProgramCache]: Analyzing trace with hash 1605592104, now seen corresponding path program 27 times [2021-05-21 23:53:56,567 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 23:53:56,567 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047978956] [2021-05-21 23:53:56,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 23:53:56,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 23:53:56,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-21 23:53:56,908 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 23:53:56,908 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047978956] [2021-05-21 23:53:56,908 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047978956] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 23:53:56,908 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 23:53:56,908 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-05-21 23:53:56,908 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596714751] [2021-05-21 23:53:56,908 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-05-21 23:53:56,908 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 23:53:56,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-05-21 23:53:56,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2021-05-21 23:53:56,909 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-05-21 23:53:57,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 23:53:57,694 INFO L93 Difference]: Finished difference Result 4320 states and 11007 transitions. [2021-05-21 23:53:57,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-05-21 23:53:57,694 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-05-21 23:53:57,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 23:53:57,699 INFO L225 Difference]: With dead ends: 4320 [2021-05-21 23:53:57,699 INFO L226 Difference]: Without dead ends: 4320 [2021-05-21 23:53:57,699 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 669.3ms TimeCoverageRelationStatistics Valid=264, Invalid=858, Unknown=0, NotChecked=0, Total=1122 [2021-05-21 23:53:57,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4320 states. [2021-05-21 23:53:57,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4320 to 3839. [2021-05-21 23:53:57,740 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-05-21 23:53:57,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3839 states to 3839 states and 10046 transitions. [2021-05-21 23:53:57,745 INFO L78 Accepts]: Start accepts. Automaton has 3839 states and 10046 transitions. Word has length 105 [2021-05-21 23:53:57,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 23:53:57,745 INFO L482 AbstractCegarLoop]: Abstraction has 3839 states and 10046 transitions. [2021-05-21 23:53:57,745 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-05-21 23:53:57,745 INFO L276 IsEmpty]: Start isEmpty. Operand 3839 states and 10046 transitions. [2021-05-21 23:53:57,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-05-21 23:53:57,750 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 23:53:57,750 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-05-21 23:53:57,750 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-05-21 23:53:57,750 INFO L430 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-21 23:53:57,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 23:53:57,751 INFO L82 PathProgramCache]: Analyzing trace with hash -291468002, now seen corresponding path program 28 times [2021-05-21 23:53:57,751 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 23:53:57,751 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074046822] [2021-05-21 23:53:57,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 23:53:57,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 23:53:58,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-21 23:53:58,080 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 23:53:58,080 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074046822] [2021-05-21 23:53:58,080 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074046822] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 23:53:58,080 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 23:53:58,080 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-05-21 23:53:58,080 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982248732] [2021-05-21 23:53:58,080 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-05-21 23:53:58,080 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 23:53:58,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-05-21 23:53:58,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2021-05-21 23:53:58,081 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-05-21 23:53:58,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 23:53:58,896 INFO L93 Difference]: Finished difference Result 4533 states and 11432 transitions. [2021-05-21 23:53:58,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-05-21 23:53:58,896 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-05-21 23:53:58,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 23:53:58,900 INFO L225 Difference]: With dead ends: 4533 [2021-05-21 23:53:58,900 INFO L226 Difference]: Without dead ends: 4533 [2021-05-21 23:53:58,901 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 678.7ms TimeCoverageRelationStatistics Valid=263, Invalid=859, Unknown=0, NotChecked=0, Total=1122 [2021-05-21 23:53:58,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4533 states. [2021-05-21 23:53:58,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4533 to 3839. [2021-05-21 23:53:58,939 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-05-21 23:53:58,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3839 states to 3839 states and 10046 transitions. [2021-05-21 23:53:58,944 INFO L78 Accepts]: Start accepts. Automaton has 3839 states and 10046 transitions. Word has length 105 [2021-05-21 23:53:58,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 23:53:58,944 INFO L482 AbstractCegarLoop]: Abstraction has 3839 states and 10046 transitions. [2021-05-21 23:53:58,944 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-05-21 23:53:58,944 INFO L276 IsEmpty]: Start isEmpty. Operand 3839 states and 10046 transitions. [2021-05-21 23:53:58,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-05-21 23:53:58,948 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 23:53:58,948 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-05-21 23:53:58,948 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-05-21 23:53:58,948 INFO L430 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-21 23:53:58,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 23:53:58,948 INFO L82 PathProgramCache]: Analyzing trace with hash 1694891722, now seen corresponding path program 29 times [2021-05-21 23:53:58,949 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 23:53:58,949 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761019346] [2021-05-21 23:53:58,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 23:53:58,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 23:53:59,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-21 23:53:59,294 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 23:53:59,294 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761019346] [2021-05-21 23:53:59,294 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1761019346] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 23:53:59,294 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 23:53:59,294 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-05-21 23:53:59,294 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126331639] [2021-05-21 23:53:59,294 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-05-21 23:53:59,294 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 23:53:59,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-05-21 23:53:59,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2021-05-21 23:53:59,295 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-05-21 23:54:00,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 23:54:00,251 INFO L93 Difference]: Finished difference Result 4397 states and 11151 transitions. [2021-05-21 23:54:00,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-05-21 23:54:00,251 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-05-21 23:54:00,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 23:54:00,254 INFO L225 Difference]: With dead ends: 4397 [2021-05-21 23:54:00,254 INFO L226 Difference]: Without dead ends: 4397 [2021-05-21 23:54:00,255 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 798.4ms TimeCoverageRelationStatistics Valid=288, Invalid=902, Unknown=0, NotChecked=0, Total=1190 [2021-05-21 23:54:00,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4397 states. [2021-05-21 23:54:00,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4397 to 3831. [2021-05-21 23:54:00,292 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-05-21 23:54:00,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3831 states to 3831 states and 10026 transitions. [2021-05-21 23:54:00,297 INFO L78 Accepts]: Start accepts. Automaton has 3831 states and 10026 transitions. Word has length 105 [2021-05-21 23:54:00,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 23:54:00,298 INFO L482 AbstractCegarLoop]: Abstraction has 3831 states and 10026 transitions. [2021-05-21 23:54:00,298 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-05-21 23:54:00,298 INFO L276 IsEmpty]: Start isEmpty. Operand 3831 states and 10026 transitions. [2021-05-21 23:54:00,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-05-21 23:54:00,303 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 23:54:00,303 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-05-21 23:54:00,303 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2021-05-21 23:54:00,303 INFO L430 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-21 23:54:00,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 23:54:00,304 INFO L82 PathProgramCache]: Analyzing trace with hash 1380809994, now seen corresponding path program 30 times [2021-05-21 23:54:00,304 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 23:54:00,304 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789534847] [2021-05-21 23:54:00,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 23:54:00,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 23:54:00,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-21 23:54:00,642 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 23:54:00,642 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789534847] [2021-05-21 23:54:00,642 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789534847] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 23:54:00,642 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 23:54:00,642 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-05-21 23:54:00,642 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430194382] [2021-05-21 23:54:00,643 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-05-21 23:54:00,643 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 23:54:00,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-05-21 23:54:00,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2021-05-21 23:54:00,643 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-05-21 23:54:01,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 23:54:01,564 INFO L93 Difference]: Finished difference Result 4697 states and 11791 transitions. [2021-05-21 23:54:01,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-05-21 23:54:01,564 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-05-21 23:54:01,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 23:54:01,568 INFO L225 Difference]: With dead ends: 4697 [2021-05-21 23:54:01,568 INFO L226 Difference]: Without dead ends: 4697 [2021-05-21 23:54:01,569 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 762.7ms TimeCoverageRelationStatistics Valid=286, Invalid=836, Unknown=0, NotChecked=0, Total=1122 [2021-05-21 23:54:01,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4697 states. [2021-05-21 23:54:01,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4697 to 3893. [2021-05-21 23:54:01,607 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-05-21 23:54:01,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3893 states to 3893 states and 10175 transitions. [2021-05-21 23:54:01,612 INFO L78 Accepts]: Start accepts. Automaton has 3893 states and 10175 transitions. Word has length 105 [2021-05-21 23:54:01,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 23:54:01,612 INFO L482 AbstractCegarLoop]: Abstraction has 3893 states and 10175 transitions. [2021-05-21 23:54:01,612 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-05-21 23:54:01,612 INFO L276 IsEmpty]: Start isEmpty. Operand 3893 states and 10175 transitions. [2021-05-21 23:54:01,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-05-21 23:54:01,615 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 23:54:01,615 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-05-21 23:54:01,616 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2021-05-21 23:54:01,616 INFO L430 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-21 23:54:01,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 23:54:01,617 INFO L82 PathProgramCache]: Analyzing trace with hash -1168161044, now seen corresponding path program 31 times [2021-05-21 23:54:01,617 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 23:54:01,617 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416750198] [2021-05-21 23:54:01,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 23:54:01,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 23:54:01,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-21 23:54:01,967 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 23:54:01,967 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416750198] [2021-05-21 23:54:01,968 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416750198] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 23:54:01,968 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 23:54:01,968 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-05-21 23:54:01,968 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284683461] [2021-05-21 23:54:01,968 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-05-21 23:54:01,968 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 23:54:01,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-05-21 23:54:01,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2021-05-21 23:54:01,969 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-05-21 23:54:03,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 23:54:03,115 INFO L93 Difference]: Finished difference Result 6573 states and 16534 transitions. [2021-05-21 23:54:03,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-05-21 23:54:03,115 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-05-21 23:54:03,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 23:54:03,119 INFO L225 Difference]: With dead ends: 6573 [2021-05-21 23:54:03,119 INFO L226 Difference]: Without dead ends: 6573 [2021-05-21 23:54:03,119 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 1014.7ms TimeCoverageRelationStatistics Valid=297, Invalid=825, Unknown=0, NotChecked=0, Total=1122 [2021-05-21 23:54:03,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6573 states. [2021-05-21 23:54:03,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6573 to 3961. [2021-05-21 23:54:03,162 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-05-21 23:54:03,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3961 states to 3961 states and 10381 transitions. [2021-05-21 23:54:03,168 INFO L78 Accepts]: Start accepts. Automaton has 3961 states and 10381 transitions. Word has length 105 [2021-05-21 23:54:03,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 23:54:03,168 INFO L482 AbstractCegarLoop]: Abstraction has 3961 states and 10381 transitions. [2021-05-21 23:54:03,168 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-05-21 23:54:03,168 INFO L276 IsEmpty]: Start isEmpty. Operand 3961 states and 10381 transitions. [2021-05-21 23:54:03,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-05-21 23:54:03,171 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 23:54:03,172 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-05-21 23:54:03,172 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2021-05-21 23:54:03,172 INFO L430 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-21 23:54:03,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 23:54:03,172 INFO L82 PathProgramCache]: Analyzing trace with hash -111431832, now seen corresponding path program 32 times [2021-05-21 23:54:03,172 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 23:54:03,172 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389084120] [2021-05-21 23:54:03,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 23:54:03,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 23:54:03,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-05-21 23:54:03,471 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 23:54:03,471 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389084120] [2021-05-21 23:54:03,471 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389084120] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 23:54:03,471 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 23:54:03,471 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-05-21 23:54:03,471 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019576250] [2021-05-21 23:54:03,471 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-05-21 23:54:03,471 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 23:54:03,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-05-21 23:54:03,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2021-05-21 23:54:03,472 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-05-21 23:54:04,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 23:54:04,655 INFO L93 Difference]: Finished difference Result 6173 states and 15715 transitions. [2021-05-21 23:54:04,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-05-21 23:54:04,656 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-05-21 23:54:04,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 23:54:04,662 INFO L225 Difference]: With dead ends: 6173 [2021-05-21 23:54:04,662 INFO L226 Difference]: Without dead ends: 6173 [2021-05-21 23:54:04,662 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 979.2ms TimeCoverageRelationStatistics Valid=288, Invalid=768, Unknown=0, NotChecked=0, Total=1056 [2021-05-21 23:54:04,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6173 states. [2021-05-21 23:54:04,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6173 to 4001. [2021-05-21 23:54:04,707 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-05-21 23:54:04,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4001 states to 4001 states and 10525 transitions. [2021-05-21 23:54:04,713 INFO L78 Accepts]: Start accepts. Automaton has 4001 states and 10525 transitions. Word has length 105 [2021-05-21 23:54:04,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 23:54:04,713 INFO L482 AbstractCegarLoop]: Abstraction has 4001 states and 10525 transitions. [2021-05-21 23:54:04,713 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-05-21 23:54:04,713 INFO L276 IsEmpty]: Start isEmpty. Operand 4001 states and 10525 transitions. [2021-05-21 23:54:04,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-05-21 23:54:04,717 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 23:54:04,717 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-05-21 23:54:04,717 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2021-05-21 23:54:04,718 INFO L430 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-21 23:54:04,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 23:54:04,718 INFO L82 PathProgramCache]: Analyzing trace with hash -409886238, now seen corresponding path program 33 times [2021-05-21 23:54:04,718 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 23:54:04,718 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412307889] [2021-05-21 23:54:04,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 23:54:04,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 23:54:05,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-21 23:54:05,043 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 23:54:05,043 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412307889] [2021-05-21 23:54:05,043 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412307889] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 23:54:05,043 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 23:54:05,043 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-05-21 23:54:05,043 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423633588] [2021-05-21 23:54:05,043 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-05-21 23:54:05,043 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 23:54:05,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-05-21 23:54:05,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2021-05-21 23:54:05,044 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-05-21 23:54:05,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 23:54:05,935 INFO L93 Difference]: Finished difference Result 4955 states and 12471 transitions. [2021-05-21 23:54:05,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-05-21 23:54:05,935 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-05-21 23:54:05,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 23:54:05,939 INFO L225 Difference]: With dead ends: 4955 [2021-05-21 23:54:05,940 INFO L226 Difference]: Without dead ends: 4955 [2021-05-21 23:54:05,940 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 698.5ms TimeCoverageRelationStatistics Valid=274, Invalid=848, Unknown=0, NotChecked=0, Total=1122 [2021-05-21 23:54:05,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4955 states. [2021-05-21 23:54:05,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4955 to 3968. [2021-05-21 23:54:05,978 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-05-21 23:54:05,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3968 states to 3968 states and 10441 transitions. [2021-05-21 23:54:05,983 INFO L78 Accepts]: Start accepts. Automaton has 3968 states and 10441 transitions. Word has length 105 [2021-05-21 23:54:05,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 23:54:05,983 INFO L482 AbstractCegarLoop]: Abstraction has 3968 states and 10441 transitions. [2021-05-21 23:54:05,984 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-05-21 23:54:05,984 INFO L276 IsEmpty]: Start isEmpty. Operand 3968 states and 10441 transitions. [2021-05-21 23:54:05,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-05-21 23:54:05,987 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 23:54:05,987 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-05-21 23:54:05,987 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2021-05-21 23:54:05,987 INFO L430 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-21 23:54:05,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 23:54:05,987 INFO L82 PathProgramCache]: Analyzing trace with hash 910792620, now seen corresponding path program 34 times [2021-05-21 23:54:05,987 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 23:54:05,987 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459833185] [2021-05-21 23:54:05,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 23:54:06,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 23:54:06,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-21 23:54:06,356 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 23:54:06,356 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459833185] [2021-05-21 23:54:06,356 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459833185] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 23:54:06,356 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 23:54:06,357 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-05-21 23:54:06,357 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585484434] [2021-05-21 23:54:06,357 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-05-21 23:54:06,357 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 23:54:06,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-05-21 23:54:06,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2021-05-21 23:54:06,358 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-05-21 23:54:07,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 23:54:07,304 INFO L93 Difference]: Finished difference Result 5105 states and 12779 transitions. [2021-05-21 23:54:07,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-05-21 23:54:07,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-05-21 23:54:07,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 23:54:07,309 INFO L225 Difference]: With dead ends: 5105 [2021-05-21 23:54:07,309 INFO L226 Difference]: Without dead ends: 5105 [2021-05-21 23:54:07,310 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 807.1ms TimeCoverageRelationStatistics Valid=274, Invalid=848, Unknown=0, NotChecked=0, Total=1122 [2021-05-21 23:54:07,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5105 states. [2021-05-21 23:54:07,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5105 to 3971. [2021-05-21 23:54:07,363 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-05-21 23:54:07,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3971 states to 3971 states and 10449 transitions. [2021-05-21 23:54:07,368 INFO L78 Accepts]: Start accepts. Automaton has 3971 states and 10449 transitions. Word has length 105 [2021-05-21 23:54:07,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 23:54:07,368 INFO L482 AbstractCegarLoop]: Abstraction has 3971 states and 10449 transitions. [2021-05-21 23:54:07,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-05-21 23:54:07,368 INFO L276 IsEmpty]: Start isEmpty. Operand 3971 states and 10449 transitions. [2021-05-21 23:54:07,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-05-21 23:54:07,371 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 23:54:07,371 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-05-21 23:54:07,371 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2021-05-21 23:54:07,372 INFO L430 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-21 23:54:07,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 23:54:07,372 INFO L82 PathProgramCache]: Analyzing trace with hash -1936565376, now seen corresponding path program 35 times [2021-05-21 23:54:07,372 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 23:54:07,372 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969492468] [2021-05-21 23:54:07,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 23:54:07,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 23:54:07,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-21 23:54:07,745 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 23:54:07,745 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969492468] [2021-05-21 23:54:07,745 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969492468] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 23:54:07,745 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 23:54:07,746 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-05-21 23:54:07,746 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038782097] [2021-05-21 23:54:07,746 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-05-21 23:54:07,746 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 23:54:07,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-05-21 23:54:07,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2021-05-21 23:54:07,746 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-05-21 23:54:08,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 23:54:08,815 INFO L93 Difference]: Finished difference Result 4879 states and 12300 transitions. [2021-05-21 23:54:08,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-05-21 23:54:08,816 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-05-21 23:54:08,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 23:54:08,820 INFO L225 Difference]: With dead ends: 4879 [2021-05-21 23:54:08,820 INFO L226 Difference]: Without dead ends: 4879 [2021-05-21 23:54:08,820 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 897.7ms TimeCoverageRelationStatistics Valid=299, Invalid=891, Unknown=0, NotChecked=0, Total=1190 [2021-05-21 23:54:08,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4879 states. [2021-05-21 23:54:08,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4879 to 3969. [2021-05-21 23:54:08,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-05-21 23:54:08,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3969 states to 3969 states and 10446 transitions. [2021-05-21 23:54:08,866 INFO L78 Accepts]: Start accepts. Automaton has 3969 states and 10446 transitions. Word has length 105 [2021-05-21 23:54:08,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 23:54:08,866 INFO L482 AbstractCegarLoop]: Abstraction has 3969 states and 10446 transitions. [2021-05-21 23:54:08,866 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-05-21 23:54:08,866 INFO L276 IsEmpty]: Start isEmpty. Operand 3969 states and 10446 transitions. [2021-05-21 23:54:08,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-05-21 23:54:08,870 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 23:54:08,870 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-05-21 23:54:08,870 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2021-05-21 23:54:08,870 INFO L430 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-21 23:54:08,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 23:54:08,870 INFO L82 PathProgramCache]: Analyzing trace with hash 1118177890, now seen corresponding path program 36 times [2021-05-21 23:54:08,870 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 23:54:08,870 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005227226] [2021-05-21 23:54:08,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 23:54:08,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 23:54:09,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-21 23:54:09,167 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 23:54:09,167 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005227226] [2021-05-21 23:54:09,167 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005227226] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 23:54:09,167 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 23:54:09,168 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-05-21 23:54:09,168 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479613792] [2021-05-21 23:54:09,168 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-05-21 23:54:09,168 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 23:54:09,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-05-21 23:54:09,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2021-05-21 23:54:09,168 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-05-21 23:54:10,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 23:54:10,403 INFO L93 Difference]: Finished difference Result 6283 states and 15856 transitions. [2021-05-21 23:54:10,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-05-21 23:54:10,403 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-05-21 23:54:10,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 23:54:10,408 INFO L225 Difference]: With dead ends: 6283 [2021-05-21 23:54:10,409 INFO L226 Difference]: Without dead ends: 6283 [2021-05-21 23:54:10,409 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 995.5ms TimeCoverageRelationStatistics Valid=296, Invalid=826, Unknown=0, NotChecked=0, Total=1122 [2021-05-21 23:54:10,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6283 states. [2021-05-21 23:54:10,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6283 to 3966. [2021-05-21 23:54:10,455 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-05-21 23:54:10,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3966 states to 3966 states and 10438 transitions. [2021-05-21 23:54:10,460 INFO L78 Accepts]: Start accepts. Automaton has 3966 states and 10438 transitions. Word has length 105 [2021-05-21 23:54:10,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 23:54:10,460 INFO L482 AbstractCegarLoop]: Abstraction has 3966 states and 10438 transitions. [2021-05-21 23:54:10,460 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-05-21 23:54:10,460 INFO L276 IsEmpty]: Start isEmpty. Operand 3966 states and 10438 transitions. [2021-05-21 23:54:10,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-05-21 23:54:10,463 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 23:54:10,463 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-05-21 23:54:10,463 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2021-05-21 23:54:10,463 INFO L430 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-21 23:54:10,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 23:54:10,464 INFO L82 PathProgramCache]: Analyzing trace with hash -2120060194, now seen corresponding path program 37 times [2021-05-21 23:54:10,464 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 23:54:10,464 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051287387] [2021-05-21 23:54:10,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 23:54:10,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 23:54:10,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-21 23:54:10,787 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 23:54:10,787 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051287387] [2021-05-21 23:54:10,787 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051287387] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 23:54:10,787 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 23:54:10,787 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-05-21 23:54:10,787 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986111225] [2021-05-21 23:54:10,787 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-05-21 23:54:10,788 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 23:54:10,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-05-21 23:54:10,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2021-05-21 23:54:10,788 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-05-21 23:54:12,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 23:54:12,105 INFO L93 Difference]: Finished difference Result 7673 states and 19508 transitions. [2021-05-21 23:54:12,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-05-21 23:54:12,105 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-05-21 23:54:12,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 23:54:12,112 INFO L225 Difference]: With dead ends: 7673 [2021-05-21 23:54:12,112 INFO L226 Difference]: Without dead ends: 7673 [2021-05-21 23:54:12,113 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 1028.9ms TimeCoverageRelationStatistics Valid=287, Invalid=769, Unknown=0, NotChecked=0, Total=1056 [2021-05-21 23:54:12,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7673 states. [2021-05-21 23:54:12,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7673 to 3894. [2021-05-21 23:54:12,164 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-05-21 23:54:12,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3894 states to 3894 states and 10222 transitions. [2021-05-21 23:54:12,169 INFO L78 Accepts]: Start accepts. Automaton has 3894 states and 10222 transitions. Word has length 105 [2021-05-21 23:54:12,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 23:54:12,169 INFO L482 AbstractCegarLoop]: Abstraction has 3894 states and 10222 transitions. [2021-05-21 23:54:12,169 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-05-21 23:54:12,169 INFO L276 IsEmpty]: Start isEmpty. Operand 3894 states and 10222 transitions. [2021-05-21 23:54:12,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-05-21 23:54:12,172 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 23:54:12,172 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-05-21 23:54:12,173 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2021-05-21 23:54:12,173 INFO L430 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-21 23:54:12,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 23:54:12,173 INFO L82 PathProgramCache]: Analyzing trace with hash -463607158, now seen corresponding path program 38 times [2021-05-21 23:54:12,173 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 23:54:12,173 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291211146] [2021-05-21 23:54:12,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 23:54:12,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 23:54:12,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-21 23:54:12,522 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 23:54:12,522 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291211146] [2021-05-21 23:54:12,522 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1291211146] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 23:54:12,522 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 23:54:12,522 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-05-21 23:54:12,522 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017537970] [2021-05-21 23:54:12,522 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-05-21 23:54:12,523 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 23:54:12,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-05-21 23:54:12,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2021-05-21 23:54:12,523 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-05-21 23:54:13,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 23:54:13,668 INFO L93 Difference]: Finished difference Result 5433 states and 13675 transitions. [2021-05-21 23:54:13,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-05-21 23:54:13,668 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-05-21 23:54:13,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 23:54:13,671 INFO L225 Difference]: With dead ends: 5433 [2021-05-21 23:54:13,671 INFO L226 Difference]: Without dead ends: 5433 [2021-05-21 23:54:13,672 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-05-21 23:54:13,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5433 states. [2021-05-21 23:54:13,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5433 to 3883. [2021-05-21 23:54:13,709 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-05-21 23:54:13,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3883 states to 3883 states and 10194 transitions. [2021-05-21 23:54:13,714 INFO L78 Accepts]: Start accepts. Automaton has 3883 states and 10194 transitions. Word has length 105 [2021-05-21 23:54:13,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 23:54:13,714 INFO L482 AbstractCegarLoop]: Abstraction has 3883 states and 10194 transitions. [2021-05-21 23:54:13,714 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-05-21 23:54:13,714 INFO L276 IsEmpty]: Start isEmpty. Operand 3883 states and 10194 transitions. [2021-05-21 23:54:13,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-05-21 23:54:13,718 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 23:54:13,719 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-05-21 23:54:13,719 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2021-05-21 23:54:13,719 INFO L430 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-21 23:54:13,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 23:54:13,719 INFO L82 PathProgramCache]: Analyzing trace with hash 984002142, now seen corresponding path program 39 times [2021-05-21 23:54:13,719 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 23:54:13,719 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122606150] [2021-05-21 23:54:13,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 23:54:13,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 23:54:14,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-21 23:54:14,005 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 23:54:14,005 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122606150] [2021-05-21 23:54:14,005 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122606150] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 23:54:14,005 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 23:54:14,006 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-05-21 23:54:14,006 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212518166] [2021-05-21 23:54:14,006 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-05-21 23:54:14,006 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 23:54:14,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-05-21 23:54:14,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2021-05-21 23:54:14,006 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-05-21 23:54:15,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 23:54:15,207 INFO L93 Difference]: Finished difference Result 5473 states and 13772 transitions. [2021-05-21 23:54:15,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-05-21 23:54:15,207 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-05-21 23:54:15,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 23:54:15,212 INFO L225 Difference]: With dead ends: 5473 [2021-05-21 23:54:15,212 INFO L226 Difference]: Without dead ends: 5473 [2021-05-21 23:54:15,212 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 985.0ms TimeCoverageRelationStatistics Valid=310, Invalid=880, Unknown=0, NotChecked=0, Total=1190 [2021-05-21 23:54:15,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5473 states. [2021-05-21 23:54:15,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5473 to 3880. [2021-05-21 23:54:15,254 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-05-21 23:54:15,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3880 states to 3880 states and 10186 transitions. [2021-05-21 23:54:15,259 INFO L78 Accepts]: Start accepts. Automaton has 3880 states and 10186 transitions. Word has length 105 [2021-05-21 23:54:15,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 23:54:15,260 INFO L482 AbstractCegarLoop]: Abstraction has 3880 states and 10186 transitions. [2021-05-21 23:54:15,260 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-05-21 23:54:15,260 INFO L276 IsEmpty]: Start isEmpty. Operand 3880 states and 10186 transitions. [2021-05-21 23:54:15,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-05-21 23:54:15,263 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 23:54:15,263 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-05-21 23:54:15,263 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2021-05-21 23:54:15,263 INFO L430 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-21 23:54:15,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 23:54:15,263 INFO L82 PathProgramCache]: Analyzing trace with hash -193844854, now seen corresponding path program 40 times [2021-05-21 23:54:15,263 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 23:54:15,263 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341169985] [2021-05-21 23:54:15,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 23:54:15,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 23:54:15,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-21 23:54:15,540 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 23:54:15,540 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341169985] [2021-05-21 23:54:15,541 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341169985] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 23:54:15,541 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 23:54:15,541 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-05-21 23:54:15,541 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142164604] [2021-05-21 23:54:15,541 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-05-21 23:54:15,541 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 23:54:15,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-05-21 23:54:15,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2021-05-21 23:54:15,542 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-05-21 23:54:17,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 23:54:17,370 INFO L93 Difference]: Finished difference Result 6423 states and 16173 transitions. [2021-05-21 23:54:17,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-05-21 23:54:17,371 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-05-21 23:54:17,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 23:54:17,377 INFO L225 Difference]: With dead ends: 6423 [2021-05-21 23:54:17,377 INFO L226 Difference]: Without dead ends: 6423 [2021-05-21 23:54:17,377 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 1465.6ms TimeCoverageRelationStatistics Valid=435, Invalid=1125, Unknown=0, NotChecked=0, Total=1560 [2021-05-21 23:54:17,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6423 states. [2021-05-21 23:54:17,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6423 to 3091. [2021-05-21 23:54:17,422 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-05-21 23:54:17,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3091 states to 3091 states and 8074 transitions. [2021-05-21 23:54:17,425 INFO L78 Accepts]: Start accepts. Automaton has 3091 states and 8074 transitions. Word has length 105 [2021-05-21 23:54:17,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 23:54:17,426 INFO L482 AbstractCegarLoop]: Abstraction has 3091 states and 8074 transitions. [2021-05-21 23:54:17,426 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-05-21 23:54:17,426 INFO L276 IsEmpty]: Start isEmpty. Operand 3091 states and 8074 transitions. [2021-05-21 23:54:17,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-05-21 23:54:17,428 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 23:54:17,428 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-05-21 23:54:17,428 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2021-05-21 23:54:17,429 INFO L430 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-21 23:54:17,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 23:54:17,429 INFO L82 PathProgramCache]: Analyzing trace with hash -106322846, now seen corresponding path program 41 times [2021-05-21 23:54:17,429 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 23:54:17,429 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59781430] [2021-05-21 23:54:17,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 23:54:17,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 23:54:17,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-21 23:54:17,791 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 23:54:17,791 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59781430] [2021-05-21 23:54:17,791 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [59781430] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 23:54:17,791 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 23:54:17,791 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-05-21 23:54:17,791 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989540619] [2021-05-21 23:54:17,791 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-05-21 23:54:17,791 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 23:54:17,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-05-21 23:54:17,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2021-05-21 23:54:17,792 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-05-21 23:54:19,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 23:54:19,133 INFO L93 Difference]: Finished difference Result 4802 states and 12082 transitions. [2021-05-21 23:54:19,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-05-21 23:54:19,133 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-05-21 23:54:19,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 23:54:19,136 INFO L225 Difference]: With dead ends: 4802 [2021-05-21 23:54:19,136 INFO L226 Difference]: Without dead ends: 4802 [2021-05-21 23:54:19,136 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 1152.8ms TimeCoverageRelationStatistics Valid=321, Invalid=869, Unknown=0, NotChecked=0, Total=1190 [2021-05-21 23:54:19,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4802 states. [2021-05-21 23:54:19,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4802 to 2861. [2021-05-21 23:54:19,168 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-05-21 23:54:19,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2861 states to 2861 states and 7573 transitions. [2021-05-21 23:54:19,172 INFO L78 Accepts]: Start accepts. Automaton has 2861 states and 7573 transitions. Word has length 105 [2021-05-21 23:54:19,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 23:54:19,172 INFO L482 AbstractCegarLoop]: Abstraction has 2861 states and 7573 transitions. [2021-05-21 23:54:19,172 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-05-21 23:54:19,172 INFO L276 IsEmpty]: Start isEmpty. Operand 2861 states and 7573 transitions. [2021-05-21 23:54:19,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2021-05-21 23:54:19,174 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 23:54:19,174 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-05-21 23:54:19,174 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2021-05-21 23:54:19,174 INFO L430 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-21 23:54:19,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 23:54:19,175 INFO L82 PathProgramCache]: Analyzing trace with hash -685691517, now seen corresponding path program 1 times [2021-05-21 23:54:19,175 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 23:54:19,175 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918079443] [2021-05-21 23:54:19,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 23:54:19,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 23:54:19,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-21 23:54:19,930 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 23:54:19,930 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918079443] [2021-05-21 23:54:19,930 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918079443] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 23:54:19,930 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 23:54:19,930 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2021-05-21 23:54:19,930 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793094468] [2021-05-21 23:54:19,931 INFO L462 AbstractCegarLoop]: Interpolant automaton has 28 states [2021-05-21 23:54:19,931 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 23:54:19,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-05-21 23:54:19,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=686, Unknown=0, NotChecked=0, Total=756 [2021-05-21 23:54:19,931 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-05-21 23:54:22,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 23:54:22,291 INFO L93 Difference]: Finished difference Result 3968 states and 10076 transitions. [2021-05-21 23:54:22,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-05-21 23:54:22,292 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-05-21 23:54:22,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 23:54:22,294 INFO L225 Difference]: With dead ends: 3968 [2021-05-21 23:54:22,294 INFO L226 Difference]: Without dead ends: 3877 [2021-05-21 23:54:22,295 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 546 ImplicationChecksByTransitivity, 2201.0ms TimeCoverageRelationStatistics Valid=464, Invalid=2398, Unknown=0, NotChecked=0, Total=2862 [2021-05-21 23:54:22,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3877 states. [2021-05-21 23:54:22,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3877 to 2861. [2021-05-21 23:54:22,323 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-05-21 23:54:22,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2861 states to 2861 states and 7564 transitions. [2021-05-21 23:54:22,326 INFO L78 Accepts]: Start accepts. Automaton has 2861 states and 7564 transitions. Word has length 111 [2021-05-21 23:54:22,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 23:54:22,326 INFO L482 AbstractCegarLoop]: Abstraction has 2861 states and 7564 transitions. [2021-05-21 23:54:22,326 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-05-21 23:54:22,326 INFO L276 IsEmpty]: Start isEmpty. Operand 2861 states and 7564 transitions. [2021-05-21 23:54:22,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2021-05-21 23:54:22,328 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 23:54:22,328 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-05-21 23:54:22,328 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2021-05-21 23:54:22,328 INFO L430 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-21 23:54:22,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 23:54:22,329 INFO L82 PathProgramCache]: Analyzing trace with hash -521604609, now seen corresponding path program 2 times [2021-05-21 23:54:22,329 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 23:54:22,329 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179339486] [2021-05-21 23:54:22,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 23:54:22,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 23:54:23,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-21 23:54:23,052 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 23:54:23,052 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179339486] [2021-05-21 23:54:23,052 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179339486] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 23:54:23,052 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 23:54:23,052 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2021-05-21 23:54:23,052 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450666302] [2021-05-21 23:54:23,052 INFO L462 AbstractCegarLoop]: Interpolant automaton has 26 states [2021-05-21 23:54:23,053 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 23:54:23,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-05-21 23:54:23,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=585, Unknown=0, NotChecked=0, Total=650 [2021-05-21 23:54:23,053 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-05-21 23:54:25,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 23:54:25,425 INFO L93 Difference]: Finished difference Result 4103 states and 10475 transitions. [2021-05-21 23:54:25,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-05-21 23:54:25,427 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-05-21 23:54:25,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 23:54:25,430 INFO L225 Difference]: With dead ends: 4103 [2021-05-21 23:54:25,430 INFO L226 Difference]: Without dead ends: 3946 [2021-05-21 23:54:25,430 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 433 ImplicationChecksByTransitivity, 2234.6ms TimeCoverageRelationStatistics Valid=433, Invalid=2017, Unknown=0, NotChecked=0, Total=2450 [2021-05-21 23:54:25,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3946 states. [2021-05-21 23:54:25,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3946 to 3005. [2021-05-21 23:54:25,458 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-05-21 23:54:25,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3005 states to 3005 states and 7912 transitions. [2021-05-21 23:54:25,462 INFO L78 Accepts]: Start accepts. Automaton has 3005 states and 7912 transitions. Word has length 111 [2021-05-21 23:54:25,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 23:54:25,462 INFO L482 AbstractCegarLoop]: Abstraction has 3005 states and 7912 transitions. [2021-05-21 23:54:25,462 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-05-21 23:54:25,462 INFO L276 IsEmpty]: Start isEmpty. Operand 3005 states and 7912 transitions. [2021-05-21 23:54:25,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2021-05-21 23:54:25,465 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 23:54:25,465 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-05-21 23:54:25,465 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2021-05-21 23:54:25,465 INFO L430 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-21 23:54:25,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 23:54:25,465 INFO L82 PathProgramCache]: Analyzing trace with hash 17765309, now seen corresponding path program 3 times [2021-05-21 23:54:25,465 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 23:54:25,465 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901100141] [2021-05-21 23:54:25,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 23:54:25,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 23:54:26,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-21 23:54:26,122 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 23:54:26,122 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901100141] [2021-05-21 23:54:26,122 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901100141] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 23:54:26,122 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 23:54:26,122 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2021-05-21 23:54:26,122 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644706973] [2021-05-21 23:54:26,122 INFO L462 AbstractCegarLoop]: Interpolant automaton has 26 states [2021-05-21 23:54:26,122 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 23:54:26,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-05-21 23:54:26,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=586, Unknown=0, NotChecked=0, Total=650 [2021-05-21 23:54:26,123 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-05-21 23:54:28,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 23:54:28,611 INFO L93 Difference]: Finished difference Result 4001 states and 10200 transitions. [2021-05-21 23:54:28,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-05-21 23:54:28,611 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-05-21 23:54:28,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 23:54:28,615 INFO L225 Difference]: With dead ends: 4001 [2021-05-21 23:54:28,615 INFO L226 Difference]: Without dead ends: 3910 [2021-05-21 23:54:28,615 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 450 ImplicationChecksByTransitivity, 2260.8ms TimeCoverageRelationStatistics Valid=450, Invalid=2100, Unknown=0, NotChecked=0, Total=2550 [2021-05-21 23:54:28,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3910 states. [2021-05-21 23:54:28,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3910 to 2969. [2021-05-21 23:54:28,644 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-05-21 23:54:28,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2969 states to 2969 states and 7816 transitions. [2021-05-21 23:54:28,648 INFO L78 Accepts]: Start accepts. Automaton has 2969 states and 7816 transitions. Word has length 111 [2021-05-21 23:54:28,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 23:54:28,648 INFO L482 AbstractCegarLoop]: Abstraction has 2969 states and 7816 transitions. [2021-05-21 23:54:28,648 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-05-21 23:54:28,648 INFO L276 IsEmpty]: Start isEmpty. Operand 2969 states and 7816 transitions. [2021-05-21 23:54:28,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2021-05-21 23:54:28,650 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 23:54:28,650 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-05-21 23:54:28,650 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2021-05-21 23:54:28,650 INFO L430 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-21 23:54:28,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 23:54:28,651 INFO L82 PathProgramCache]: Analyzing trace with hash -217387965, now seen corresponding path program 4 times [2021-05-21 23:54:28,651 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 23:54:28,651 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725989907] [2021-05-21 23:54:28,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 23:54:28,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 23:54:29,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-21 23:54:29,390 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 23:54:29,390 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725989907] [2021-05-21 23:54:29,390 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725989907] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 23:54:29,390 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 23:54:29,390 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2021-05-21 23:54:29,390 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136274650] [2021-05-21 23:54:29,390 INFO L462 AbstractCegarLoop]: Interpolant automaton has 26 states [2021-05-21 23:54:29,390 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 23:54:29,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-05-21 23:54:29,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=589, Unknown=0, NotChecked=0, Total=650 [2021-05-21 23:54:29,390 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-05-21 23:54:30,533 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 63 [2021-05-21 23:54:31,061 WARN L205 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 66 [2021-05-21 23:54:31,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 23:54:31,688 INFO L93 Difference]: Finished difference Result 3940 states and 10067 transitions. [2021-05-21 23:54:31,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-05-21 23:54:31,688 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-05-21 23:54:31,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 23:54:31,691 INFO L225 Difference]: With dead ends: 3940 [2021-05-21 23:54:31,691 INFO L226 Difference]: Without dead ends: 3801 [2021-05-21 23:54:31,692 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 373 ImplicationChecksByTransitivity, 2204.5ms TimeCoverageRelationStatistics Valid=402, Invalid=1950, Unknown=0, NotChecked=0, Total=2352 [2021-05-21 23:54:31,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3801 states. [2021-05-21 23:54:31,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3801 to 2897. [2021-05-21 23:54:31,719 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-05-21 23:54:31,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2897 states to 2897 states and 7624 transitions. [2021-05-21 23:54:31,723 INFO L78 Accepts]: Start accepts. Automaton has 2897 states and 7624 transitions. Word has length 111 [2021-05-21 23:54:31,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 23:54:31,723 INFO L482 AbstractCegarLoop]: Abstraction has 2897 states and 7624 transitions. [2021-05-21 23:54:31,723 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-05-21 23:54:31,723 INFO L276 IsEmpty]: Start isEmpty. Operand 2897 states and 7624 transitions. [2021-05-21 23:54:31,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2021-05-21 23:54:31,725 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 23:54:31,725 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-05-21 23:54:31,725 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2021-05-21 23:54:31,725 INFO L430 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-21 23:54:31,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 23:54:31,725 INFO L82 PathProgramCache]: Analyzing trace with hash -1564019739, now seen corresponding path program 5 times [2021-05-21 23:54:31,725 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 23:54:31,725 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758677867] [2021-05-21 23:54:31,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 23:54:31,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 23:54:32,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-21 23:54:32,385 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 23:54:32,385 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758677867] [2021-05-21 23:54:32,385 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758677867] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 23:54:32,385 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 23:54:32,385 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2021-05-21 23:54:32,385 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967372688] [2021-05-21 23:54:32,385 INFO L462 AbstractCegarLoop]: Interpolant automaton has 26 states [2021-05-21 23:54:32,385 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 23:54:32,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-05-21 23:54:32,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=586, Unknown=0, NotChecked=0, Total=650 [2021-05-21 23:54:32,386 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-05-21 23:54:33,994 WARN L205 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 65 [2021-05-21 23:54:34,135 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 60 [2021-05-21 23:54:34,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 23:54:34,670 INFO L93 Difference]: Finished difference Result 3874 states and 9888 transitions. [2021-05-21 23:54:34,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-05-21 23:54:34,670 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-05-21 23:54:34,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 23:54:34,674 INFO L225 Difference]: With dead ends: 3874 [2021-05-21 23:54:34,674 INFO L226 Difference]: Without dead ends: 3657 [2021-05-21 23:54:34,674 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 407 ImplicationChecksByTransitivity, 2129.8ms TimeCoverageRelationStatistics Valid=405, Invalid=1947, Unknown=0, NotChecked=0, Total=2352 [2021-05-21 23:54:34,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3657 states. [2021-05-21 23:54:34,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3657 to 2753. [2021-05-21 23:54:34,699 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-05-21 23:54:34,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2753 states to 2753 states and 7249 transitions. [2021-05-21 23:54:34,702 INFO L78 Accepts]: Start accepts. Automaton has 2753 states and 7249 transitions. Word has length 111 [2021-05-21 23:54:34,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 23:54:34,702 INFO L482 AbstractCegarLoop]: Abstraction has 2753 states and 7249 transitions. [2021-05-21 23:54:34,702 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-05-21 23:54:34,703 INFO L276 IsEmpty]: Start isEmpty. Operand 2753 states and 7249 transitions. [2021-05-21 23:54:34,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2021-05-21 23:54:34,704 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 23:54:34,705 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-05-21 23:54:34,705 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2021-05-21 23:54:34,705 INFO L430 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-21 23:54:34,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 23:54:34,705 INFO L82 PathProgramCache]: Analyzing trace with hash 857328187, now seen corresponding path program 6 times [2021-05-21 23:54:34,705 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 23:54:34,705 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502078753] [2021-05-21 23:54:34,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 23:54:34,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 23:54:35,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-21 23:54:35,565 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 23:54:35,565 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502078753] [2021-05-21 23:54:35,565 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502078753] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 23:54:35,566 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 23:54:35,566 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2021-05-21 23:54:35,566 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793208217] [2021-05-21 23:54:35,566 INFO L462 AbstractCegarLoop]: Interpolant automaton has 30 states [2021-05-21 23:54:35,566 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 23:54:35,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-05-21 23:54:35,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=793, Unknown=0, NotChecked=0, Total=870 [2021-05-21 23:54:35,567 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-05-21 23:54:38,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 23:54:38,398 INFO L93 Difference]: Finished difference Result 3749 states and 9472 transitions. [2021-05-21 23:54:38,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2021-05-21 23:54:38,398 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-05-21 23:54:38,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 23:54:38,402 INFO L225 Difference]: With dead ends: 3749 [2021-05-21 23:54:38,402 INFO L226 Difference]: Without dead ends: 3658 [2021-05-21 23:54:38,402 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 653 ImplicationChecksByTransitivity, 2583.6ms TimeCoverageRelationStatistics Valid=582, Invalid=2958, Unknown=0, NotChecked=0, Total=3540 [2021-05-21 23:54:38,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3658 states. [2021-05-21 23:54:38,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3658 to 2759. [2021-05-21 23:54:38,432 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-05-21 23:54:38,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2759 states to 2759 states and 7258 transitions. [2021-05-21 23:54:38,435 INFO L78 Accepts]: Start accepts. Automaton has 2759 states and 7258 transitions. Word has length 111 [2021-05-21 23:54:38,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 23:54:38,435 INFO L482 AbstractCegarLoop]: Abstraction has 2759 states and 7258 transitions. [2021-05-21 23:54:38,435 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-05-21 23:54:38,436 INFO L276 IsEmpty]: Start isEmpty. Operand 2759 states and 7258 transitions. [2021-05-21 23:54:38,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2021-05-21 23:54:38,438 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 23:54:38,438 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-05-21 23:54:38,438 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2021-05-21 23:54:38,438 INFO L430 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-21 23:54:38,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 23:54:38,438 INFO L82 PathProgramCache]: Analyzing trace with hash 1824706281, now seen corresponding path program 7 times [2021-05-21 23:54:38,438 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 23:54:38,438 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035250301] [2021-05-21 23:54:38,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 23:54:38,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-05-21 23:54:38,463 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-05-21 23:54:38,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-05-21 23:54:38,491 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-05-21 23:54:38,530 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-05-21 23:54:38,531 INFO L622 BasicCegarLoop]: Counterexample might be feasible [2021-05-21 23:54:38,531 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2021-05-21 23:54:38,531 INFO L315 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was UNSAFE (1/2) [2021-05-21 23:54:38,534 INFO L255 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-05-21 23:54:38,534 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-05-21 23:54:38,534 INFO L379 AbstractCegarLoop]: Hoare is false [2021-05-21 23:54:38,534 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-05-21 23:54:38,534 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-05-21 23:54:38,534 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-05-21 23:54:38,535 INFO L383 AbstractCegarLoop]: Difference is false [2021-05-21 23:54:38,535 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-05-21 23:54:38,535 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == InUseError======== [2021-05-21 23:54:38,537 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 158 places, 162 transitions, 346 flow [2021-05-21 23:54:38,614 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-05-21 23:54:38,620 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-05-21 23:54:38,632 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-05-21 23:54:38,632 INFO L315 ceAbstractionStarter]: Result for error location InUseError was SAFE (2/2) [2021-05-21 23:54:38,632 INFO L246 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-05-21 23:54:38,706 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.05 11:54:38 BasicIcfg [2021-05-21 23:54:38,706 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-05-21 23:54:38,707 INFO L168 Benchmark]: Toolchain (without parser) took 98412.13 ms. Allocated memory was 333.4 MB in the beginning and 1.3 GB in the end (delta: 996.1 MB). Free memory was 314.1 MB in the beginning and 646.6 MB in the end (delta: -332.5 MB). Peak memory consumption was 664.4 MB. Max. memory is 16.0 GB. [2021-05-21 23:54:38,707 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 333.4 MB. Free memory is still 313.7 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-05-21 23:54:38,707 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1558.54 ms. Allocated memory is still 333.4 MB. Free memory was 314.1 MB in the beginning and 272.9 MB in the end (delta: 41.2 MB). Peak memory consumption was 92.3 MB. Max. memory is 16.0 GB. [2021-05-21 23:54:38,707 INFO L168 Benchmark]: Boogie Procedure Inliner took 84.04 ms. Allocated memory is still 333.4 MB. Free memory was 272.9 MB in the beginning and 269.7 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. [2021-05-21 23:54:38,707 INFO L168 Benchmark]: Boogie Preprocessor took 43.43 ms. Allocated memory is still 333.4 MB. Free memory was 269.7 MB in the beginning and 266.6 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-05-21 23:54:38,707 INFO L168 Benchmark]: RCFGBuilder took 629.91 ms. Allocated memory is still 333.4 MB. Free memory was 266.6 MB in the beginning and 218.3 MB in the end (delta: 48.2 MB). Peak memory consumption was 48.2 MB. Max. memory is 16.0 GB. [2021-05-21 23:54:38,707 INFO L168 Benchmark]: TraceAbstraction took 96091.10 ms. Allocated memory was 333.4 MB in the beginning and 1.3 GB in the end (delta: 996.1 MB). Free memory was 217.3 MB in the beginning and 646.6 MB in the end (delta: -429.3 MB). Peak memory consumption was 566.9 MB. Max. memory is 16.0 GB. [2021-05-21 23:54:38,708 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.13 ms. Allocated memory is still 333.4 MB. Free memory is still 313.7 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 1558.54 ms. Allocated memory is still 333.4 MB. Free memory was 314.1 MB in the beginning and 272.9 MB in the end (delta: 41.2 MB). Peak memory consumption was 92.3 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 84.04 ms. Allocated memory is still 333.4 MB. Free memory was 272.9 MB in the beginning and 269.7 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 43.43 ms. Allocated memory is still 333.4 MB. Free memory was 269.7 MB in the beginning and 266.6 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 629.91 ms. Allocated memory is still 333.4 MB. Free memory was 266.6 MB in the beginning and 218.3 MB in the end (delta: 48.2 MB). Peak memory consumption was 48.2 MB. Max. memory is 16.0 GB. * TraceAbstraction took 96091.10 ms. Allocated memory was 333.4 MB in the beginning and 1.3 GB in the end (delta: 996.1 MB). Free memory was 217.3 MB in the beginning and 646.6 MB in the end (delta: -429.3 MB). Peak memory consumption was 566.9 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: 95782.2ms, OverallIterations: 56, TraceHistogramMax: 1, EmptinessCheckTime: 250.6ms, AutomataDifference: 69059.9ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 153.7ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 10537 SDtfs, 33224 SDslu, 73811 SDs, 0 SdLazy, 36316 SolverSat, 3000 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 18434.5ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2040 GetRequests, 171 SyntacticMatches, 64 SemanticMatches, 1805 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10680 ImplicationChecksByTransitivity, 57850.9ms 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: 3319.3ms AutomataMinimizationTime, 55 MinimizatonAttempts, 63516 StatesRemovedByMinimization, 54 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 131.0ms SsaConstructionTime, 1153.9ms SatisfiabilityAnalysisTime, 20946.6ms 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 - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency with 1 thread instances CFG has 4 procedures, 164 locations, 8 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 97.6ms, OverallIterations: 0, TraceHistogramMax: 0, EmptinessCheckTime: 17.1ms, AutomataDifference: 0.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 79.9ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=4278occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...