/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/seq-mthreaded/pals_STARTPALS_ActiveStandby.5.ufo.UNBOUNDED.pals.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 01:09:04,725 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 01:09:04,726 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 01:09:04,784 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 01:09:04,785 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 01:09:04,787 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 01:09:04,789 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 01:09:04,791 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 01:09:04,792 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 01:09:04,795 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 01:09:04,796 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 01:09:04,797 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 01:09:04,797 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 01:09:04,799 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 01:09:04,800 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 01:09:04,804 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 01:09:04,804 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 01:09:04,805 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 01:09:04,806 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 01:09:04,811 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 01:09:04,812 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 01:09:04,813 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 01:09:04,814 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 01:09:04,814 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 01:09:04,819 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 01:09:04,819 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 01:09:04,819 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 01:09:04,820 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 01:09:04,821 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 01:09:04,821 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 01:09:04,821 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 01:09:04,822 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 01:09:04,823 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 01:09:04,823 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 01:09:04,824 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 01:09:04,824 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 01:09:04,825 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 01:09:04,825 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 01:09:04,825 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 01:09:04,825 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 01:09:04,826 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 01:09:04,827 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_Default.epf [2022-01-10 01:09:04,850 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 01:09:04,850 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 01:09:04,850 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 01:09:04,850 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 01:09:04,851 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-10 01:09:04,851 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-10 01:09:04,851 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 01:09:04,851 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 01:09:04,851 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 01:09:04,852 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 01:09:04,852 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 01:09:04,852 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 01:09:04,852 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 01:09:04,852 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 01:09:04,852 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 01:09:04,852 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 01:09:04,852 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 01:09:04,852 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 01:09:04,852 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 01:09:04,852 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 01:09:04,852 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 01:09:04,853 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 01:09:04,853 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 01:09:04,853 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 01:09:04,853 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 01:09:04,853 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-10 01:09:04,853 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-10 01:09:04,853 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 01:09:04,853 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 01:09:04,853 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 01:09:04,853 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-01-10 01:09:05,054 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 01:09:05,071 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 01:09:05,073 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 01:09:05,074 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 01:09:05,074 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 01:09:05,075 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded/pals_STARTPALS_ActiveStandby.5.ufo.UNBOUNDED.pals.c [2022-01-10 01:09:05,149 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/81fce2aba/d7c8175f100142198ca9b37673412e4f/FLAGf9053e7bb [2022-01-10 01:09:05,701 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 01:09:05,701 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded/pals_STARTPALS_ActiveStandby.5.ufo.UNBOUNDED.pals.c [2022-01-10 01:09:05,712 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/81fce2aba/d7c8175f100142198ca9b37673412e4f/FLAGf9053e7bb [2022-01-10 01:09:06,026 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/81fce2aba/d7c8175f100142198ca9b37673412e4f [2022-01-10 01:09:06,028 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 01:09:06,030 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-10 01:09:06,032 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 01:09:06,032 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 01:09:06,034 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 01:09:06,034 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:09:06" (1/1) ... [2022-01-10 01:09:06,035 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e710472 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:09:06, skipping insertion in model container [2022-01-10 01:09:06,035 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:09:06" (1/1) ... [2022-01-10 01:09:06,039 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 01:09:06,073 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 01:09:06,327 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded/pals_STARTPALS_ActiveStandby.5.ufo.UNBOUNDED.pals.c[14577,14590] [2022-01-10 01:09:06,329 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 01:09:06,334 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 01:09:06,368 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded/pals_STARTPALS_ActiveStandby.5.ufo.UNBOUNDED.pals.c[14577,14590] [2022-01-10 01:09:06,368 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 01:09:06,377 INFO L208 MainTranslator]: Completed translation [2022-01-10 01:09:06,378 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:09:06 WrapperNode [2022-01-10 01:09:06,378 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 01:09:06,379 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 01:09:06,379 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 01:09:06,379 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 01:09:06,383 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:09:06" (1/1) ... [2022-01-10 01:09:06,397 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:09:06" (1/1) ... [2022-01-10 01:09:06,432 INFO L137 Inliner]: procedures = 32, calls = 47, calls flagged for inlining = 13, calls inlined = 13, statements flattened = 536 [2022-01-10 01:09:06,432 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 01:09:06,433 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 01:09:06,433 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 01:09:06,433 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 01:09:06,438 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:09:06" (1/1) ... [2022-01-10 01:09:06,438 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:09:06" (1/1) ... [2022-01-10 01:09:06,441 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:09:06" (1/1) ... [2022-01-10 01:09:06,441 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:09:06" (1/1) ... [2022-01-10 01:09:06,447 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:09:06" (1/1) ... [2022-01-10 01:09:06,451 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:09:06" (1/1) ... [2022-01-10 01:09:06,452 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:09:06" (1/1) ... [2022-01-10 01:09:06,455 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 01:09:06,455 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 01:09:06,455 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 01:09:06,455 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 01:09:06,456 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:09:06" (1/1) ... [2022-01-10 01:09:06,460 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 01:09:06,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 01:09:06,477 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-10 01:09:06,509 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-01-10 01:09:06,518 INFO L130 BoogieDeclarations]: Found specification of procedure read_manual_selection_history [2022-01-10 01:09:06,518 INFO L138 BoogieDeclarations]: Found implementation of procedure read_manual_selection_history [2022-01-10 01:09:06,518 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 01:09:06,518 INFO L130 BoogieDeclarations]: Found specification of procedure read_side2_failed_history [2022-01-10 01:09:06,518 INFO L138 BoogieDeclarations]: Found implementation of procedure read_side2_failed_history [2022-01-10 01:09:06,518 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2022-01-10 01:09:06,518 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2022-01-10 01:09:06,519 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-01-10 01:09:06,519 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-01-10 01:09:06,519 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-10 01:09:06,519 INFO L130 BoogieDeclarations]: Found specification of procedure read_side1_failed_history [2022-01-10 01:09:06,519 INFO L138 BoogieDeclarations]: Found implementation of procedure read_side1_failed_history [2022-01-10 01:09:06,519 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 01:09:06,519 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 01:09:06,519 INFO L130 BoogieDeclarations]: Found specification of procedure read_active_side_history [2022-01-10 01:09:06,519 INFO L138 BoogieDeclarations]: Found implementation of procedure read_active_side_history [2022-01-10 01:09:06,599 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 01:09:06,600 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 01:09:07,016 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 01:09:07,022 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 01:09:07,022 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-01-10 01:09:07,024 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:09:07 BoogieIcfgContainer [2022-01-10 01:09:07,024 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 01:09:07,025 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 01:09:07,025 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 01:09:07,027 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 01:09:07,027 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 01:09:06" (1/3) ... [2022-01-10 01:09:07,027 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37a94766 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:09:07, skipping insertion in model container [2022-01-10 01:09:07,028 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:09:06" (2/3) ... [2022-01-10 01:09:07,028 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37a94766 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:09:07, skipping insertion in model container [2022-01-10 01:09:07,028 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:09:07" (3/3) ... [2022-01-10 01:09:07,029 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_ActiveStandby.5.ufo.UNBOUNDED.pals.c [2022-01-10 01:09:07,032 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 01:09:07,032 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-10 01:09:07,074 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 01:09:07,081 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-01-10 01:09:07,081 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-10 01:09:07,099 INFO L276 IsEmpty]: Start isEmpty. Operand has 199 states, 162 states have (on average 1.5617283950617284) internal successors, (253), 164 states have internal predecessors, (253), 29 states have call successors, (29), 6 states have call predecessors, (29), 6 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2022-01-10 01:09:07,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-01-10 01:09:07,106 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 01:09:07,107 INFO L514 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] [2022-01-10 01:09:07,107 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 01:09:07,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 01:09:07,111 INFO L85 PathProgramCache]: Analyzing trace with hash 11515241, now seen corresponding path program 1 times [2022-01-10 01:09:07,117 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 01:09:07,117 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894989230] [2022-01-10 01:09:07,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:09:07,119 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 01:09:07,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:07,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 01:09:07,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:07,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 01:09:07,283 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 01:09:07,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894989230] [2022-01-10 01:09:07,284 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894989230] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 01:09:07,284 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 01:09:07,285 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 01:09:07,286 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172443023] [2022-01-10 01:09:07,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 01:09:07,290 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-01-10 01:09:07,290 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 01:09:07,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-01-10 01:09:07,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-10 01:09:07,318 INFO L87 Difference]: Start difference. First operand has 199 states, 162 states have (on average 1.5617283950617284) internal successors, (253), 164 states have internal predecessors, (253), 29 states have call successors, (29), 6 states have call predecessors, (29), 6 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) Second operand has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-10 01:09:07,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 01:09:07,377 INFO L93 Difference]: Finished difference Result 378 states and 619 transitions. [2022-01-10 01:09:07,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-01-10 01:09:07,380 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2022-01-10 01:09:07,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 01:09:07,390 INFO L225 Difference]: With dead ends: 378 [2022-01-10 01:09:07,390 INFO L226 Difference]: Without dead ends: 195 [2022-01-10 01:09:07,398 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-10 01:09:07,401 INFO L933 BasicCegarLoop]: 298 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 01:09:07,402 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 298 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 01:09:07,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2022-01-10 01:09:07,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 195. [2022-01-10 01:09:07,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 159 states have (on average 1.509433962264151) internal successors, (240), 160 states have internal predecessors, (240), 29 states have call successors, (29), 6 states have call predecessors, (29), 6 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2022-01-10 01:09:07,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 298 transitions. [2022-01-10 01:09:07,453 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 298 transitions. Word has length 44 [2022-01-10 01:09:07,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 01:09:07,453 INFO L470 AbstractCegarLoop]: Abstraction has 195 states and 298 transitions. [2022-01-10 01:09:07,454 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-10 01:09:07,454 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 298 transitions. [2022-01-10 01:09:07,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-01-10 01:09:07,456 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 01:09:07,456 INFO L514 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] [2022-01-10 01:09:07,457 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-10 01:09:07,457 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 01:09:07,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 01:09:07,459 INFO L85 PathProgramCache]: Analyzing trace with hash -419952089, now seen corresponding path program 1 times [2022-01-10 01:09:07,459 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 01:09:07,459 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526629981] [2022-01-10 01:09:07,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:09:07,460 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 01:09:07,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:07,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 01:09:07,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:07,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 01:09:07,595 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 01:09:07,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526629981] [2022-01-10 01:09:07,596 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526629981] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 01:09:07,596 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 01:09:07,596 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-10 01:09:07,596 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697036492] [2022-01-10 01:09:07,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 01:09:07,597 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 01:09:07,597 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 01:09:07,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 01:09:07,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-10 01:09:07,598 INFO L87 Difference]: Start difference. First operand 195 states and 298 transitions. Second operand has 6 states, 5 states have (on average 8.0) internal successors, (40), 6 states have internal predecessors, (40), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-10 01:09:07,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 01:09:07,679 INFO L93 Difference]: Finished difference Result 376 states and 570 transitions. [2022-01-10 01:09:07,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-10 01:09:07,679 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.0) internal successors, (40), 6 states have internal predecessors, (40), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2022-01-10 01:09:07,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 01:09:07,680 INFO L225 Difference]: With dead ends: 376 [2022-01-10 01:09:07,681 INFO L226 Difference]: Without dead ends: 195 [2022-01-10 01:09:07,684 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-01-10 01:09:07,685 INFO L933 BasicCegarLoop]: 294 mSDtfsCounter, 171 mSDsluCounter, 961 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 1255 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 01:09:07,685 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [195 Valid, 1255 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 01:09:07,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2022-01-10 01:09:07,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 195. [2022-01-10 01:09:07,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 159 states have (on average 1.4339622641509433) internal successors, (228), 160 states have internal predecessors, (228), 29 states have call successors, (29), 6 states have call predecessors, (29), 6 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2022-01-10 01:09:07,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 286 transitions. [2022-01-10 01:09:07,708 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 286 transitions. Word has length 44 [2022-01-10 01:09:07,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 01:09:07,710 INFO L470 AbstractCegarLoop]: Abstraction has 195 states and 286 transitions. [2022-01-10 01:09:07,711 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.0) internal successors, (40), 6 states have internal predecessors, (40), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-10 01:09:07,711 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 286 transitions. [2022-01-10 01:09:07,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-01-10 01:09:07,712 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 01:09:07,712 INFO L514 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] [2022-01-10 01:09:07,712 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-10 01:09:07,712 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 01:09:07,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 01:09:07,713 INFO L85 PathProgramCache]: Analyzing trace with hash -752782365, now seen corresponding path program 1 times [2022-01-10 01:09:07,713 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 01:09:07,713 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199589696] [2022-01-10 01:09:07,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:09:07,713 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 01:09:07,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:07,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-01-10 01:09:07,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:07,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 01:09:07,856 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 01:09:07,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199589696] [2022-01-10 01:09:07,857 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199589696] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 01:09:07,857 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 01:09:07,857 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 01:09:07,857 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469670623] [2022-01-10 01:09:07,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 01:09:07,858 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 01:09:07,858 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 01:09:07,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 01:09:07,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 01:09:07,858 INFO L87 Difference]: Start difference. First operand 195 states and 286 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-10 01:09:07,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 01:09:07,916 INFO L93 Difference]: Finished difference Result 377 states and 562 transitions. [2022-01-10 01:09:07,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 01:09:07,917 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 55 [2022-01-10 01:09:07,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 01:09:07,919 INFO L225 Difference]: With dead ends: 377 [2022-01-10 01:09:07,919 INFO L226 Difference]: Without dead ends: 199 [2022-01-10 01:09:07,923 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-10 01:09:07,930 INFO L933 BasicCegarLoop]: 280 mSDtfsCounter, 5 mSDsluCounter, 550 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 830 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 01:09:07,930 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 830 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 01:09:07,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2022-01-10 01:09:07,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 199. [2022-01-10 01:09:07,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 162 states have (on average 1.4259259259259258) internal successors, (231), 163 states have internal predecessors, (231), 29 states have call successors, (29), 7 states have call predecessors, (29), 7 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2022-01-10 01:09:07,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 289 transitions. [2022-01-10 01:09:07,939 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 289 transitions. Word has length 55 [2022-01-10 01:09:07,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 01:09:07,939 INFO L470 AbstractCegarLoop]: Abstraction has 199 states and 289 transitions. [2022-01-10 01:09:07,940 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-10 01:09:07,940 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 289 transitions. [2022-01-10 01:09:07,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-01-10 01:09:07,941 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 01:09:07,941 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 01:09:07,943 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-10 01:09:07,943 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 01:09:07,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 01:09:07,944 INFO L85 PathProgramCache]: Analyzing trace with hash 1335268689, now seen corresponding path program 1 times [2022-01-10 01:09:07,944 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 01:09:07,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312309656] [2022-01-10 01:09:07,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:09:07,944 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 01:09:08,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:08,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-01-10 01:09:08,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:08,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-01-10 01:09:08,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:08,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-01-10 01:09:08,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:08,091 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-10 01:09:08,091 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 01:09:08,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312309656] [2022-01-10 01:09:08,091 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312309656] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 01:09:08,091 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 01:09:08,091 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 01:09:08,092 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958882800] [2022-01-10 01:09:08,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 01:09:08,092 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 01:09:08,092 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 01:09:08,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 01:09:08,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 01:09:08,093 INFO L87 Difference]: Start difference. First operand 199 states and 289 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-10 01:09:08,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 01:09:08,131 INFO L93 Difference]: Finished difference Result 543 states and 801 transitions. [2022-01-10 01:09:08,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 01:09:08,132 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 71 [2022-01-10 01:09:08,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 01:09:08,136 INFO L225 Difference]: With dead ends: 543 [2022-01-10 01:09:08,136 INFO L226 Difference]: Without dead ends: 361 [2022-01-10 01:09:08,137 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 01:09:08,143 INFO L933 BasicCegarLoop]: 326 mSDtfsCounter, 222 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 597 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 01:09:08,145 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [222 Valid, 597 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 01:09:08,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2022-01-10 01:09:08,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 352. [2022-01-10 01:09:08,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 352 states, 280 states have (on average 1.4464285714285714) internal successors, (405), 282 states have internal predecessors, (405), 57 states have call successors, (57), 14 states have call predecessors, (57), 14 states have return successors, (57), 56 states have call predecessors, (57), 57 states have call successors, (57) [2022-01-10 01:09:08,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 519 transitions. [2022-01-10 01:09:08,181 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 519 transitions. Word has length 71 [2022-01-10 01:09:08,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 01:09:08,182 INFO L470 AbstractCegarLoop]: Abstraction has 352 states and 519 transitions. [2022-01-10 01:09:08,182 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-10 01:09:08,182 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 519 transitions. [2022-01-10 01:09:08,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-01-10 01:09:08,188 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 01:09:08,188 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 01:09:08,189 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-10 01:09:08,189 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 01:09:08,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 01:09:08,189 INFO L85 PathProgramCache]: Analyzing trace with hash -900788511, now seen corresponding path program 1 times [2022-01-10 01:09:08,189 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 01:09:08,189 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402583976] [2022-01-10 01:09:08,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:09:08,190 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 01:09:08,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:08,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-01-10 01:09:08,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:08,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-01-10 01:09:08,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:08,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-01-10 01:09:08,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:08,296 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-10 01:09:08,296 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 01:09:08,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402583976] [2022-01-10 01:09:08,296 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402583976] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 01:09:08,296 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 01:09:08,296 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 01:09:08,296 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183214378] [2022-01-10 01:09:08,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 01:09:08,297 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 01:09:08,297 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 01:09:08,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 01:09:08,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 01:09:08,298 INFO L87 Difference]: Start difference. First operand 352 states and 519 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-10 01:09:08,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 01:09:08,506 INFO L93 Difference]: Finished difference Result 1012 states and 1519 transitions. [2022-01-10 01:09:08,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 01:09:08,506 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 72 [2022-01-10 01:09:08,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 01:09:08,511 INFO L225 Difference]: With dead ends: 1012 [2022-01-10 01:09:08,511 INFO L226 Difference]: Without dead ends: 677 [2022-01-10 01:09:08,512 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-01-10 01:09:08,513 INFO L933 BasicCegarLoop]: 275 mSDtfsCounter, 761 mSDsluCounter, 465 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 761 SdHoareTripleChecker+Valid, 740 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 01:09:08,513 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [761 Valid, 740 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-10 01:09:08,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 677 states. [2022-01-10 01:09:08,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 677 to 446. [2022-01-10 01:09:08,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 446 states, 370 states have (on average 1.4324324324324325) internal successors, (530), 371 states have internal predecessors, (530), 59 states have call successors, (59), 16 states have call predecessors, (59), 16 states have return successors, (59), 58 states have call predecessors, (59), 59 states have call successors, (59) [2022-01-10 01:09:08,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 648 transitions. [2022-01-10 01:09:08,543 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 648 transitions. Word has length 72 [2022-01-10 01:09:08,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 01:09:08,544 INFO L470 AbstractCegarLoop]: Abstraction has 446 states and 648 transitions. [2022-01-10 01:09:08,544 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-10 01:09:08,544 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 648 transitions. [2022-01-10 01:09:08,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-01-10 01:09:08,545 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 01:09:08,545 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 01:09:08,545 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-10 01:09:08,545 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 01:09:08,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 01:09:08,546 INFO L85 PathProgramCache]: Analyzing trace with hash 763300850, now seen corresponding path program 1 times [2022-01-10 01:09:08,546 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 01:09:08,546 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651797949] [2022-01-10 01:09:08,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:09:08,546 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 01:09:08,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:08,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-01-10 01:09:08,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:08,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-01-10 01:09:08,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:08,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-01-10 01:09:08,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:08,641 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-10 01:09:08,641 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 01:09:08,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651797949] [2022-01-10 01:09:08,641 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [651797949] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 01:09:08,641 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 01:09:08,641 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 01:09:08,642 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131600235] [2022-01-10 01:09:08,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 01:09:08,643 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 01:09:08,643 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 01:09:08,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 01:09:08,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 01:09:08,643 INFO L87 Difference]: Start difference. First operand 446 states and 648 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-10 01:09:08,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 01:09:08,869 INFO L93 Difference]: Finished difference Result 1014 states and 1519 transitions. [2022-01-10 01:09:08,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 01:09:08,869 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 73 [2022-01-10 01:09:08,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 01:09:08,872 INFO L225 Difference]: With dead ends: 1014 [2022-01-10 01:09:08,872 INFO L226 Difference]: Without dead ends: 679 [2022-01-10 01:09:08,874 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-01-10 01:09:08,874 INFO L933 BasicCegarLoop]: 275 mSDtfsCounter, 758 mSDsluCounter, 467 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 758 SdHoareTripleChecker+Valid, 742 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 01:09:08,874 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [758 Valid, 742 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-10 01:09:08,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 679 states. [2022-01-10 01:09:08,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 679 to 450. [2022-01-10 01:09:08,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 450 states, 374 states have (on average 1.427807486631016) internal successors, (534), 375 states have internal predecessors, (534), 59 states have call successors, (59), 16 states have call predecessors, (59), 16 states have return successors, (59), 58 states have call predecessors, (59), 59 states have call successors, (59) [2022-01-10 01:09:08,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 652 transitions. [2022-01-10 01:09:08,908 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 652 transitions. Word has length 73 [2022-01-10 01:09:08,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 01:09:08,908 INFO L470 AbstractCegarLoop]: Abstraction has 450 states and 652 transitions. [2022-01-10 01:09:08,908 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-10 01:09:08,908 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 652 transitions. [2022-01-10 01:09:08,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-01-10 01:09:08,910 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 01:09:08,910 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 01:09:08,910 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-10 01:09:08,910 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 01:09:08,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 01:09:08,910 INFO L85 PathProgramCache]: Analyzing trace with hash -1861521472, now seen corresponding path program 1 times [2022-01-10 01:09:08,910 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 01:09:08,910 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336413625] [2022-01-10 01:09:08,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:09:08,911 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 01:09:08,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:08,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-01-10 01:09:08,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:08,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-01-10 01:09:08,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:08,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-01-10 01:09:08,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:08,985 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-10 01:09:08,985 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 01:09:08,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336413625] [2022-01-10 01:09:08,985 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336413625] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 01:09:08,985 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 01:09:08,985 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 01:09:08,986 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426822974] [2022-01-10 01:09:08,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 01:09:08,986 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 01:09:08,987 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 01:09:08,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 01:09:08,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 01:09:08,987 INFO L87 Difference]: Start difference. First operand 450 states and 652 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-10 01:09:09,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 01:09:09,227 INFO L93 Difference]: Finished difference Result 1014 states and 1515 transitions. [2022-01-10 01:09:09,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 01:09:09,228 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 75 [2022-01-10 01:09:09,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 01:09:09,230 INFO L225 Difference]: With dead ends: 1014 [2022-01-10 01:09:09,230 INFO L226 Difference]: Without dead ends: 679 [2022-01-10 01:09:09,231 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-10 01:09:09,232 INFO L933 BasicCegarLoop]: 299 mSDtfsCounter, 227 mSDsluCounter, 416 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 715 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 01:09:09,232 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [250 Valid, 715 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-10 01:09:09,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 679 states. [2022-01-10 01:09:09,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 679 to 450. [2022-01-10 01:09:09,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 450 states, 374 states have (on average 1.4224598930481283) internal successors, (532), 375 states have internal predecessors, (532), 59 states have call successors, (59), 16 states have call predecessors, (59), 16 states have return successors, (59), 58 states have call predecessors, (59), 59 states have call successors, (59) [2022-01-10 01:09:09,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 650 transitions. [2022-01-10 01:09:09,263 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 650 transitions. Word has length 75 [2022-01-10 01:09:09,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 01:09:09,268 INFO L470 AbstractCegarLoop]: Abstraction has 450 states and 650 transitions. [2022-01-10 01:09:09,268 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-10 01:09:09,268 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 650 transitions. [2022-01-10 01:09:09,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-01-10 01:09:09,268 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 01:09:09,268 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 01:09:09,269 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-10 01:09:09,269 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 01:09:09,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 01:09:09,269 INFO L85 PathProgramCache]: Analyzing trace with hash -559886893, now seen corresponding path program 1 times [2022-01-10 01:09:09,269 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 01:09:09,269 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445644241] [2022-01-10 01:09:09,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:09:09,269 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 01:09:09,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:09,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-01-10 01:09:09,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:09,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-01-10 01:09:09,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:09,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-01-10 01:09:09,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:09,371 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-10 01:09:09,371 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 01:09:09,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445644241] [2022-01-10 01:09:09,372 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445644241] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 01:09:09,372 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 01:09:09,372 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 01:09:09,372 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339931305] [2022-01-10 01:09:09,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 01:09:09,372 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 01:09:09,372 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 01:09:09,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 01:09:09,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 01:09:09,373 INFO L87 Difference]: Start difference. First operand 450 states and 650 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 3 states have internal predecessors, (65), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-01-10 01:09:09,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 01:09:09,409 INFO L93 Difference]: Finished difference Result 795 states and 1165 transitions. [2022-01-10 01:09:09,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 01:09:09,410 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 3 states have internal predecessors, (65), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 76 [2022-01-10 01:09:09,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 01:09:09,411 INFO L225 Difference]: With dead ends: 795 [2022-01-10 01:09:09,412 INFO L226 Difference]: Without dead ends: 460 [2022-01-10 01:09:09,412 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-10 01:09:09,413 INFO L933 BasicCegarLoop]: 282 mSDtfsCounter, 6 mSDsluCounter, 560 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 842 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 01:09:09,413 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 842 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 01:09:09,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2022-01-10 01:09:09,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 460. [2022-01-10 01:09:09,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 460 states, 382 states have (on average 1.4136125654450262) internal successors, (540), 383 states have internal predecessors, (540), 59 states have call successors, (59), 18 states have call predecessors, (59), 18 states have return successors, (59), 58 states have call predecessors, (59), 59 states have call successors, (59) [2022-01-10 01:09:09,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 658 transitions. [2022-01-10 01:09:09,435 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 658 transitions. Word has length 76 [2022-01-10 01:09:09,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 01:09:09,436 INFO L470 AbstractCegarLoop]: Abstraction has 460 states and 658 transitions. [2022-01-10 01:09:09,436 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 3 states have internal predecessors, (65), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-01-10 01:09:09,436 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 658 transitions. [2022-01-10 01:09:09,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-01-10 01:09:09,437 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 01:09:09,437 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 01:09:09,437 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-10 01:09:09,437 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 01:09:09,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 01:09:09,437 INFO L85 PathProgramCache]: Analyzing trace with hash 1187329977, now seen corresponding path program 1 times [2022-01-10 01:09:09,437 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 01:09:09,440 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45367537] [2022-01-10 01:09:09,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:09:09,440 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 01:09:09,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:09,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-01-10 01:09:09,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:09,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-01-10 01:09:09,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:09,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-01-10 01:09:09,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:09,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-01-10 01:09:09,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:09,522 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-10 01:09:09,522 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 01:09:09,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45367537] [2022-01-10 01:09:09,522 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45367537] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 01:09:09,522 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 01:09:09,522 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 01:09:09,522 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123992284] [2022-01-10 01:09:09,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 01:09:09,523 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 01:09:09,523 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 01:09:09,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 01:09:09,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 01:09:09,524 INFO L87 Difference]: Start difference. First operand 460 states and 658 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-01-10 01:09:09,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 01:09:09,584 INFO L93 Difference]: Finished difference Result 815 states and 1187 transitions. [2022-01-10 01:09:09,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 01:09:09,584 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 84 [2022-01-10 01:09:09,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 01:09:09,589 INFO L225 Difference]: With dead ends: 815 [2022-01-10 01:09:09,590 INFO L226 Difference]: Without dead ends: 470 [2022-01-10 01:09:09,590 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-10 01:09:09,591 INFO L933 BasicCegarLoop]: 279 mSDtfsCounter, 6 mSDsluCounter, 549 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 828 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 01:09:09,591 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 828 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 01:09:09,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2022-01-10 01:09:09,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 470. [2022-01-10 01:09:09,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 470 states, 390 states have (on average 1.405128205128205) internal successors, (548), 391 states have internal predecessors, (548), 59 states have call successors, (59), 20 states have call predecessors, (59), 20 states have return successors, (59), 58 states have call predecessors, (59), 59 states have call successors, (59) [2022-01-10 01:09:09,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 666 transitions. [2022-01-10 01:09:09,632 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 666 transitions. Word has length 84 [2022-01-10 01:09:09,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 01:09:09,633 INFO L470 AbstractCegarLoop]: Abstraction has 470 states and 666 transitions. [2022-01-10 01:09:09,633 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-01-10 01:09:09,633 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 666 transitions. [2022-01-10 01:09:09,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-01-10 01:09:09,635 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 01:09:09,635 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 01:09:09,635 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-10 01:09:09,635 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 01:09:09,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 01:09:09,635 INFO L85 PathProgramCache]: Analyzing trace with hash 1492689475, now seen corresponding path program 1 times [2022-01-10 01:09:09,635 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 01:09:09,635 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049626721] [2022-01-10 01:09:09,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:09:09,636 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 01:09:09,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:09,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-01-10 01:09:09,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:09,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-01-10 01:09:09,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:09,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-01-10 01:09:09,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:09,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-01-10 01:09:09,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:09,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-01-10 01:09:09,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:09,702 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-10 01:09:09,702 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 01:09:09,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049626721] [2022-01-10 01:09:09,702 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049626721] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 01:09:09,702 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 01:09:09,702 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 01:09:09,702 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217398255] [2022-01-10 01:09:09,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 01:09:09,703 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 01:09:09,703 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 01:09:09,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 01:09:09,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 01:09:09,704 INFO L87 Difference]: Start difference. First operand 470 states and 666 transitions. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-01-10 01:09:09,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 01:09:09,764 INFO L93 Difference]: Finished difference Result 833 states and 1195 transitions. [2022-01-10 01:09:09,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 01:09:09,765 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 92 [2022-01-10 01:09:09,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 01:09:09,767 INFO L225 Difference]: With dead ends: 833 [2022-01-10 01:09:09,767 INFO L226 Difference]: Without dead ends: 478 [2022-01-10 01:09:09,768 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-10 01:09:09,768 INFO L933 BasicCegarLoop]: 284 mSDtfsCounter, 5 mSDsluCounter, 553 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 837 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 01:09:09,769 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 837 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 01:09:09,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2022-01-10 01:09:09,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 478. [2022-01-10 01:09:09,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 478 states, 396 states have (on average 1.398989898989899) internal successors, (554), 397 states have internal predecessors, (554), 59 states have call successors, (59), 22 states have call predecessors, (59), 22 states have return successors, (59), 58 states have call predecessors, (59), 59 states have call successors, (59) [2022-01-10 01:09:09,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 672 transitions. [2022-01-10 01:09:09,789 INFO L78 Accepts]: Start accepts. Automaton has 478 states and 672 transitions. Word has length 92 [2022-01-10 01:09:09,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 01:09:09,790 INFO L470 AbstractCegarLoop]: Abstraction has 478 states and 672 transitions. [2022-01-10 01:09:09,790 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-01-10 01:09:09,790 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 672 transitions. [2022-01-10 01:09:09,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-01-10 01:09:09,791 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 01:09:09,791 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 01:09:09,791 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-10 01:09:09,791 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 01:09:09,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 01:09:09,792 INFO L85 PathProgramCache]: Analyzing trace with hash -405818518, now seen corresponding path program 1 times [2022-01-10 01:09:09,792 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 01:09:09,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944679113] [2022-01-10 01:09:09,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:09:09,792 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 01:09:09,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:09,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-01-10 01:09:09,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:09,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-01-10 01:09:09,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:09,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-01-10 01:09:09,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:09,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-01-10 01:09:09,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:09,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-01-10 01:09:09,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:09,869 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-10 01:09:09,869 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 01:09:09,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944679113] [2022-01-10 01:09:09,869 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944679113] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 01:09:09,869 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 01:09:09,870 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 01:09:09,870 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185318872] [2022-01-10 01:09:09,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 01:09:09,870 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 01:09:09,870 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 01:09:09,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 01:09:09,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 01:09:09,871 INFO L87 Difference]: Start difference. First operand 478 states and 672 transitions. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-01-10 01:09:09,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 01:09:09,918 INFO L93 Difference]: Finished difference Result 851 states and 1215 transitions. [2022-01-10 01:09:09,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 01:09:09,919 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 92 [2022-01-10 01:09:09,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 01:09:09,921 INFO L225 Difference]: With dead ends: 851 [2022-01-10 01:09:09,921 INFO L226 Difference]: Without dead ends: 488 [2022-01-10 01:09:09,922 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-10 01:09:09,922 INFO L933 BasicCegarLoop]: 279 mSDtfsCounter, 6 mSDsluCounter, 549 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 828 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 01:09:09,923 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 828 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 01:09:09,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2022-01-10 01:09:09,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 488. [2022-01-10 01:09:09,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 488 states, 404 states have (on average 1.391089108910891) internal successors, (562), 405 states have internal predecessors, (562), 59 states have call successors, (59), 24 states have call predecessors, (59), 24 states have return successors, (59), 58 states have call predecessors, (59), 59 states have call successors, (59) [2022-01-10 01:09:09,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 680 transitions. [2022-01-10 01:09:09,944 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 680 transitions. Word has length 92 [2022-01-10 01:09:09,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 01:09:09,944 INFO L470 AbstractCegarLoop]: Abstraction has 488 states and 680 transitions. [2022-01-10 01:09:09,944 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-01-10 01:09:09,944 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 680 transitions. [2022-01-10 01:09:09,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-01-10 01:09:09,945 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 01:09:09,945 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 01:09:09,945 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-10 01:09:09,945 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 01:09:09,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 01:09:09,946 INFO L85 PathProgramCache]: Analyzing trace with hash 1172591310, now seen corresponding path program 1 times [2022-01-10 01:09:09,946 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 01:09:09,946 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663116952] [2022-01-10 01:09:09,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:09:09,946 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 01:09:09,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:10,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-01-10 01:09:10,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:10,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-01-10 01:09:10,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:10,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-01-10 01:09:10,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:10,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-01-10 01:09:10,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:10,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-01-10 01:09:10,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:10,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-01-10 01:09:10,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:10,024 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-10 01:09:10,024 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 01:09:10,025 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663116952] [2022-01-10 01:09:10,025 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663116952] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 01:09:10,025 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 01:09:10,025 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 01:09:10,025 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407507621] [2022-01-10 01:09:10,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 01:09:10,025 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 01:09:10,025 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 01:09:10,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 01:09:10,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 01:09:10,026 INFO L87 Difference]: Start difference. First operand 488 states and 680 transitions. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-01-10 01:09:10,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 01:09:10,075 INFO L93 Difference]: Finished difference Result 873 states and 1229 transitions. [2022-01-10 01:09:10,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 01:09:10,076 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 100 [2022-01-10 01:09:10,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 01:09:10,078 INFO L225 Difference]: With dead ends: 873 [2022-01-10 01:09:10,078 INFO L226 Difference]: Without dead ends: 500 [2022-01-10 01:09:10,080 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-10 01:09:10,081 INFO L933 BasicCegarLoop]: 283 mSDtfsCounter, 7 mSDsluCounter, 556 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 839 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 01:09:10,081 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 839 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 01:09:10,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2022-01-10 01:09:10,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 500. [2022-01-10 01:09:10,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 500 states, 414 states have (on average 1.3816425120772946) internal successors, (572), 415 states have internal predecessors, (572), 59 states have call successors, (59), 26 states have call predecessors, (59), 26 states have return successors, (59), 58 states have call predecessors, (59), 59 states have call successors, (59) [2022-01-10 01:09:10,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 690 transitions. [2022-01-10 01:09:10,101 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 690 transitions. Word has length 100 [2022-01-10 01:09:10,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 01:09:10,101 INFO L470 AbstractCegarLoop]: Abstraction has 500 states and 690 transitions. [2022-01-10 01:09:10,102 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-01-10 01:09:10,102 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 690 transitions. [2022-01-10 01:09:10,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-01-10 01:09:10,103 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 01:09:10,103 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 01:09:10,103 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-10 01:09:10,104 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 01:09:10,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 01:09:10,104 INFO L85 PathProgramCache]: Analyzing trace with hash 498895455, now seen corresponding path program 1 times [2022-01-10 01:09:10,105 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 01:09:10,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780914933] [2022-01-10 01:09:10,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:09:10,105 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 01:09:10,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:10,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-01-10 01:09:10,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:10,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-01-10 01:09:10,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:10,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-01-10 01:09:10,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:10,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-01-10 01:09:10,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:10,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-01-10 01:09:10,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:10,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-01-10 01:09:10,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:10,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-01-10 01:09:10,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:10,267 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-01-10 01:09:10,268 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 01:09:10,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780914933] [2022-01-10 01:09:10,268 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1780914933] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 01:09:10,268 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 01:09:10,268 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-10 01:09:10,268 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935479392] [2022-01-10 01:09:10,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 01:09:10,268 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 01:09:10,268 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 01:09:10,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 01:09:10,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-10 01:09:10,269 INFO L87 Difference]: Start difference. First operand 500 states and 690 transitions. Second operand has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 6 states have internal predecessors, (82), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2022-01-10 01:09:10,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 01:09:10,482 INFO L93 Difference]: Finished difference Result 1360 states and 1901 transitions. [2022-01-10 01:09:10,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-10 01:09:10,482 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 6 states have internal predecessors, (82), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) Word has length 103 [2022-01-10 01:09:10,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 01:09:10,486 INFO L225 Difference]: With dead ends: 1360 [2022-01-10 01:09:10,486 INFO L226 Difference]: Without dead ends: 975 [2022-01-10 01:09:10,487 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-01-10 01:09:10,488 INFO L933 BasicCegarLoop]: 402 mSDtfsCounter, 383 mSDsluCounter, 1819 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 399 SdHoareTripleChecker+Valid, 2221 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 01:09:10,488 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [399 Valid, 2221 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 01:09:10,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 975 states. [2022-01-10 01:09:10,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 975 to 644. [2022-01-10 01:09:10,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 644 states, 521 states have (on average 1.3723608445297504) internal successors, (715), 523 states have internal predecessors, (715), 83 states have call successors, (83), 39 states have call predecessors, (83), 39 states have return successors, (83), 81 states have call predecessors, (83), 83 states have call successors, (83) [2022-01-10 01:09:10,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 644 states to 644 states and 881 transitions. [2022-01-10 01:09:10,523 INFO L78 Accepts]: Start accepts. Automaton has 644 states and 881 transitions. Word has length 103 [2022-01-10 01:09:10,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 01:09:10,523 INFO L470 AbstractCegarLoop]: Abstraction has 644 states and 881 transitions. [2022-01-10 01:09:10,524 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 6 states have internal predecessors, (82), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2022-01-10 01:09:10,524 INFO L276 IsEmpty]: Start isEmpty. Operand 644 states and 881 transitions. [2022-01-10 01:09:10,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-01-10 01:09:10,524 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 01:09:10,525 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 01:09:10,525 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-10 01:09:10,525 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 01:09:10,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 01:09:10,525 INFO L85 PathProgramCache]: Analyzing trace with hash 1291996142, now seen corresponding path program 1 times [2022-01-10 01:09:10,525 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 01:09:10,525 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7578330] [2022-01-10 01:09:10,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:09:10,525 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 01:09:10,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:10,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-01-10 01:09:10,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:10,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-01-10 01:09:10,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:10,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-01-10 01:09:10,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:10,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-01-10 01:09:10,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:10,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-01-10 01:09:10,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:10,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-01-10 01:09:10,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:10,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-01-10 01:09:10,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:10,586 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-01-10 01:09:10,587 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 01:09:10,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7578330] [2022-01-10 01:09:10,587 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7578330] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 01:09:10,587 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 01:09:10,587 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 01:09:10,587 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116206008] [2022-01-10 01:09:10,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 01:09:10,587 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 01:09:10,587 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 01:09:10,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 01:09:10,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 01:09:10,588 INFO L87 Difference]: Start difference. First operand 644 states and 881 transitions. Second operand has 4 states, 4 states have (on average 21.5) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-01-10 01:09:10,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 01:09:10,632 INFO L93 Difference]: Finished difference Result 1149 states and 1585 transitions. [2022-01-10 01:09:10,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 01:09:10,633 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 107 [2022-01-10 01:09:10,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 01:09:10,635 INFO L225 Difference]: With dead ends: 1149 [2022-01-10 01:09:10,635 INFO L226 Difference]: Without dead ends: 656 [2022-01-10 01:09:10,636 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-10 01:09:10,637 INFO L933 BasicCegarLoop]: 284 mSDtfsCounter, 5 mSDsluCounter, 553 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 837 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 01:09:10,637 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 837 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 01:09:10,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2022-01-10 01:09:10,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 656. [2022-01-10 01:09:10,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 656 states, 530 states have (on average 1.3660377358490565) internal successors, (724), 532 states have internal predecessors, (724), 83 states have call successors, (83), 42 states have call predecessors, (83), 42 states have return successors, (83), 81 states have call predecessors, (83), 83 states have call successors, (83) [2022-01-10 01:09:10,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656 states to 656 states and 890 transitions. [2022-01-10 01:09:10,670 INFO L78 Accepts]: Start accepts. Automaton has 656 states and 890 transitions. Word has length 107 [2022-01-10 01:09:10,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 01:09:10,670 INFO L470 AbstractCegarLoop]: Abstraction has 656 states and 890 transitions. [2022-01-10 01:09:10,670 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-01-10 01:09:10,670 INFO L276 IsEmpty]: Start isEmpty. Operand 656 states and 890 transitions. [2022-01-10 01:09:10,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-01-10 01:09:10,671 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 01:09:10,671 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 01:09:10,671 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-10 01:09:10,671 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 01:09:10,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 01:09:10,671 INFO L85 PathProgramCache]: Analyzing trace with hash 739054211, now seen corresponding path program 1 times [2022-01-10 01:09:10,672 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 01:09:10,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779619318] [2022-01-10 01:09:10,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:09:10,672 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 01:09:10,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:10,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-01-10 01:09:10,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:10,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-01-10 01:09:10,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:10,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-01-10 01:09:10,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:10,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-01-10 01:09:10,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:10,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-01-10 01:09:10,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:10,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-01-10 01:09:10,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:10,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-01-10 01:09:10,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:10,751 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-01-10 01:09:10,751 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 01:09:10,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779619318] [2022-01-10 01:09:10,751 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779619318] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 01:09:10,751 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 01:09:10,752 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-10 01:09:10,752 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732782826] [2022-01-10 01:09:10,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 01:09:10,752 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 01:09:10,752 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 01:09:10,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 01:09:10,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-10 01:09:10,753 INFO L87 Difference]: Start difference. First operand 656 states and 890 transitions. Second operand has 6 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-01-10 01:09:10,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 01:09:10,914 INFO L93 Difference]: Finished difference Result 921 states and 1302 transitions. [2022-01-10 01:09:10,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-10 01:09:10,914 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 106 [2022-01-10 01:09:10,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 01:09:10,917 INFO L225 Difference]: With dead ends: 921 [2022-01-10 01:09:10,917 INFO L226 Difference]: Without dead ends: 919 [2022-01-10 01:09:10,918 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-01-10 01:09:10,918 INFO L933 BasicCegarLoop]: 502 mSDtfsCounter, 261 mSDsluCounter, 1692 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 2194 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 01:09:10,919 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [283 Valid, 2194 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 01:09:10,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 919 states. [2022-01-10 01:09:11,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 919 to 660. [2022-01-10 01:09:11,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 660 states, 532 states have (on average 1.3646616541353382) internal successors, (726), 535 states have internal predecessors, (726), 84 states have call successors, (84), 43 states have call predecessors, (84), 43 states have return successors, (84), 81 states have call predecessors, (84), 84 states have call successors, (84) [2022-01-10 01:09:11,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 660 states and 894 transitions. [2022-01-10 01:09:11,034 INFO L78 Accepts]: Start accepts. Automaton has 660 states and 894 transitions. Word has length 106 [2022-01-10 01:09:11,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 01:09:11,034 INFO L470 AbstractCegarLoop]: Abstraction has 660 states and 894 transitions. [2022-01-10 01:09:11,034 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-01-10 01:09:11,034 INFO L276 IsEmpty]: Start isEmpty. Operand 660 states and 894 transitions. [2022-01-10 01:09:11,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-01-10 01:09:11,035 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 01:09:11,035 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 01:09:11,035 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-01-10 01:09:11,035 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 01:09:11,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 01:09:11,036 INFO L85 PathProgramCache]: Analyzing trace with hash 1139472038, now seen corresponding path program 1 times [2022-01-10 01:09:11,036 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 01:09:11,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256554548] [2022-01-10 01:09:11,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:09:11,036 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 01:09:11,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:11,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-01-10 01:09:11,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:11,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-01-10 01:09:11,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:11,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-01-10 01:09:11,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:11,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-01-10 01:09:11,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:11,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-01-10 01:09:11,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:11,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-01-10 01:09:11,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:11,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-01-10 01:09:11,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:11,161 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-01-10 01:09:11,161 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 01:09:11,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256554548] [2022-01-10 01:09:11,162 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256554548] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 01:09:11,162 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 01:09:11,162 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-10 01:09:11,162 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165180629] [2022-01-10 01:09:11,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 01:09:11,162 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 01:09:11,162 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 01:09:11,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 01:09:11,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-10 01:09:11,163 INFO L87 Difference]: Start difference. First operand 660 states and 894 transitions. Second operand has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 6 states have internal predecessors, (85), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-01-10 01:09:11,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 01:09:11,347 INFO L93 Difference]: Finished difference Result 1388 states and 1913 transitions. [2022-01-10 01:09:11,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-10 01:09:11,348 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 6 states have internal predecessors, (85), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 109 [2022-01-10 01:09:11,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 01:09:11,351 INFO L225 Difference]: With dead ends: 1388 [2022-01-10 01:09:11,351 INFO L226 Difference]: Without dead ends: 920 [2022-01-10 01:09:11,352 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-01-10 01:09:11,352 INFO L933 BasicCegarLoop]: 393 mSDtfsCounter, 503 mSDsluCounter, 1785 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 506 SdHoareTripleChecker+Valid, 2178 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 01:09:11,352 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [506 Valid, 2178 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 01:09:11,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 920 states. [2022-01-10 01:09:11,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 920 to 703. [2022-01-10 01:09:11,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 703 states, 584 states have (on average 1.3595890410958904) internal successors, (794), 589 states have internal predecessors, (794), 76 states have call successors, (76), 42 states have call predecessors, (76), 42 states have return successors, (76), 71 states have call predecessors, (76), 76 states have call successors, (76) [2022-01-10 01:09:11,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 703 states to 703 states and 946 transitions. [2022-01-10 01:09:11,403 INFO L78 Accepts]: Start accepts. Automaton has 703 states and 946 transitions. Word has length 109 [2022-01-10 01:09:11,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 01:09:11,403 INFO L470 AbstractCegarLoop]: Abstraction has 703 states and 946 transitions. [2022-01-10 01:09:11,403 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 6 states have internal predecessors, (85), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-01-10 01:09:11,403 INFO L276 IsEmpty]: Start isEmpty. Operand 703 states and 946 transitions. [2022-01-10 01:09:11,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-01-10 01:09:11,404 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 01:09:11,404 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 01:09:11,404 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-01-10 01:09:11,404 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 01:09:11,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 01:09:11,404 INFO L85 PathProgramCache]: Analyzing trace with hash 672232165, now seen corresponding path program 1 times [2022-01-10 01:09:11,405 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 01:09:11,405 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470265314] [2022-01-10 01:09:11,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:09:11,405 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 01:09:11,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:11,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-01-10 01:09:11,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:11,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-01-10 01:09:11,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:11,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-01-10 01:09:11,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:11,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-01-10 01:09:11,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:11,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-01-10 01:09:11,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:11,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-01-10 01:09:11,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:11,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-01-10 01:09:11,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:11,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-01-10 01:09:11,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:11,493 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-01-10 01:09:11,494 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 01:09:11,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470265314] [2022-01-10 01:09:11,494 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470265314] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 01:09:11,494 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 01:09:11,494 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-10 01:09:11,494 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429887430] [2022-01-10 01:09:11,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 01:09:11,494 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 01:09:11,494 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 01:09:11,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 01:09:11,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-10 01:09:11,495 INFO L87 Difference]: Start difference. First operand 703 states and 946 transitions. Second operand has 7 states, 7 states have (on average 12.0) internal successors, (84), 6 states have internal predecessors, (84), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2022-01-10 01:09:11,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 01:09:11,669 INFO L93 Difference]: Finished difference Result 1450 states and 1994 transitions. [2022-01-10 01:09:11,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-10 01:09:11,669 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.0) internal successors, (84), 6 states have internal predecessors, (84), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) Word has length 111 [2022-01-10 01:09:11,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 01:09:11,672 INFO L225 Difference]: With dead ends: 1450 [2022-01-10 01:09:11,672 INFO L226 Difference]: Without dead ends: 929 [2022-01-10 01:09:11,673 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-01-10 01:09:11,673 INFO L933 BasicCegarLoop]: 424 mSDtfsCounter, 367 mSDsluCounter, 1906 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 379 SdHoareTripleChecker+Valid, 2330 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 01:09:11,673 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [379 Valid, 2330 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 01:09:11,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 929 states. [2022-01-10 01:09:11,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 929 to 692. [2022-01-10 01:09:11,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 692 states, 576 states have (on average 1.3576388888888888) internal successors, (782), 581 states have internal predecessors, (782), 74 states have call successors, (74), 41 states have call predecessors, (74), 41 states have return successors, (74), 69 states have call predecessors, (74), 74 states have call successors, (74) [2022-01-10 01:09:11,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 692 states to 692 states and 930 transitions. [2022-01-10 01:09:11,713 INFO L78 Accepts]: Start accepts. Automaton has 692 states and 930 transitions. Word has length 111 [2022-01-10 01:09:11,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 01:09:11,713 INFO L470 AbstractCegarLoop]: Abstraction has 692 states and 930 transitions. [2022-01-10 01:09:11,713 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.0) internal successors, (84), 6 states have internal predecessors, (84), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2022-01-10 01:09:11,714 INFO L276 IsEmpty]: Start isEmpty. Operand 692 states and 930 transitions. [2022-01-10 01:09:11,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-01-10 01:09:11,714 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 01:09:11,714 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 01:09:11,714 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-01-10 01:09:11,715 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 01:09:11,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 01:09:11,715 INFO L85 PathProgramCache]: Analyzing trace with hash 1990320010, now seen corresponding path program 1 times [2022-01-10 01:09:11,715 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 01:09:11,715 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811316718] [2022-01-10 01:09:11,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:09:11,715 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 01:09:11,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:11,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-01-10 01:09:11,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:11,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-01-10 01:09:11,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:11,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-01-10 01:09:11,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:11,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-01-10 01:09:11,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:11,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-01-10 01:09:11,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:11,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-01-10 01:09:11,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:11,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-01-10 01:09:11,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:11,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-01-10 01:09:11,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:11,757 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-01-10 01:09:11,757 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 01:09:11,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811316718] [2022-01-10 01:09:11,757 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811316718] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 01:09:11,757 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 01:09:11,757 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 01:09:11,757 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051266459] [2022-01-10 01:09:11,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 01:09:11,757 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 01:09:11,757 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 01:09:11,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 01:09:11,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 01:09:11,758 INFO L87 Difference]: Start difference. First operand 692 states and 930 transitions. Second operand has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-01-10 01:09:11,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 01:09:11,926 INFO L93 Difference]: Finished difference Result 1922 states and 2633 transitions. [2022-01-10 01:09:11,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 01:09:11,927 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 112 [2022-01-10 01:09:11,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 01:09:11,931 INFO L225 Difference]: With dead ends: 1922 [2022-01-10 01:09:11,931 INFO L226 Difference]: Without dead ends: 1392 [2022-01-10 01:09:11,932 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-10 01:09:11,932 INFO L933 BasicCegarLoop]: 404 mSDtfsCounter, 424 mSDsluCounter, 639 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 424 SdHoareTripleChecker+Valid, 1043 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 01:09:11,933 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [424 Valid, 1043 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 01:09:11,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1392 states. [2022-01-10 01:09:11,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1392 to 1154. [2022-01-10 01:09:11,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1154 states, 938 states have (on average 1.349680170575693) internal successors, (1266), 947 states have internal predecessors, (1266), 140 states have call successors, (140), 75 states have call predecessors, (140), 75 states have return successors, (140), 131 states have call predecessors, (140), 140 states have call successors, (140) [2022-01-10 01:09:11,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1154 states to 1154 states and 1546 transitions. [2022-01-10 01:09:11,999 INFO L78 Accepts]: Start accepts. Automaton has 1154 states and 1546 transitions. Word has length 112 [2022-01-10 01:09:11,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 01:09:11,999 INFO L470 AbstractCegarLoop]: Abstraction has 1154 states and 1546 transitions. [2022-01-10 01:09:11,999 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-01-10 01:09:11,999 INFO L276 IsEmpty]: Start isEmpty. Operand 1154 states and 1546 transitions. [2022-01-10 01:09:12,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-01-10 01:09:12,000 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 01:09:12,000 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 01:09:12,000 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-01-10 01:09:12,000 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 01:09:12,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 01:09:12,001 INFO L85 PathProgramCache]: Analyzing trace with hash 1802932996, now seen corresponding path program 1 times [2022-01-10 01:09:12,001 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 01:09:12,001 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981526842] [2022-01-10 01:09:12,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:09:12,001 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 01:09:12,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:12,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-01-10 01:09:12,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:12,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-01-10 01:09:12,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:12,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-01-10 01:09:12,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:12,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-01-10 01:09:12,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:12,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-01-10 01:09:12,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:12,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-01-10 01:09:12,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:12,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-01-10 01:09:12,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:12,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-01-10 01:09:12,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:12,062 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-01-10 01:09:12,062 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 01:09:12,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981526842] [2022-01-10 01:09:12,062 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981526842] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 01:09:12,062 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 01:09:12,062 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 01:09:12,062 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924002638] [2022-01-10 01:09:12,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 01:09:12,063 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 01:09:12,063 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 01:09:12,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 01:09:12,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 01:09:12,064 INFO L87 Difference]: Start difference. First operand 1154 states and 1546 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-01-10 01:09:12,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 01:09:12,188 INFO L93 Difference]: Finished difference Result 3024 states and 4036 transitions. [2022-01-10 01:09:12,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 01:09:12,188 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 112 [2022-01-10 01:09:12,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 01:09:12,194 INFO L225 Difference]: With dead ends: 3024 [2022-01-10 01:09:12,195 INFO L226 Difference]: Without dead ends: 2045 [2022-01-10 01:09:12,197 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 01:09:12,197 INFO L933 BasicCegarLoop]: 354 mSDtfsCounter, 220 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 627 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 01:09:12,197 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [220 Valid, 627 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 01:09:12,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2045 states. [2022-01-10 01:09:12,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2045 to 1691. [2022-01-10 01:09:12,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1691 states, 1340 states have (on average 1.3425373134328358) internal successors, (1799), 1355 states have internal predecessors, (1799), 230 states have call successors, (230), 120 states have call predecessors, (230), 120 states have return successors, (230), 215 states have call predecessors, (230), 230 states have call successors, (230) [2022-01-10 01:09:12,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1691 states to 1691 states and 2259 transitions. [2022-01-10 01:09:12,296 INFO L78 Accepts]: Start accepts. Automaton has 1691 states and 2259 transitions. Word has length 112 [2022-01-10 01:09:12,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 01:09:12,297 INFO L470 AbstractCegarLoop]: Abstraction has 1691 states and 2259 transitions. [2022-01-10 01:09:12,297 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-01-10 01:09:12,297 INFO L276 IsEmpty]: Start isEmpty. Operand 1691 states and 2259 transitions. [2022-01-10 01:09:12,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-01-10 01:09:12,298 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 01:09:12,298 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 01:09:12,298 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-01-10 01:09:12,298 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 01:09:12,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 01:09:12,298 INFO L85 PathProgramCache]: Analyzing trace with hash -225653114, now seen corresponding path program 1 times [2022-01-10 01:09:12,298 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 01:09:12,299 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491489807] [2022-01-10 01:09:12,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:09:12,299 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 01:09:12,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:12,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-01-10 01:09:12,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:12,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-01-10 01:09:12,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:12,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-01-10 01:09:12,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:12,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-01-10 01:09:12,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:12,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-01-10 01:09:12,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:12,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-01-10 01:09:12,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:12,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-01-10 01:09:12,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:12,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-01-10 01:09:12,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:12,429 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-01-10 01:09:12,429 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 01:09:12,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491489807] [2022-01-10 01:09:12,429 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491489807] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 01:09:12,429 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 01:09:12,429 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-10 01:09:12,429 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342821308] [2022-01-10 01:09:12,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 01:09:12,430 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-10 01:09:12,430 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 01:09:12,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-10 01:09:12,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-01-10 01:09:12,430 INFO L87 Difference]: Start difference. First operand 1691 states and 2259 transitions. Second operand has 8 states, 8 states have (on average 11.125) internal successors, (89), 7 states have internal predecessors, (89), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2022-01-10 01:09:12,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 01:09:12,984 INFO L93 Difference]: Finished difference Result 3913 states and 5376 transitions. [2022-01-10 01:09:12,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-10 01:09:12,985 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.125) internal successors, (89), 7 states have internal predecessors, (89), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Word has length 112 [2022-01-10 01:09:12,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 01:09:12,993 INFO L225 Difference]: With dead ends: 3913 [2022-01-10 01:09:12,993 INFO L226 Difference]: Without dead ends: 2493 [2022-01-10 01:09:12,996 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2022-01-10 01:09:12,997 INFO L933 BasicCegarLoop]: 668 mSDtfsCounter, 717 mSDsluCounter, 2384 mSDsCounter, 0 mSdLazyCounter, 526 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 723 SdHoareTripleChecker+Valid, 3052 SdHoareTripleChecker+Invalid, 578 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 526 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-10 01:09:12,997 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [723 Valid, 3052 Invalid, 578 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 526 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-10 01:09:13,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2493 states. [2022-01-10 01:09:13,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2493 to 1697. [2022-01-10 01:09:13,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1697 states, 1340 states have (on average 1.3291044776119403) internal successors, (1781), 1356 states have internal predecessors, (1781), 231 states have call successors, (231), 125 states have call predecessors, (231), 125 states have return successors, (231), 215 states have call predecessors, (231), 231 states have call successors, (231) [2022-01-10 01:09:13,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1697 states to 1697 states and 2243 transitions. [2022-01-10 01:09:13,185 INFO L78 Accepts]: Start accepts. Automaton has 1697 states and 2243 transitions. Word has length 112 [2022-01-10 01:09:13,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 01:09:13,185 INFO L470 AbstractCegarLoop]: Abstraction has 1697 states and 2243 transitions. [2022-01-10 01:09:13,186 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.125) internal successors, (89), 7 states have internal predecessors, (89), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2022-01-10 01:09:13,186 INFO L276 IsEmpty]: Start isEmpty. Operand 1697 states and 2243 transitions. [2022-01-10 01:09:13,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-01-10 01:09:13,187 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 01:09:13,187 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 01:09:13,187 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-01-10 01:09:13,187 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 01:09:13,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 01:09:13,188 INFO L85 PathProgramCache]: Analyzing trace with hash -2002429441, now seen corresponding path program 1 times [2022-01-10 01:09:13,188 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 01:09:13,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4349223] [2022-01-10 01:09:13,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:09:13,188 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 01:09:13,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:13,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-01-10 01:09:13,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:13,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-01-10 01:09:13,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:13,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-01-10 01:09:13,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:13,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-01-10 01:09:13,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:13,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-01-10 01:09:13,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:13,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-01-10 01:09:13,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:13,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-01-10 01:09:13,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:13,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-01-10 01:09:13,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:13,271 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-01-10 01:09:13,271 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 01:09:13,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4349223] [2022-01-10 01:09:13,272 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4349223] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 01:09:13,272 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 01:09:13,272 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-10 01:09:13,272 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071563535] [2022-01-10 01:09:13,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 01:09:13,272 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 01:09:13,272 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 01:09:13,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 01:09:13,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-10 01:09:13,273 INFO L87 Difference]: Start difference. First operand 1697 states and 2243 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 6 states have internal predecessors, (91), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-01-10 01:09:13,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 01:09:13,877 INFO L93 Difference]: Finished difference Result 4049 states and 5477 transitions. [2022-01-10 01:09:13,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-10 01:09:13,878 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 6 states have internal predecessors, (91), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 114 [2022-01-10 01:09:13,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 01:09:13,887 INFO L225 Difference]: With dead ends: 4049 [2022-01-10 01:09:13,887 INFO L226 Difference]: Without dead ends: 2681 [2022-01-10 01:09:13,889 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2022-01-10 01:09:13,890 INFO L933 BasicCegarLoop]: 544 mSDtfsCounter, 780 mSDsluCounter, 1820 mSDsCounter, 0 mSdLazyCounter, 372 mSolverCounterSat, 191 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 783 SdHoareTripleChecker+Valid, 2364 SdHoareTripleChecker+Invalid, 563 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 191 IncrementalHoareTripleChecker+Valid, 372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-10 01:09:13,890 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [783 Valid, 2364 Invalid, 563 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [191 Valid, 372 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-10 01:09:13,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2681 states. [2022-01-10 01:09:14,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2681 to 1716. [2022-01-10 01:09:14,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1716 states, 1346 states have (on average 1.324665676077266) internal successors, (1783), 1363 states have internal predecessors, (1783), 239 states have call successors, (239), 130 states have call predecessors, (239), 130 states have return successors, (239), 222 states have call predecessors, (239), 239 states have call successors, (239) [2022-01-10 01:09:14,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1716 states to 1716 states and 2261 transitions. [2022-01-10 01:09:14,036 INFO L78 Accepts]: Start accepts. Automaton has 1716 states and 2261 transitions. Word has length 114 [2022-01-10 01:09:14,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 01:09:14,036 INFO L470 AbstractCegarLoop]: Abstraction has 1716 states and 2261 transitions. [2022-01-10 01:09:14,036 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 6 states have internal predecessors, (91), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-01-10 01:09:14,036 INFO L276 IsEmpty]: Start isEmpty. Operand 1716 states and 2261 transitions. [2022-01-10 01:09:14,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-01-10 01:09:14,038 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 01:09:14,038 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 01:09:14,038 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-01-10 01:09:14,038 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 01:09:14,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 01:09:14,038 INFO L85 PathProgramCache]: Analyzing trace with hash 1926273345, now seen corresponding path program 1 times [2022-01-10 01:09:14,038 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 01:09:14,038 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654190424] [2022-01-10 01:09:14,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:09:14,039 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 01:09:14,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:14,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-01-10 01:09:14,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:14,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-01-10 01:09:14,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:14,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-01-10 01:09:14,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:14,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-01-10 01:09:14,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:14,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-01-10 01:09:14,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:14,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-01-10 01:09:14,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:14,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-01-10 01:09:14,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:14,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-01-10 01:09:14,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:14,084 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-01-10 01:09:14,084 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 01:09:14,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654190424] [2022-01-10 01:09:14,084 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654190424] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 01:09:14,084 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 01:09:14,084 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 01:09:14,084 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135856210] [2022-01-10 01:09:14,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 01:09:14,085 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 01:09:14,085 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 01:09:14,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 01:09:14,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 01:09:14,085 INFO L87 Difference]: Start difference. First operand 1716 states and 2261 transitions. Second operand has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-01-10 01:09:14,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 01:09:14,386 INFO L93 Difference]: Finished difference Result 4474 states and 5968 transitions. [2022-01-10 01:09:14,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 01:09:14,386 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 115 [2022-01-10 01:09:14,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 01:09:14,397 INFO L225 Difference]: With dead ends: 4474 [2022-01-10 01:09:14,397 INFO L226 Difference]: Without dead ends: 3122 [2022-01-10 01:09:14,400 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-10 01:09:14,401 INFO L933 BasicCegarLoop]: 508 mSDtfsCounter, 468 mSDsluCounter, 734 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 468 SdHoareTripleChecker+Valid, 1242 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 01:09:14,401 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [468 Valid, 1242 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 01:09:14,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3122 states. [2022-01-10 01:09:14,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3122 to 2645. [2022-01-10 01:09:14,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2645 states, 2038 states have (on average 1.3209028459273797) internal successors, (2692), 2065 states have internal predecessors, (2692), 394 states have call successors, (394), 212 states have call predecessors, (394), 212 states have return successors, (394), 367 states have call predecessors, (394), 394 states have call successors, (394) [2022-01-10 01:09:14,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2645 states to 2645 states and 3480 transitions. [2022-01-10 01:09:14,623 INFO L78 Accepts]: Start accepts. Automaton has 2645 states and 3480 transitions. Word has length 115 [2022-01-10 01:09:14,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 01:09:14,623 INFO L470 AbstractCegarLoop]: Abstraction has 2645 states and 3480 transitions. [2022-01-10 01:09:14,623 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-01-10 01:09:14,624 INFO L276 IsEmpty]: Start isEmpty. Operand 2645 states and 3480 transitions. [2022-01-10 01:09:14,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-01-10 01:09:14,625 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 01:09:14,625 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 01:09:14,625 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-01-10 01:09:14,625 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 01:09:14,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 01:09:14,626 INFO L85 PathProgramCache]: Analyzing trace with hash -359185766, now seen corresponding path program 1 times [2022-01-10 01:09:14,626 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 01:09:14,626 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189733691] [2022-01-10 01:09:14,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:09:14,626 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 01:09:14,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:14,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-01-10 01:09:14,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:14,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-01-10 01:09:14,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:14,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-01-10 01:09:14,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:14,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-01-10 01:09:14,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:14,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-01-10 01:09:14,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:14,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-01-10 01:09:14,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:14,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-01-10 01:09:14,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:14,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-01-10 01:09:14,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:14,672 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-01-10 01:09:14,672 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 01:09:14,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189733691] [2022-01-10 01:09:14,673 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189733691] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 01:09:14,673 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 01:09:14,673 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 01:09:14,673 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877797218] [2022-01-10 01:09:14,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 01:09:14,673 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 01:09:14,673 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 01:09:14,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 01:09:14,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 01:09:14,674 INFO L87 Difference]: Start difference. First operand 2645 states and 3480 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-01-10 01:09:15,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 01:09:15,095 INFO L93 Difference]: Finished difference Result 6356 states and 8732 transitions. [2022-01-10 01:09:15,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 01:09:15,096 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 115 [2022-01-10 01:09:15,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 01:09:15,116 INFO L225 Difference]: With dead ends: 6356 [2022-01-10 01:09:15,117 INFO L226 Difference]: Without dead ends: 3955 [2022-01-10 01:09:15,121 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 01:09:15,122 INFO L933 BasicCegarLoop]: 445 mSDtfsCounter, 151 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 683 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 01:09:15,122 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [175 Valid, 683 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 01:09:15,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3955 states. [2022-01-10 01:09:15,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3955 to 2648. [2022-01-10 01:09:15,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2648 states, 2041 states have (on average 1.3204311611954924) internal successors, (2695), 2068 states have internal predecessors, (2695), 394 states have call successors, (394), 212 states have call predecessors, (394), 212 states have return successors, (394), 367 states have call predecessors, (394), 394 states have call successors, (394) [2022-01-10 01:09:15,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2648 states to 2648 states and 3483 transitions. [2022-01-10 01:09:15,408 INFO L78 Accepts]: Start accepts. Automaton has 2648 states and 3483 transitions. Word has length 115 [2022-01-10 01:09:15,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 01:09:15,408 INFO L470 AbstractCegarLoop]: Abstraction has 2648 states and 3483 transitions. [2022-01-10 01:09:15,409 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-01-10 01:09:15,409 INFO L276 IsEmpty]: Start isEmpty. Operand 2648 states and 3483 transitions. [2022-01-10 01:09:15,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-01-10 01:09:15,410 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 01:09:15,410 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 01:09:15,411 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-01-10 01:09:15,411 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 01:09:15,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 01:09:15,411 INFO L85 PathProgramCache]: Analyzing trace with hash -1956455983, now seen corresponding path program 1 times [2022-01-10 01:09:15,411 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 01:09:15,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355490490] [2022-01-10 01:09:15,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:09:15,411 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 01:09:15,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:15,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-01-10 01:09:15,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:15,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-01-10 01:09:15,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:15,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-01-10 01:09:15,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:15,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-01-10 01:09:15,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:15,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-01-10 01:09:15,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:15,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-01-10 01:09:15,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:15,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-01-10 01:09:15,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:15,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-01-10 01:09:15,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:15,462 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-01-10 01:09:15,462 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 01:09:15,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355490490] [2022-01-10 01:09:15,462 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355490490] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 01:09:15,462 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 01:09:15,462 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 01:09:15,463 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760795100] [2022-01-10 01:09:15,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 01:09:15,464 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 01:09:15,465 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 01:09:15,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 01:09:15,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 01:09:15,465 INFO L87 Difference]: Start difference. First operand 2648 states and 3483 transitions. Second operand has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-01-10 01:09:15,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 01:09:15,851 INFO L93 Difference]: Finished difference Result 6363 states and 8434 transitions. [2022-01-10 01:09:15,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 01:09:15,851 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 115 [2022-01-10 01:09:15,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 01:09:15,872 INFO L225 Difference]: With dead ends: 6363 [2022-01-10 01:09:15,872 INFO L226 Difference]: Without dead ends: 4210 [2022-01-10 01:09:15,876 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-10 01:09:15,877 INFO L933 BasicCegarLoop]: 541 mSDtfsCounter, 417 mSDsluCounter, 705 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 417 SdHoareTripleChecker+Valid, 1246 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 01:09:15,877 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [417 Valid, 1246 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 01:09:15,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4210 states. [2022-01-10 01:09:16,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4210 to 3626. [2022-01-10 01:09:16,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3626 states, 2780 states have (on average 1.3183453237410072) internal successors, (3665), 2817 states have internal predecessors, (3665), 551 states have call successors, (551), 294 states have call predecessors, (551), 294 states have return successors, (551), 514 states have call predecessors, (551), 551 states have call successors, (551) [2022-01-10 01:09:16,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3626 states to 3626 states and 4767 transitions. [2022-01-10 01:09:16,151 INFO L78 Accepts]: Start accepts. Automaton has 3626 states and 4767 transitions. Word has length 115 [2022-01-10 01:09:16,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 01:09:16,151 INFO L470 AbstractCegarLoop]: Abstraction has 3626 states and 4767 transitions. [2022-01-10 01:09:16,151 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-01-10 01:09:16,151 INFO L276 IsEmpty]: Start isEmpty. Operand 3626 states and 4767 transitions. [2022-01-10 01:09:16,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-01-10 01:09:16,153 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 01:09:16,153 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 01:09:16,153 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-01-10 01:09:16,153 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 01:09:16,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 01:09:16,154 INFO L85 PathProgramCache]: Analyzing trace with hash -692474903, now seen corresponding path program 1 times [2022-01-10 01:09:16,154 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 01:09:16,154 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819685126] [2022-01-10 01:09:16,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:09:16,155 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 01:09:16,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:16,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-01-10 01:09:16,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:16,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-01-10 01:09:16,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:16,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-01-10 01:09:16,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:16,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-01-10 01:09:16,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:16,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-01-10 01:09:16,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:16,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-01-10 01:09:16,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:16,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-01-10 01:09:16,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:16,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-01-10 01:09:16,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:16,216 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-01-10 01:09:16,216 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 01:09:16,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819685126] [2022-01-10 01:09:16,216 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819685126] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 01:09:16,216 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 01:09:16,216 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 01:09:16,216 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53767982] [2022-01-10 01:09:16,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 01:09:16,217 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 01:09:16,217 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 01:09:16,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 01:09:16,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 01:09:16,217 INFO L87 Difference]: Start difference. First operand 3626 states and 4767 transitions. Second operand has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-01-10 01:09:16,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 01:09:16,525 INFO L93 Difference]: Finished difference Result 7543 states and 10134 transitions. [2022-01-10 01:09:16,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 01:09:16,526 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 116 [2022-01-10 01:09:16,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 01:09:16,539 INFO L225 Difference]: With dead ends: 7543 [2022-01-10 01:09:16,539 INFO L226 Difference]: Without dead ends: 4010 [2022-01-10 01:09:16,546 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-10 01:09:16,546 INFO L933 BasicCegarLoop]: 324 mSDtfsCounter, 368 mSDsluCounter, 536 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 392 SdHoareTripleChecker+Valid, 860 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 01:09:16,547 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [392 Valid, 860 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 01:09:16,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4010 states. [2022-01-10 01:09:16,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4010 to 3152. [2022-01-10 01:09:16,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3152 states, 2383 states have (on average 1.3176668065463701) internal successors, (3140), 2407 states have internal predecessors, (3140), 502 states have call successors, (502), 266 states have call predecessors, (502), 266 states have return successors, (502), 478 states have call predecessors, (502), 502 states have call successors, (502) [2022-01-10 01:09:16,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3152 states to 3152 states and 4144 transitions. [2022-01-10 01:09:16,806 INFO L78 Accepts]: Start accepts. Automaton has 3152 states and 4144 transitions. Word has length 116 [2022-01-10 01:09:16,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 01:09:16,806 INFO L470 AbstractCegarLoop]: Abstraction has 3152 states and 4144 transitions. [2022-01-10 01:09:16,806 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-01-10 01:09:16,806 INFO L276 IsEmpty]: Start isEmpty. Operand 3152 states and 4144 transitions. [2022-01-10 01:09:16,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-01-10 01:09:16,807 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 01:09:16,807 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 01:09:16,807 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-01-10 01:09:16,808 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 01:09:16,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 01:09:16,808 INFO L85 PathProgramCache]: Analyzing trace with hash -962766154, now seen corresponding path program 1 times [2022-01-10 01:09:16,808 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 01:09:16,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100447645] [2022-01-10 01:09:16,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:09:16,808 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 01:09:16,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:16,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-01-10 01:09:16,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:16,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-01-10 01:09:16,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:16,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-01-10 01:09:16,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:16,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-01-10 01:09:16,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:16,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-01-10 01:09:16,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:16,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-01-10 01:09:16,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:16,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-01-10 01:09:16,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:16,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-01-10 01:09:16,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:16,838 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-01-10 01:09:16,839 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 01:09:16,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100447645] [2022-01-10 01:09:16,839 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100447645] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 01:09:16,839 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 01:09:16,839 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 01:09:16,839 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261198778] [2022-01-10 01:09:16,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 01:09:16,840 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 01:09:16,840 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 01:09:16,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 01:09:16,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 01:09:16,840 INFO L87 Difference]: Start difference. First operand 3152 states and 4144 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-01-10 01:09:17,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 01:09:17,249 INFO L93 Difference]: Finished difference Result 6864 states and 9256 transitions. [2022-01-10 01:09:17,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 01:09:17,249 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 118 [2022-01-10 01:09:17,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 01:09:17,260 INFO L225 Difference]: With dead ends: 6864 [2022-01-10 01:09:17,260 INFO L226 Difference]: Without dead ends: 3925 [2022-01-10 01:09:17,265 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 01:09:17,265 INFO L933 BasicCegarLoop]: 424 mSDtfsCounter, 151 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 659 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 01:09:17,267 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [175 Valid, 659 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 01:09:17,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3925 states. [2022-01-10 01:09:17,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3925 to 3159. [2022-01-10 01:09:17,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3159 states, 2390 states have (on average 1.3167364016736403) internal successors, (3147), 2414 states have internal predecessors, (3147), 502 states have call successors, (502), 266 states have call predecessors, (502), 266 states have return successors, (502), 478 states have call predecessors, (502), 502 states have call successors, (502) [2022-01-10 01:09:17,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3159 states to 3159 states and 4151 transitions. [2022-01-10 01:09:17,542 INFO L78 Accepts]: Start accepts. Automaton has 3159 states and 4151 transitions. Word has length 118 [2022-01-10 01:09:17,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 01:09:17,542 INFO L470 AbstractCegarLoop]: Abstraction has 3159 states and 4151 transitions. [2022-01-10 01:09:17,542 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-01-10 01:09:17,542 INFO L276 IsEmpty]: Start isEmpty. Operand 3159 states and 4151 transitions. [2022-01-10 01:09:17,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-01-10 01:09:17,543 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 01:09:17,544 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 01:09:17,544 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-01-10 01:09:17,544 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 01:09:17,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 01:09:17,545 INFO L85 PathProgramCache]: Analyzing trace with hash -1404528470, now seen corresponding path program 1 times [2022-01-10 01:09:17,545 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 01:09:17,545 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421310849] [2022-01-10 01:09:17,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:09:17,545 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 01:09:17,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:17,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-01-10 01:09:17,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:17,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-01-10 01:09:17,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:17,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-01-10 01:09:17,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:17,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-01-10 01:09:17,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:17,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-01-10 01:09:17,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:17,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-01-10 01:09:17,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:17,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-01-10 01:09:17,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:17,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-01-10 01:09:17,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:17,606 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-01-10 01:09:17,606 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 01:09:17,606 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421310849] [2022-01-10 01:09:17,606 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1421310849] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 01:09:17,606 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 01:09:17,606 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 01:09:17,606 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502819377] [2022-01-10 01:09:17,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 01:09:17,607 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 01:09:17,607 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 01:09:17,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 01:09:17,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 01:09:17,607 INFO L87 Difference]: Start difference. First operand 3159 states and 4151 transitions. Second operand has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-01-10 01:09:17,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 01:09:17,930 INFO L93 Difference]: Finished difference Result 6831 states and 9219 transitions. [2022-01-10 01:09:17,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 01:09:17,930 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 118 [2022-01-10 01:09:17,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 01:09:17,940 INFO L225 Difference]: With dead ends: 6831 [2022-01-10 01:09:17,940 INFO L226 Difference]: Without dead ends: 3818 [2022-01-10 01:09:17,945 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-10 01:09:17,945 INFO L933 BasicCegarLoop]: 344 mSDtfsCounter, 277 mSDsluCounter, 528 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 301 SdHoareTripleChecker+Valid, 872 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 01:09:17,945 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [301 Valid, 872 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 01:09:17,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3818 states. [2022-01-10 01:09:18,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3818 to 2901. [2022-01-10 01:09:18,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2901 states, 2191 states have (on average 1.3144682793245093) internal successors, (2880), 2210 states have internal predecessors, (2880), 464 states have call successors, (464), 245 states have call predecessors, (464), 245 states have return successors, (464), 445 states have call predecessors, (464), 464 states have call successors, (464) [2022-01-10 01:09:18,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2901 states to 2901 states and 3808 transitions. [2022-01-10 01:09:18,165 INFO L78 Accepts]: Start accepts. Automaton has 2901 states and 3808 transitions. Word has length 118 [2022-01-10 01:09:18,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 01:09:18,166 INFO L470 AbstractCegarLoop]: Abstraction has 2901 states and 3808 transitions. [2022-01-10 01:09:18,166 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-01-10 01:09:18,166 INFO L276 IsEmpty]: Start isEmpty. Operand 2901 states and 3808 transitions. [2022-01-10 01:09:18,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2022-01-10 01:09:18,170 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 01:09:18,170 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 01:09:18,170 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-01-10 01:09:18,171 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 01:09:18,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 01:09:18,171 INFO L85 PathProgramCache]: Analyzing trace with hash 1457998733, now seen corresponding path program 1 times [2022-01-10 01:09:18,171 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 01:09:18,171 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411256468] [2022-01-10 01:09:18,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:09:18,171 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 01:09:18,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:18,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-01-10 01:09:18,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:18,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-01-10 01:09:18,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:18,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-01-10 01:09:18,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:18,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-01-10 01:09:18,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:18,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-01-10 01:09:18,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:18,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-01-10 01:09:18,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:18,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-01-10 01:09:18,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:18,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-01-10 01:09:18,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:18,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-01-10 01:09:18,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:18,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-01-10 01:09:18,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:18,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-01-10 01:09:18,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:18,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-01-10 01:09:18,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:18,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-01-10 01:09:18,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:18,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-01-10 01:09:18,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:18,356 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 34 proven. 10 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-01-10 01:09:18,356 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 01:09:18,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411256468] [2022-01-10 01:09:18,356 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411256468] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 01:09:18,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [104219279] [2022-01-10 01:09:18,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:09:18,357 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 01:09:18,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 01:09:18,372 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 01:09:18,375 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-01-10 01:09:18,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:18,544 INFO L263 TraceCheckSpWp]: Trace formula consists of 796 conjuncts, 16 conjunts are in the unsatisfiable core [2022-01-10 01:09:18,552 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 01:09:18,983 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 31 proven. 60 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-10 01:09:18,983 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 01:09:19,262 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 15 proven. 33 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2022-01-10 01:09:19,262 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [104219279] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 01:09:19,262 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 01:09:19,263 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 19 [2022-01-10 01:09:19,263 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650655975] [2022-01-10 01:09:19,263 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 01:09:19,263 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-01-10 01:09:19,263 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 01:09:19,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-01-10 01:09:19,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2022-01-10 01:09:19,264 INFO L87 Difference]: Start difference. First operand 2901 states and 3808 transitions. Second operand has 19 states, 19 states have (on average 14.421052631578947) internal successors, (274), 18 states have internal predecessors, (274), 7 states have call successors, (40), 4 states have call predecessors, (40), 6 states have return successors, (39), 8 states have call predecessors, (39), 7 states have call successors, (39) [2022-01-10 01:09:25,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 01:09:25,434 INFO L93 Difference]: Finished difference Result 10514 states and 14418 transitions. [2022-01-10 01:09:25,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2022-01-10 01:09:25,434 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 14.421052631578947) internal successors, (274), 18 states have internal predecessors, (274), 7 states have call successors, (40), 4 states have call predecessors, (40), 6 states have return successors, (39), 8 states have call predecessors, (39), 7 states have call successors, (39) Word has length 185 [2022-01-10 01:09:25,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 01:09:25,452 INFO L225 Difference]: With dead ends: 10514 [2022-01-10 01:09:25,453 INFO L226 Difference]: Without dead ends: 7856 [2022-01-10 01:09:25,459 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 535 GetRequests, 420 SyntacticMatches, 1 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4892 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2387, Invalid=10953, Unknown=0, NotChecked=0, Total=13340 [2022-01-10 01:09:25,460 INFO L933 BasicCegarLoop]: 637 mSDtfsCounter, 5585 mSDsluCounter, 5594 mSDsCounter, 0 mSdLazyCounter, 4727 mSolverCounterSat, 2390 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5585 SdHoareTripleChecker+Valid, 6231 SdHoareTripleChecker+Invalid, 7117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2390 IncrementalHoareTripleChecker+Valid, 4727 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-01-10 01:09:25,460 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5585 Valid, 6231 Invalid, 7117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2390 Valid, 4727 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2022-01-10 01:09:25,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7856 states. [2022-01-10 01:09:25,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7856 to 4372. [2022-01-10 01:09:25,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4372 states, 3338 states have (on average 1.3118633912522468) internal successors, (4379), 3363 states have internal predecessors, (4379), 666 states have call successors, (666), 367 states have call predecessors, (666), 367 states have return successors, (666), 641 states have call predecessors, (666), 666 states have call successors, (666) [2022-01-10 01:09:25,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4372 states to 4372 states and 5711 transitions. [2022-01-10 01:09:25,894 INFO L78 Accepts]: Start accepts. Automaton has 4372 states and 5711 transitions. Word has length 185 [2022-01-10 01:09:25,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 01:09:25,894 INFO L470 AbstractCegarLoop]: Abstraction has 4372 states and 5711 transitions. [2022-01-10 01:09:25,894 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 14.421052631578947) internal successors, (274), 18 states have internal predecessors, (274), 7 states have call successors, (40), 4 states have call predecessors, (40), 6 states have return successors, (39), 8 states have call predecessors, (39), 7 states have call successors, (39) [2022-01-10 01:09:25,894 INFO L276 IsEmpty]: Start isEmpty. Operand 4372 states and 5711 transitions. [2022-01-10 01:09:25,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2022-01-10 01:09:25,899 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 01:09:25,899 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 01:09:25,935 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-01-10 01:09:26,118 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-01-10 01:09:26,118 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 01:09:26,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 01:09:26,119 INFO L85 PathProgramCache]: Analyzing trace with hash 17651729, now seen corresponding path program 1 times [2022-01-10 01:09:26,119 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 01:09:26,119 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050322502] [2022-01-10 01:09:26,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:09:26,119 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 01:09:26,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:26,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-01-10 01:09:26,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:26,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-01-10 01:09:26,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:26,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-01-10 01:09:26,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:26,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-01-10 01:09:26,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:26,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-01-10 01:09:26,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:26,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-01-10 01:09:26,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:26,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-01-10 01:09:26,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:26,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-01-10 01:09:26,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:26,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-01-10 01:09:26,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:26,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-01-10 01:09:26,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:26,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-01-10 01:09:26,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:26,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-01-10 01:09:26,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:26,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-01-10 01:09:26,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:26,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-01-10 01:09:26,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:26,225 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 15 proven. 22 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-01-10 01:09:26,225 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 01:09:26,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050322502] [2022-01-10 01:09:26,225 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050322502] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 01:09:26,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [617257753] [2022-01-10 01:09:26,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:09:26,225 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 01:09:26,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 01:09:26,240 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 01:09:26,244 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-01-10 01:09:26,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:26,384 INFO L263 TraceCheckSpWp]: Trace formula consists of 770 conjuncts, 10 conjunts are in the unsatisfiable core [2022-01-10 01:09:26,395 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 01:09:26,657 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 70 proven. 4 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-01-10 01:09:26,657 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 01:09:26,908 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 37 proven. 2 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2022-01-10 01:09:26,908 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [617257753] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 01:09:26,908 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 01:09:26,908 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 14 [2022-01-10 01:09:26,909 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565063728] [2022-01-10 01:09:26,909 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 01:09:26,910 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-01-10 01:09:26,910 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 01:09:26,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-01-10 01:09:26,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2022-01-10 01:09:26,910 INFO L87 Difference]: Start difference. First operand 4372 states and 5711 transitions. Second operand has 14 states, 14 states have (on average 18.785714285714285) internal successors, (263), 13 states have internal predecessors, (263), 6 states have call successors, (37), 4 states have call predecessors, (37), 6 states have return successors, (37), 7 states have call predecessors, (37), 6 states have call successors, (37) [2022-01-10 01:09:29,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 01:09:29,587 INFO L93 Difference]: Finished difference Result 11427 states and 15614 transitions. [2022-01-10 01:09:29,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2022-01-10 01:09:29,587 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 18.785714285714285) internal successors, (263), 13 states have internal predecessors, (263), 6 states have call successors, (37), 4 states have call predecessors, (37), 6 states have return successors, (37), 7 states have call predecessors, (37), 6 states have call successors, (37) Word has length 185 [2022-01-10 01:09:29,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 01:09:29,646 INFO L225 Difference]: With dead ends: 11427 [2022-01-10 01:09:29,646 INFO L226 Difference]: Without dead ends: 7426 [2022-01-10 01:09:29,654 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 466 GetRequests, 402 SyntacticMatches, 1 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1363 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=749, Invalid=3411, Unknown=0, NotChecked=0, Total=4160 [2022-01-10 01:09:29,655 INFO L933 BasicCegarLoop]: 475 mSDtfsCounter, 2901 mSDsluCounter, 3949 mSDsCounter, 0 mSdLazyCounter, 1989 mSolverCounterSat, 816 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2901 SdHoareTripleChecker+Valid, 4424 SdHoareTripleChecker+Invalid, 2805 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 816 IncrementalHoareTripleChecker+Valid, 1989 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-01-10 01:09:29,655 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2901 Valid, 4424 Invalid, 2805 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [816 Valid, 1989 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-01-10 01:09:29,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7426 states. [2022-01-10 01:09:30,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7426 to 4372. [2022-01-10 01:09:30,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4372 states, 3338 states have (on average 1.3067705212702216) internal successors, (4362), 3363 states have internal predecessors, (4362), 666 states have call successors, (666), 367 states have call predecessors, (666), 367 states have return successors, (666), 641 states have call predecessors, (666), 666 states have call successors, (666) [2022-01-10 01:09:30,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4372 states to 4372 states and 5694 transitions. [2022-01-10 01:09:30,138 INFO L78 Accepts]: Start accepts. Automaton has 4372 states and 5694 transitions. Word has length 185 [2022-01-10 01:09:30,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 01:09:30,139 INFO L470 AbstractCegarLoop]: Abstraction has 4372 states and 5694 transitions. [2022-01-10 01:09:30,139 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 18.785714285714285) internal successors, (263), 13 states have internal predecessors, (263), 6 states have call successors, (37), 4 states have call predecessors, (37), 6 states have return successors, (37), 7 states have call predecessors, (37), 6 states have call successors, (37) [2022-01-10 01:09:30,139 INFO L276 IsEmpty]: Start isEmpty. Operand 4372 states and 5694 transitions. [2022-01-10 01:09:30,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2022-01-10 01:09:30,145 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 01:09:30,145 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 01:09:30,164 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-01-10 01:09:30,361 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-01-10 01:09:30,362 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 01:09:30,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 01:09:30,362 INFO L85 PathProgramCache]: Analyzing trace with hash 264749648, now seen corresponding path program 1 times [2022-01-10 01:09:30,362 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 01:09:30,362 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592924135] [2022-01-10 01:09:30,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:09:30,362 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 01:09:30,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:30,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-01-10 01:09:30,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:30,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-01-10 01:09:30,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:30,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-01-10 01:09:30,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:30,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-01-10 01:09:30,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:30,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-01-10 01:09:30,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:30,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-01-10 01:09:30,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:30,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-01-10 01:09:30,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:30,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-01-10 01:09:30,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:30,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-01-10 01:09:30,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:30,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-01-10 01:09:30,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:30,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-01-10 01:09:30,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:30,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-01-10 01:09:30,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:30,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2022-01-10 01:09:30,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:30,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2022-01-10 01:09:30,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:30,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2022-01-10 01:09:30,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:30,454 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2022-01-10 01:09:30,454 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 01:09:30,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592924135] [2022-01-10 01:09:30,455 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592924135] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 01:09:30,455 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 01:09:30,455 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-10 01:09:30,455 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501491033] [2022-01-10 01:09:30,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 01:09:30,455 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 01:09:30,455 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 01:09:30,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 01:09:30,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-10 01:09:30,456 INFO L87 Difference]: Start difference. First operand 4372 states and 5694 transitions. Second operand has 7 states, 7 states have (on average 16.428571428571427) internal successors, (115), 6 states have internal predecessors, (115), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) [2022-01-10 01:09:31,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 01:09:31,853 INFO L93 Difference]: Finished difference Result 14760 states and 19864 transitions. [2022-01-10 01:09:31,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-10 01:09:31,853 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.428571428571427) internal successors, (115), 6 states have internal predecessors, (115), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) Word has length 194 [2022-01-10 01:09:31,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 01:09:31,879 INFO L225 Difference]: With dead ends: 14760 [2022-01-10 01:09:31,879 INFO L226 Difference]: Without dead ends: 10786 [2022-01-10 01:09:31,885 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2022-01-10 01:09:31,887 INFO L933 BasicCegarLoop]: 550 mSDtfsCounter, 808 mSDsluCounter, 2408 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 825 SdHoareTripleChecker+Valid, 2958 SdHoareTripleChecker+Invalid, 351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 01:09:31,887 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [825 Valid, 2958 Invalid, 351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-10 01:09:31,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10786 states. [2022-01-10 01:09:32,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10786 to 6092. [2022-01-10 01:09:32,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6092 states, 4582 states have (on average 1.304452204277608) internal successors, (5977), 4619 states have internal predecessors, (5977), 986 states have call successors, (986), 523 states have call predecessors, (986), 523 states have return successors, (986), 949 states have call predecessors, (986), 986 states have call successors, (986) [2022-01-10 01:09:32,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6092 states to 6092 states and 7949 transitions. [2022-01-10 01:09:32,553 INFO L78 Accepts]: Start accepts. Automaton has 6092 states and 7949 transitions. Word has length 194 [2022-01-10 01:09:32,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 01:09:32,553 INFO L470 AbstractCegarLoop]: Abstraction has 6092 states and 7949 transitions. [2022-01-10 01:09:32,553 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.428571428571427) internal successors, (115), 6 states have internal predecessors, (115), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) [2022-01-10 01:09:32,566 INFO L276 IsEmpty]: Start isEmpty. Operand 6092 states and 7949 transitions. [2022-01-10 01:09:32,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2022-01-10 01:09:32,588 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 01:09:32,588 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 01:09:32,588 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-01-10 01:09:32,588 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 01:09:32,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 01:09:32,588 INFO L85 PathProgramCache]: Analyzing trace with hash 322517035, now seen corresponding path program 1 times [2022-01-10 01:09:32,588 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 01:09:32,588 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362596571] [2022-01-10 01:09:32,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:09:32,589 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 01:09:32,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:32,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-01-10 01:09:32,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:32,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-01-10 01:09:32,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:32,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-01-10 01:09:32,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:32,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-01-10 01:09:32,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:32,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-01-10 01:09:32,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:32,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-01-10 01:09:32,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:32,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-01-10 01:09:32,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:32,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-01-10 01:09:32,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:32,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-01-10 01:09:32,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:32,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-01-10 01:09:32,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:32,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-01-10 01:09:32,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:32,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2022-01-10 01:09:32,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:32,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2022-01-10 01:09:32,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:32,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-01-10 01:09:32,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:32,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2022-01-10 01:09:32,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:32,762 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 15 proven. 24 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2022-01-10 01:09:32,762 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 01:09:32,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362596571] [2022-01-10 01:09:32,762 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362596571] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 01:09:32,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1573362091] [2022-01-10 01:09:32,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:09:32,762 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 01:09:32,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 01:09:32,768 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 01:09:32,799 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-01-10 01:09:32,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:32,914 INFO L263 TraceCheckSpWp]: Trace formula consists of 793 conjuncts, 16 conjunts are in the unsatisfiable core [2022-01-10 01:09:32,919 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 01:09:33,287 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 34 proven. 57 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-10 01:09:33,288 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 01:09:33,652 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 16 proven. 25 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2022-01-10 01:09:33,652 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1573362091] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 01:09:33,652 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 01:09:33,652 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 16 [2022-01-10 01:09:33,653 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826643018] [2022-01-10 01:09:33,653 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 01:09:33,653 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-01-10 01:09:33,653 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 01:09:33,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-01-10 01:09:33,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2022-01-10 01:09:33,654 INFO L87 Difference]: Start difference. First operand 6092 states and 7949 transitions. Second operand has 16 states, 16 states have (on average 18.125) internal successors, (290), 15 states have internal predecessors, (290), 7 states have call successors, (44), 4 states have call predecessors, (44), 6 states have return successors, (43), 8 states have call predecessors, (43), 7 states have call successors, (43) [2022-01-10 01:09:42,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 01:09:42,084 INFO L93 Difference]: Finished difference Result 25522 states and 34804 transitions. [2022-01-10 01:09:42,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 135 states. [2022-01-10 01:09:42,084 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 18.125) internal successors, (290), 15 states have internal predecessors, (290), 7 states have call successors, (44), 4 states have call predecessors, (44), 6 states have return successors, (43), 8 states have call predecessors, (43), 7 states have call successors, (43) Word has length 196 [2022-01-10 01:09:42,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 01:09:42,127 INFO L225 Difference]: With dead ends: 25522 [2022-01-10 01:09:42,127 INFO L226 Difference]: Without dead ends: 19828 [2022-01-10 01:09:42,142 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 620 GetRequests, 473 SyntacticMatches, 1 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8834 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=3372, Invalid=18384, Unknown=0, NotChecked=0, Total=21756 [2022-01-10 01:09:42,143 INFO L933 BasicCegarLoop]: 839 mSDtfsCounter, 11472 mSDsluCounter, 5337 mSDsCounter, 0 mSdLazyCounter, 4102 mSolverCounterSat, 5284 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11472 SdHoareTripleChecker+Valid, 6176 SdHoareTripleChecker+Invalid, 9386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5284 IncrementalHoareTripleChecker+Valid, 4102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2022-01-10 01:09:42,143 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11472 Valid, 6176 Invalid, 9386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5284 Valid, 4102 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2022-01-10 01:09:42,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19828 states. [2022-01-10 01:09:43,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19828 to 8800. [2022-01-10 01:09:43,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8800 states, 6592 states have (on average 1.2999089805825244) internal successors, (8569), 6647 states have internal predecessors, (8569), 1438 states have call successors, (1438), 769 states have call predecessors, (1438), 769 states have return successors, (1438), 1383 states have call predecessors, (1438), 1438 states have call successors, (1438) [2022-01-10 01:09:43,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8800 states to 8800 states and 11445 transitions. [2022-01-10 01:09:43,215 INFO L78 Accepts]: Start accepts. Automaton has 8800 states and 11445 transitions. Word has length 196 [2022-01-10 01:09:43,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 01:09:43,216 INFO L470 AbstractCegarLoop]: Abstraction has 8800 states and 11445 transitions. [2022-01-10 01:09:43,216 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 18.125) internal successors, (290), 15 states have internal predecessors, (290), 7 states have call successors, (44), 4 states have call predecessors, (44), 6 states have return successors, (43), 8 states have call predecessors, (43), 7 states have call successors, (43) [2022-01-10 01:09:43,216 INFO L276 IsEmpty]: Start isEmpty. Operand 8800 states and 11445 transitions. [2022-01-10 01:09:43,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2022-01-10 01:09:43,227 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 01:09:43,227 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 01:09:43,259 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-01-10 01:09:43,444 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 01:09:43,445 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 01:09:43,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 01:09:43,445 INFO L85 PathProgramCache]: Analyzing trace with hash -607517794, now seen corresponding path program 1 times [2022-01-10 01:09:43,445 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 01:09:43,445 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022141150] [2022-01-10 01:09:43,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:09:43,445 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 01:09:43,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:43,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-01-10 01:09:43,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:43,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-01-10 01:09:43,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:43,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-01-10 01:09:43,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:43,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-01-10 01:09:43,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:43,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-01-10 01:09:43,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:43,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-01-10 01:09:43,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:43,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-01-10 01:09:43,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:43,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-01-10 01:09:43,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:43,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-01-10 01:09:43,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:43,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-01-10 01:09:43,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:43,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-01-10 01:09:43,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:43,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2022-01-10 01:09:43,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:43,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2022-01-10 01:09:43,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:43,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2022-01-10 01:09:43,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:43,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2022-01-10 01:09:43,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:43,619 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 25 proven. 9 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2022-01-10 01:09:43,619 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 01:09:43,620 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022141150] [2022-01-10 01:09:43,620 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022141150] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 01:09:43,620 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1146340611] [2022-01-10 01:09:43,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:09:43,620 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 01:09:43,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 01:09:43,621 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 01:09:43,651 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-01-10 01:09:43,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:43,767 INFO L263 TraceCheckSpWp]: Trace formula consists of 818 conjuncts, 11 conjunts are in the unsatisfiable core [2022-01-10 01:09:43,770 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 01:09:44,116 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 52 proven. 4 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-01-10 01:09:44,116 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 01:09:44,384 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 29 proven. 2 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-01-10 01:09:44,384 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1146340611] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 01:09:44,384 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 01:09:44,384 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 7] total 17 [2022-01-10 01:09:44,384 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242815234] [2022-01-10 01:09:44,384 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 01:09:44,385 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-01-10 01:09:44,385 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 01:09:44,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-01-10 01:09:44,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2022-01-10 01:09:44,386 INFO L87 Difference]: Start difference. First operand 8800 states and 11445 transitions. Second operand has 17 states, 17 states have (on average 14.529411764705882) internal successors, (247), 16 states have internal predecessors, (247), 6 states have call successors, (37), 4 states have call predecessors, (37), 6 states have return successors, (37), 7 states have call predecessors, (37), 6 states have call successors, (37) [2022-01-10 01:09:50,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 01:09:50,014 INFO L93 Difference]: Finished difference Result 26193 states and 35896 transitions. [2022-01-10 01:09:50,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2022-01-10 01:09:50,014 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 14.529411764705882) internal successors, (247), 16 states have internal predecessors, (247), 6 states have call successors, (37), 4 states have call predecessors, (37), 6 states have return successors, (37), 7 states have call predecessors, (37), 6 states have call successors, (37) Word has length 197 [2022-01-10 01:09:50,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 01:09:50,094 INFO L225 Difference]: With dead ends: 26193 [2022-01-10 01:09:50,094 INFO L226 Difference]: Without dead ends: 17713 [2022-01-10 01:09:50,131 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 493 GetRequests, 425 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1400 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=662, Invalid=4168, Unknown=0, NotChecked=0, Total=4830 [2022-01-10 01:09:50,131 INFO L933 BasicCegarLoop]: 857 mSDtfsCounter, 2578 mSDsluCounter, 8149 mSDsCounter, 0 mSdLazyCounter, 4836 mSolverCounterSat, 1209 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2578 SdHoareTripleChecker+Valid, 9006 SdHoareTripleChecker+Invalid, 6045 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1209 IncrementalHoareTripleChecker+Valid, 4836 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-01-10 01:09:50,131 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2578 Valid, 9006 Invalid, 6045 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1209 Valid, 4836 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-01-10 01:09:50,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17713 states. [2022-01-10 01:09:51,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17713 to 10196. [2022-01-10 01:09:51,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10196 states, 7614 states have (on average 1.2966903073286051) internal successors, (9873), 7679 states have internal predecessors, (9873), 1676 states have call successors, (1676), 905 states have call predecessors, (1676), 905 states have return successors, (1676), 1611 states have call predecessors, (1676), 1676 states have call successors, (1676) [2022-01-10 01:09:51,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10196 states to 10196 states and 13225 transitions. [2022-01-10 01:09:51,610 INFO L78 Accepts]: Start accepts. Automaton has 10196 states and 13225 transitions. Word has length 197 [2022-01-10 01:09:51,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 01:09:51,610 INFO L470 AbstractCegarLoop]: Abstraction has 10196 states and 13225 transitions. [2022-01-10 01:09:51,610 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 14.529411764705882) internal successors, (247), 16 states have internal predecessors, (247), 6 states have call successors, (37), 4 states have call predecessors, (37), 6 states have return successors, (37), 7 states have call predecessors, (37), 6 states have call successors, (37) [2022-01-10 01:09:51,610 INFO L276 IsEmpty]: Start isEmpty. Operand 10196 states and 13225 transitions. [2022-01-10 01:09:51,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2022-01-10 01:09:51,621 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 01:09:51,621 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 01:09:51,657 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-01-10 01:09:51,838 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 01:09:51,838 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 01:09:51,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 01:09:51,838 INFO L85 PathProgramCache]: Analyzing trace with hash 266392652, now seen corresponding path program 1 times [2022-01-10 01:09:51,838 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 01:09:51,838 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635785512] [2022-01-10 01:09:51,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:09:51,839 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 01:09:51,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:51,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-01-10 01:09:51,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:51,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-01-10 01:09:51,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:51,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-01-10 01:09:51,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:51,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-01-10 01:09:51,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:51,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-01-10 01:09:51,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:51,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-01-10 01:09:51,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:51,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-01-10 01:09:51,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:51,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-01-10 01:09:51,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:51,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-01-10 01:09:51,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:51,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-01-10 01:09:51,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:51,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-01-10 01:09:51,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:51,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2022-01-10 01:09:51,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:51,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2022-01-10 01:09:51,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:51,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2022-01-10 01:09:51,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:51,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2022-01-10 01:09:51,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:51,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2022-01-10 01:09:51,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:51,941 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 36 proven. 6 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2022-01-10 01:09:51,942 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 01:09:51,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635785512] [2022-01-10 01:09:51,942 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635785512] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 01:09:51,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [524948622] [2022-01-10 01:09:51,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:09:51,942 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 01:09:51,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 01:09:51,956 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 01:09:51,956 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-01-10 01:09:52,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:52,106 INFO L263 TraceCheckSpWp]: Trace formula consists of 810 conjuncts, 10 conjunts are in the unsatisfiable core [2022-01-10 01:09:52,108 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 01:09:52,434 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 74 proven. 4 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-01-10 01:09:52,434 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 01:09:52,747 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 36 proven. 6 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2022-01-10 01:09:52,747 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [524948622] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 01:09:52,747 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 01:09:52,747 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 9 [2022-01-10 01:09:52,747 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917309989] [2022-01-10 01:09:52,747 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 01:09:52,748 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-10 01:09:52,748 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 01:09:52,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-10 01:09:52,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-01-10 01:09:52,749 INFO L87 Difference]: Start difference. First operand 10196 states and 13225 transitions. Second operand has 9 states, 9 states have (on average 20.0) internal successors, (180), 8 states have internal predecessors, (180), 3 states have call successors, (30), 4 states have call predecessors, (30), 7 states have return successors, (31), 4 states have call predecessors, (31), 3 states have call successors, (31) [2022-01-10 01:09:54,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 01:09:54,858 INFO L93 Difference]: Finished difference Result 24217 states and 32536 transitions. [2022-01-10 01:09:54,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-10 01:09:54,859 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 20.0) internal successors, (180), 8 states have internal predecessors, (180), 3 states have call successors, (30), 4 states have call predecessors, (30), 7 states have return successors, (31), 4 states have call predecessors, (31), 3 states have call successors, (31) Word has length 205 [2022-01-10 01:09:54,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 01:09:54,891 INFO L225 Difference]: With dead ends: 24217 [2022-01-10 01:09:54,891 INFO L226 Difference]: Without dead ends: 14409 [2022-01-10 01:09:54,902 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 451 GetRequests, 439 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-01-10 01:09:54,903 INFO L933 BasicCegarLoop]: 418 mSDtfsCounter, 284 mSDsluCounter, 2208 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 306 SdHoareTripleChecker+Valid, 2626 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 01:09:54,903 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [306 Valid, 2626 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 01:09:54,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14409 states. [2022-01-10 01:09:56,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14409 to 10196. [2022-01-10 01:09:56,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10196 states, 7614 states have (on average 1.2957709482532178) internal successors, (9866), 7679 states have internal predecessors, (9866), 1676 states have call successors, (1676), 905 states have call predecessors, (1676), 905 states have return successors, (1676), 1611 states have call predecessors, (1676), 1676 states have call successors, (1676) [2022-01-10 01:09:56,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10196 states to 10196 states and 13218 transitions. [2022-01-10 01:09:56,248 INFO L78 Accepts]: Start accepts. Automaton has 10196 states and 13218 transitions. Word has length 205 [2022-01-10 01:09:56,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 01:09:56,248 INFO L470 AbstractCegarLoop]: Abstraction has 10196 states and 13218 transitions. [2022-01-10 01:09:56,248 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 20.0) internal successors, (180), 8 states have internal predecessors, (180), 3 states have call successors, (30), 4 states have call predecessors, (30), 7 states have return successors, (31), 4 states have call predecessors, (31), 3 states have call successors, (31) [2022-01-10 01:09:56,248 INFO L276 IsEmpty]: Start isEmpty. Operand 10196 states and 13218 transitions. [2022-01-10 01:09:56,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2022-01-10 01:09:56,261 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 01:09:56,261 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 01:09:56,278 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-01-10 01:09:56,475 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2022-01-10 01:09:56,476 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 01:09:56,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 01:09:56,476 INFO L85 PathProgramCache]: Analyzing trace with hash -395672383, now seen corresponding path program 1 times [2022-01-10 01:09:56,476 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 01:09:56,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936641500] [2022-01-10 01:09:56,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:09:56,476 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 01:09:56,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:56,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-01-10 01:09:56,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:56,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-01-10 01:09:56,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:56,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-01-10 01:09:56,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:56,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-01-10 01:09:56,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:56,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-01-10 01:09:56,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:56,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-01-10 01:09:56,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:56,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-01-10 01:09:56,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:56,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-01-10 01:09:56,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:56,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-01-10 01:09:56,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:56,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-01-10 01:09:56,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:56,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-01-10 01:09:56,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:56,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-01-10 01:09:56,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:56,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-01-10 01:09:56,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:56,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-01-10 01:09:56,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:56,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2022-01-10 01:09:56,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:56,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2022-01-10 01:09:56,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:56,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2022-01-10 01:09:56,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:56,579 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2022-01-10 01:09:56,579 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 01:09:56,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936641500] [2022-01-10 01:09:56,579 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936641500] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 01:09:56,579 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 01:09:56,579 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 01:09:56,579 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346647238] [2022-01-10 01:09:56,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 01:09:56,580 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 01:09:56,580 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 01:09:56,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 01:09:56,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 01:09:56,581 INFO L87 Difference]: Start difference. First operand 10196 states and 13218 transitions. Second operand has 5 states, 4 states have (on average 29.5) internal successors, (118), 5 states have internal predecessors, (118), 3 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) [2022-01-10 01:09:57,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 01:09:57,365 INFO L93 Difference]: Finished difference Result 16446 states and 21413 transitions. [2022-01-10 01:09:57,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 01:09:57,366 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 29.5) internal successors, (118), 5 states have internal predecessors, (118), 3 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) Word has length 212 [2022-01-10 01:09:57,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 01:09:57,380 INFO L225 Difference]: With dead ends: 16446 [2022-01-10 01:09:57,381 INFO L226 Difference]: Without dead ends: 6606 [2022-01-10 01:09:57,392 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-01-10 01:09:57,392 INFO L933 BasicCegarLoop]: 284 mSDtfsCounter, 2 mSDsluCounter, 838 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1122 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 01:09:57,392 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 1122 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 01:09:57,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6606 states. [2022-01-10 01:09:58,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6606 to 6606. [2022-01-10 01:09:58,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6606 states, 4948 states have (on average 1.2954729183508489) internal successors, (6410), 4989 states have internal predecessors, (6410), 1080 states have call successors, (1080), 577 states have call predecessors, (1080), 577 states have return successors, (1080), 1039 states have call predecessors, (1080), 1080 states have call successors, (1080) [2022-01-10 01:09:58,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6606 states to 6606 states and 8570 transitions. [2022-01-10 01:09:58,199 INFO L78 Accepts]: Start accepts. Automaton has 6606 states and 8570 transitions. Word has length 212 [2022-01-10 01:09:58,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 01:09:58,199 INFO L470 AbstractCegarLoop]: Abstraction has 6606 states and 8570 transitions. [2022-01-10 01:09:58,199 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 29.5) internal successors, (118), 5 states have internal predecessors, (118), 3 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) [2022-01-10 01:09:58,199 INFO L276 IsEmpty]: Start isEmpty. Operand 6606 states and 8570 transitions. [2022-01-10 01:09:58,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2022-01-10 01:09:58,206 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 01:09:58,206 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 01:09:58,206 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-01-10 01:09:58,206 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 01:09:58,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 01:09:58,207 INFO L85 PathProgramCache]: Analyzing trace with hash -56266143, now seen corresponding path program 1 times [2022-01-10 01:09:58,207 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 01:09:58,207 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194994851] [2022-01-10 01:09:58,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:09:58,207 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 01:09:58,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:58,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-01-10 01:09:58,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:58,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-01-10 01:09:58,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:58,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-01-10 01:09:58,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:58,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-01-10 01:09:58,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:58,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-01-10 01:09:58,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:58,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-01-10 01:09:58,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:58,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-01-10 01:09:58,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:58,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-01-10 01:09:58,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:58,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-01-10 01:09:58,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:58,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-01-10 01:09:58,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:58,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-01-10 01:09:58,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:58,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-01-10 01:09:58,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:58,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-01-10 01:09:58,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:58,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-01-10 01:09:58,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:58,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2022-01-10 01:09:58,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:58,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2022-01-10 01:09:58,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:58,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2022-01-10 01:09:58,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:58,280 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-01-10 01:09:58,280 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 01:09:58,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194994851] [2022-01-10 01:09:58,280 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194994851] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 01:09:58,280 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 01:09:58,280 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 01:09:58,280 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852195112] [2022-01-10 01:09:58,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 01:09:58,281 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 01:09:58,281 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 01:09:58,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 01:09:58,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-01-10 01:09:58,281 INFO L87 Difference]: Start difference. First operand 6606 states and 8570 transitions. Second operand has 5 states, 5 states have (on average 26.0) internal successors, (130), 5 states have internal predecessors, (130), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-01-10 01:09:59,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 01:09:59,066 INFO L93 Difference]: Finished difference Result 12559 states and 16371 transitions. [2022-01-10 01:09:59,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 01:09:59,067 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.0) internal successors, (130), 5 states have internal predecessors, (130), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 212 [2022-01-10 01:09:59,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 01:09:59,120 INFO L225 Difference]: With dead ends: 12559 [2022-01-10 01:09:59,120 INFO L226 Difference]: Without dead ends: 6242 [2022-01-10 01:09:59,126 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-01-10 01:09:59,127 INFO L933 BasicCegarLoop]: 245 mSDtfsCounter, 277 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 01:09:59,128 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [277 Valid, 426 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 01:09:59,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6242 states. [2022-01-10 01:09:59,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6242 to 6242. [2022-01-10 01:09:59,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6242 states, 4678 states have (on average 1.2967079948696023) internal successors, (6066), 4717 states have internal predecessors, (6066), 1020 states have call successors, (1020), 543 states have call predecessors, (1020), 543 states have return successors, (1020), 981 states have call predecessors, (1020), 1020 states have call successors, (1020) [2022-01-10 01:09:59,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6242 states to 6242 states and 8106 transitions. [2022-01-10 01:09:59,843 INFO L78 Accepts]: Start accepts. Automaton has 6242 states and 8106 transitions. Word has length 212 [2022-01-10 01:09:59,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 01:09:59,844 INFO L470 AbstractCegarLoop]: Abstraction has 6242 states and 8106 transitions. [2022-01-10 01:09:59,844 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.0) internal successors, (130), 5 states have internal predecessors, (130), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-01-10 01:09:59,844 INFO L276 IsEmpty]: Start isEmpty. Operand 6242 states and 8106 transitions. [2022-01-10 01:09:59,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2022-01-10 01:09:59,849 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 01:09:59,849 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 01:09:59,849 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-01-10 01:09:59,850 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 01:09:59,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 01:09:59,850 INFO L85 PathProgramCache]: Analyzing trace with hash 598590481, now seen corresponding path program 1 times [2022-01-10 01:09:59,850 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 01:09:59,850 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603020505] [2022-01-10 01:09:59,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:09:59,850 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 01:09:59,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:59,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-01-10 01:09:59,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:59,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-01-10 01:09:59,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:59,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-01-10 01:09:59,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:59,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-01-10 01:09:59,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:59,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-01-10 01:09:59,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:59,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-01-10 01:09:59,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:59,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-01-10 01:09:59,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:59,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-01-10 01:09:59,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:59,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-01-10 01:09:59,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:59,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-01-10 01:09:59,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:59,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-01-10 01:09:59,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:59,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-01-10 01:09:59,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:59,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-01-10 01:09:59,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:59,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2022-01-10 01:09:59,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:59,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2022-01-10 01:09:59,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:59,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2022-01-10 01:09:59,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:59,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2022-01-10 01:09:59,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:09:59,925 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2022-01-10 01:09:59,925 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 01:09:59,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603020505] [2022-01-10 01:09:59,925 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603020505] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 01:09:59,925 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 01:09:59,926 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 01:09:59,926 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196825663] [2022-01-10 01:09:59,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 01:09:59,926 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 01:09:59,926 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 01:09:59,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 01:09:59,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-01-10 01:09:59,927 INFO L87 Difference]: Start difference. First operand 6242 states and 8106 transitions. Second operand has 5 states, 5 states have (on average 23.0) internal successors, (115), 5 states have internal predecessors, (115), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-01-10 01:10:00,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 01:10:00,709 INFO L93 Difference]: Finished difference Result 11965 states and 15594 transitions. [2022-01-10 01:10:00,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 01:10:00,709 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.0) internal successors, (115), 5 states have internal predecessors, (115), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 214 [2022-01-10 01:10:00,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 01:10:00,718 INFO L225 Difference]: With dead ends: 11965 [2022-01-10 01:10:00,719 INFO L226 Difference]: Without dead ends: 5930 [2022-01-10 01:10:00,725 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-01-10 01:10:00,726 INFO L933 BasicCegarLoop]: 245 mSDtfsCounter, 277 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 01:10:00,726 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [277 Valid, 428 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 01:10:00,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5930 states. [2022-01-10 01:10:01,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5930 to 5772. [2022-01-10 01:10:01,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5772 states, 4324 states have (on average 1.299722479185939) internal successors, (5620), 4360 states have internal predecessors, (5620), 943 states have call successors, (943), 504 states have call predecessors, (943), 504 states have return successors, (943), 907 states have call predecessors, (943), 943 states have call successors, (943) [2022-01-10 01:10:01,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5772 states to 5772 states and 7506 transitions. [2022-01-10 01:10:01,445 INFO L78 Accepts]: Start accepts. Automaton has 5772 states and 7506 transitions. Word has length 214 [2022-01-10 01:10:01,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 01:10:01,445 INFO L470 AbstractCegarLoop]: Abstraction has 5772 states and 7506 transitions. [2022-01-10 01:10:01,445 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.0) internal successors, (115), 5 states have internal predecessors, (115), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-01-10 01:10:01,445 INFO L276 IsEmpty]: Start isEmpty. Operand 5772 states and 7506 transitions. [2022-01-10 01:10:01,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2022-01-10 01:10:01,450 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 01:10:01,450 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 01:10:01,450 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-01-10 01:10:01,451 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 01:10:01,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 01:10:01,451 INFO L85 PathProgramCache]: Analyzing trace with hash -1490841889, now seen corresponding path program 1 times [2022-01-10 01:10:01,451 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 01:10:01,451 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915340072] [2022-01-10 01:10:01,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:10:01,451 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 01:10:01,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:10:01,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-01-10 01:10:01,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:10:01,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-01-10 01:10:01,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:10:01,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-01-10 01:10:01,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:10:01,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-01-10 01:10:01,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:10:01,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-01-10 01:10:01,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:10:01,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-01-10 01:10:01,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:10:01,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-01-10 01:10:01,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:10:01,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-01-10 01:10:01,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:10:01,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-01-10 01:10:01,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:10:01,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-01-10 01:10:01,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:10:01,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-01-10 01:10:01,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:10:01,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-01-10 01:10:01,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:10:01,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2022-01-10 01:10:01,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:10:01,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2022-01-10 01:10:01,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:10:01,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2022-01-10 01:10:01,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:10:01,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2022-01-10 01:10:01,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:10:01,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2022-01-10 01:10:01,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:10:01,630 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 29 proven. 19 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2022-01-10 01:10:01,630 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 01:10:01,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915340072] [2022-01-10 01:10:01,631 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915340072] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 01:10:01,631 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [744089883] [2022-01-10 01:10:01,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:10:01,631 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 01:10:01,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 01:10:01,647 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 01:10:01,648 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-01-10 01:10:01,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:10:01,798 INFO L263 TraceCheckSpWp]: Trace formula consists of 854 conjuncts, 24 conjunts are in the unsatisfiable core [2022-01-10 01:10:01,802 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 01:10:02,592 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 82 proven. 27 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-01-10 01:10:02,593 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 01:10:03,061 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 29 proven. 19 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2022-01-10 01:10:03,061 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [744089883] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 01:10:03,061 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 01:10:03,061 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 11] total 25 [2022-01-10 01:10:03,061 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387140979] [2022-01-10 01:10:03,061 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 01:10:03,062 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-01-10 01:10:03,062 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 01:10:03,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-01-10 01:10:03,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=525, Unknown=0, NotChecked=0, Total=600 [2022-01-10 01:10:03,063 INFO L87 Difference]: Start difference. First operand 5772 states and 7506 transitions. Second operand has 25 states, 25 states have (on average 12.96) internal successors, (324), 25 states have internal predecessors, (324), 9 states have call successors, (46), 5 states have call predecessors, (46), 5 states have return successors, (45), 9 states have call predecessors, (45), 9 states have call successors, (45)