/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/AutomizerCInlineTransformed.xml -s ../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_LAZY.epf -i ../../../trunk/examples/svcomp/bitvector/soft_float_1-2a.c.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 14:18:22,745 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 14:18:22,746 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 14:18:22,799 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 14:18:22,800 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 14:18:22,801 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 14:18:22,801 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 14:18:22,803 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 14:18:22,804 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 14:18:22,804 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 14:18:22,805 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 14:18:22,805 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 14:18:22,805 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 14:18:22,806 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 14:18:22,807 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 14:18:22,807 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 14:18:22,808 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 14:18:22,809 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 14:18:22,813 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 14:18:22,814 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 14:18:22,815 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 14:18:22,819 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 14:18:22,819 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 14:18:22,820 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 14:18:22,821 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 14:18:22,821 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 14:18:22,822 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 14:18:22,822 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 14:18:22,822 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 14:18:22,823 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 14:18:22,823 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 14:18:22,823 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 14:18:22,824 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 14:18:22,824 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 14:18:22,825 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 14:18:22,825 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 14:18:22,825 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 14:18:22,825 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 14:18:22,826 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 14:18:22,826 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 14:18:22,827 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 14:18:22,829 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_LAZY.epf [2022-01-10 14:18:22,857 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 14:18:22,858 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 14:18:22,858 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 14:18:22,858 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 14:18:22,859 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 14:18:22,859 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 14:18:22,859 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 14:18:22,859 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 14:18:22,859 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 14:18:22,860 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 14:18:22,860 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 14:18:22,860 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 14:18:22,860 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 14:18:22,860 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 14:18:22,860 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-10 14:18:22,861 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-10 14:18:22,861 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 14:18:22,861 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 14:18:22,861 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 14:18:22,861 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 14:18:22,861 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 14:18:22,862 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 14:18:22,862 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 14:18:22,862 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 14:18:22,862 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 14:18:22,862 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-10 14:18:22,862 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-10 14:18:22,862 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 14:18:22,863 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 14:18:22,863 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 14:18:22,863 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-01-10 14:18:22,863 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-10 14:18:22,864 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-10 14:18:22,864 INFO L138 SettingsManager]: * TransformationType=BV_TO_INT_LAZY 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 14:18:23,058 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 14:18:23,082 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 14:18:23,084 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 14:18:23,085 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 14:18:23,086 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 14:18:23,087 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/bitvector/soft_float_1-2a.c.cil.c [2022-01-10 14:18:23,129 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fcd096636/9ef0e35bc2b64de68a8af00d96bc2477/FLAGbb7997b1c [2022-01-10 14:18:23,523 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 14:18:23,523 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/bitvector/soft_float_1-2a.c.cil.c [2022-01-10 14:18:23,528 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fcd096636/9ef0e35bc2b64de68a8af00d96bc2477/FLAGbb7997b1c [2022-01-10 14:18:23,942 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fcd096636/9ef0e35bc2b64de68a8af00d96bc2477 [2022-01-10 14:18:23,944 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 14:18:23,945 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-01-10 14:18:23,948 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 14:18:23,948 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 14:18:23,953 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 14:18:23,954 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 02:18:23" (1/1) ... [2022-01-10 14:18:23,954 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18a43ef3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:18:23, skipping insertion in model container [2022-01-10 14:18:23,954 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 02:18:23" (1/1) ... [2022-01-10 14:18:23,959 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 14:18:24,019 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 14:18:24,135 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/bitvector/soft_float_1-2a.c.cil.c[755,768] [2022-01-10 14:18:24,197 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 14:18:24,208 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 14:18:24,216 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/bitvector/soft_float_1-2a.c.cil.c[755,768] [2022-01-10 14:18:24,240 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 14:18:24,271 INFO L208 MainTranslator]: Completed translation [2022-01-10 14:18:24,272 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:18:24 WrapperNode [2022-01-10 14:18:24,272 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 14:18:24,273 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 14:18:24,273 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 14:18:24,273 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 14:18:24,282 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:18:24" (1/1) ... [2022-01-10 14:18:24,289 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:18:24" (1/1) ... [2022-01-10 14:18:24,323 INFO L137 Inliner]: procedures = 17, calls = 18, calls flagged for inlining = 13, calls inlined = 11, statements flattened = 296 [2022-01-10 14:18:24,324 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 14:18:24,324 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 14:18:24,324 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 14:18:24,325 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 14:18:24,330 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:18:24" (1/1) ... [2022-01-10 14:18:24,330 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:18:24" (1/1) ... [2022-01-10 14:18:24,333 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:18:24" (1/1) ... [2022-01-10 14:18:24,333 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:18:24" (1/1) ... [2022-01-10 14:18:24,338 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:18:24" (1/1) ... [2022-01-10 14:18:24,341 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:18:24" (1/1) ... [2022-01-10 14:18:24,343 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:18:24" (1/1) ... [2022-01-10 14:18:24,359 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 14:18:24,360 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 14:18:24,360 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 14:18:24,360 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 14:18:24,365 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:18:24" (1/1) ... [2022-01-10 14:18:24,370 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 14:18:24,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 14:18:24,389 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 14:18:24,396 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 14:18:24,427 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 14:18:24,427 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-10 14:18:24,427 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 14:18:24,427 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 14:18:24,472 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 14:18:24,473 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 14:18:24,680 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 14:18:24,685 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 14:18:24,685 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2022-01-10 14:18:24,686 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 02:18:24 BoogieIcfgContainer [2022-01-10 14:18:24,686 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 14:18:24,687 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-10 14:18:24,687 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-10 14:18:24,687 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-10 14:18:24,689 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 02:18:24" (1/1) ... [2022-01-10 14:18:24,785 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 02:18:24 BasicIcfg [2022-01-10 14:18:24,785 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-10 14:18:24,786 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 14:18:24,786 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 14:18:24,788 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 14:18:24,788 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 02:18:23" (1/4) ... [2022-01-10 14:18:24,789 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31b9629a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 02:18:24, skipping insertion in model container [2022-01-10 14:18:24,789 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:18:24" (2/4) ... [2022-01-10 14:18:24,789 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31b9629a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 02:18:24, skipping insertion in model container [2022-01-10 14:18:24,789 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 02:18:24" (3/4) ... [2022-01-10 14:18:24,789 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31b9629a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 02:18:24, skipping insertion in model container [2022-01-10 14:18:24,789 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 02:18:24" (4/4) ... [2022-01-10 14:18:24,790 INFO L111 eAbstractionObserver]: Analyzing ICFG soft_float_1-2a.c.cil.cTransformedIcfg [2022-01-10 14:18:24,793 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 14:18:24,793 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations. [2022-01-10 14:18:24,829 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 14:18:24,834 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 14:18:24,835 INFO L340 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-01-10 14:18:24,845 INFO L276 IsEmpty]: Start isEmpty. Operand has 97 states, 91 states have (on average 1.7032967032967032) internal successors, (155), 96 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:18:24,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-01-10 14:18:24,850 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:18:24,850 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 14:18:24,850 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-01-10 14:18:24,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:18:24,854 INFO L85 PathProgramCache]: Analyzing trace with hash -1427315857, now seen corresponding path program 1 times [2022-01-10 14:18:24,859 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:18:24,859 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875201592] [2022-01-10 14:18:24,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:18:24,860 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:18:25,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:18:25,146 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 14:18:25,147 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:18:25,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875201592] [2022-01-10 14:18:25,147 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875201592] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:18:25,147 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:18:25,148 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-10 14:18:25,149 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719267838] [2022-01-10 14:18:25,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:18:25,152 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 14:18:25,152 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:18:25,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 14:18:25,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-10 14:18:25,178 INFO L87 Difference]: Start difference. First operand has 97 states, 91 states have (on average 1.7032967032967032) internal successors, (155), 96 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:18:25,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:18:25,487 INFO L93 Difference]: Finished difference Result 520 states and 782 transitions. [2022-01-10 14:18:25,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-10 14:18:25,489 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-01-10 14:18:25,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:18:25,497 INFO L225 Difference]: With dead ends: 520 [2022-01-10 14:18:25,497 INFO L226 Difference]: Without dead ends: 403 [2022-01-10 14:18:25,499 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2022-01-10 14:18:25,501 INFO L933 BasicCegarLoop]: 116 mSDtfsCounter, 881 mSDsluCounter, 519 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 881 SdHoareTripleChecker+Valid, 635 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 14:18:25,502 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [881 Valid, 635 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-10 14:18:25,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2022-01-10 14:18:25,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 120. [2022-01-10 14:18:25,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 115 states have (on average 1.4956521739130435) internal successors, (172), 119 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:18:25,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 172 transitions. [2022-01-10 14:18:25,534 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 172 transitions. Word has length 18 [2022-01-10 14:18:25,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:18:25,534 INFO L470 AbstractCegarLoop]: Abstraction has 120 states and 172 transitions. [2022-01-10 14:18:25,535 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:18:25,535 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 172 transitions. [2022-01-10 14:18:25,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-01-10 14:18:25,535 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:18:25,535 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] [2022-01-10 14:18:25,536 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-10 14:18:25,536 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-01-10 14:18:25,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:18:25,536 INFO L85 PathProgramCache]: Analyzing trace with hash 1500121364, now seen corresponding path program 1 times [2022-01-10 14:18:25,536 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:18:25,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384509949] [2022-01-10 14:18:25,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:18:25,537 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:18:25,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:18:25,604 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 14:18:25,604 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:18:25,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384509949] [2022-01-10 14:18:25,604 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384509949] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:18:25,605 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:18:25,605 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-10 14:18:25,605 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368741384] [2022-01-10 14:18:25,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:18:25,606 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 14:18:25,606 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:18:25,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 14:18:25,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-01-10 14:18:25,608 INFO L87 Difference]: Start difference. First operand 120 states and 172 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:18:25,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:18:25,735 INFO L93 Difference]: Finished difference Result 394 states and 543 transitions. [2022-01-10 14:18:25,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-10 14:18:25,736 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-01-10 14:18:25,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:18:25,737 INFO L225 Difference]: With dead ends: 394 [2022-01-10 14:18:25,737 INFO L226 Difference]: Without dead ends: 337 [2022-01-10 14:18:25,738 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-01-10 14:18:25,738 INFO L933 BasicCegarLoop]: 110 mSDtfsCounter, 684 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 684 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 14:18:25,739 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [684 Valid, 438 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 14:18:25,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2022-01-10 14:18:25,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 150. [2022-01-10 14:18:25,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 145 states have (on average 1.4827586206896552) internal successors, (215), 149 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:18:25,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 215 transitions. [2022-01-10 14:18:25,750 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 215 transitions. Word has length 22 [2022-01-10 14:18:25,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:18:25,750 INFO L470 AbstractCegarLoop]: Abstraction has 150 states and 215 transitions. [2022-01-10 14:18:25,750 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:18:25,750 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 215 transitions. [2022-01-10 14:18:25,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-01-10 14:18:25,751 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:18:25,751 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] [2022-01-10 14:18:25,751 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-10 14:18:25,751 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-01-10 14:18:25,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:18:25,752 INFO L85 PathProgramCache]: Analyzing trace with hash 1303607859, now seen corresponding path program 1 times [2022-01-10 14:18:25,752 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:18:25,752 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039849463] [2022-01-10 14:18:25,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:18:25,752 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:18:25,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:18:25,801 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 14:18:25,801 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:18:25,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039849463] [2022-01-10 14:18:25,801 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039849463] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:18:25,801 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:18:25,801 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-10 14:18:25,802 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734862120] [2022-01-10 14:18:25,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:18:25,802 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 14:18:25,802 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:18:25,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 14:18:25,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-10 14:18:25,803 INFO L87 Difference]: Start difference. First operand 150 states and 215 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:18:25,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:18:25,897 INFO L93 Difference]: Finished difference Result 275 states and 380 transitions. [2022-01-10 14:18:25,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-10 14:18:25,898 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-01-10 14:18:25,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:18:25,898 INFO L225 Difference]: With dead ends: 275 [2022-01-10 14:18:25,899 INFO L226 Difference]: Without dead ends: 223 [2022-01-10 14:18:25,899 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-01-10 14:18:25,900 INFO L933 BasicCegarLoop]: 111 mSDtfsCounter, 350 mSDsluCounter, 393 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 350 SdHoareTripleChecker+Valid, 504 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 14:18:25,900 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [350 Valid, 504 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 14:18:25,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2022-01-10 14:18:25,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 208. [2022-01-10 14:18:25,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 203 states have (on average 1.4532019704433496) internal successors, (295), 207 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:18:25,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 295 transitions. [2022-01-10 14:18:25,910 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 295 transitions. Word has length 22 [2022-01-10 14:18:25,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:18:25,910 INFO L470 AbstractCegarLoop]: Abstraction has 208 states and 295 transitions. [2022-01-10 14:18:25,910 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:18:25,911 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 295 transitions. [2022-01-10 14:18:25,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-01-10 14:18:25,911 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:18:25,911 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] [2022-01-10 14:18:25,911 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-10 14:18:25,912 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-01-10 14:18:25,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:18:25,912 INFO L85 PathProgramCache]: Analyzing trace with hash 1303637650, now seen corresponding path program 1 times [2022-01-10 14:18:25,912 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:18:25,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940575759] [2022-01-10 14:18:25,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:18:25,912 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:18:25,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:18:25,966 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 14:18:25,966 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:18:25,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940575759] [2022-01-10 14:18:25,966 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940575759] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:18:25,966 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:18:25,966 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-10 14:18:25,967 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920171545] [2022-01-10 14:18:25,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:18:25,967 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 14:18:25,967 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:18:25,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 14:18:25,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-10 14:18:25,968 INFO L87 Difference]: Start difference. First operand 208 states and 295 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:18:26,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:18:26,070 INFO L93 Difference]: Finished difference Result 291 states and 397 transitions. [2022-01-10 14:18:26,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-10 14:18:26,070 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-01-10 14:18:26,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:18:26,071 INFO L225 Difference]: With dead ends: 291 [2022-01-10 14:18:26,071 INFO L226 Difference]: Without dead ends: 243 [2022-01-10 14:18:26,072 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-01-10 14:18:26,072 INFO L933 BasicCegarLoop]: 113 mSDtfsCounter, 258 mSDsluCounter, 465 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 578 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 14:18:26,073 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [258 Valid, 578 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 14:18:26,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2022-01-10 14:18:26,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 198. [2022-01-10 14:18:26,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 193 states have (on average 1.4455958549222798) internal successors, (279), 197 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:18:26,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 279 transitions. [2022-01-10 14:18:26,081 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 279 transitions. Word has length 22 [2022-01-10 14:18:26,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:18:26,081 INFO L470 AbstractCegarLoop]: Abstraction has 198 states and 279 transitions. [2022-01-10 14:18:26,081 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:18:26,081 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 279 transitions. [2022-01-10 14:18:26,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-01-10 14:18:26,082 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:18:26,082 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] [2022-01-10 14:18:26,082 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-10 14:18:26,082 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-01-10 14:18:26,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:18:26,083 INFO L85 PathProgramCache]: Analyzing trace with hash -1553770753, now seen corresponding path program 1 times [2022-01-10 14:18:26,083 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:18:26,083 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793258081] [2022-01-10 14:18:26,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:18:26,083 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:18:26,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:18:26,137 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 14:18:26,138 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:18:26,138 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793258081] [2022-01-10 14:18:26,138 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793258081] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:18:26,138 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:18:26,138 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-10 14:18:26,138 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340673338] [2022-01-10 14:18:26,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:18:26,138 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-10 14:18:26,139 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:18:26,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-10 14:18:26,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-01-10 14:18:26,139 INFO L87 Difference]: Start difference. First operand 198 states and 279 transitions. Second operand has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:18:26,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:18:26,303 INFO L93 Difference]: Finished difference Result 418 states and 562 transitions. [2022-01-10 14:18:26,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-10 14:18:26,304 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-01-10 14:18:26,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:18:26,305 INFO L225 Difference]: With dead ends: 418 [2022-01-10 14:18:26,305 INFO L226 Difference]: Without dead ends: 366 [2022-01-10 14:18:26,306 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2022-01-10 14:18:26,306 INFO L933 BasicCegarLoop]: 159 mSDtfsCounter, 690 mSDsluCounter, 649 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 690 SdHoareTripleChecker+Valid, 808 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 14:18:26,306 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [690 Valid, 808 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 14:18:26,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2022-01-10 14:18:26,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 209. [2022-01-10 14:18:26,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 204 states have (on average 1.4264705882352942) internal successors, (291), 208 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:18:26,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 291 transitions. [2022-01-10 14:18:26,315 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 291 transitions. Word has length 26 [2022-01-10 14:18:26,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:18:26,315 INFO L470 AbstractCegarLoop]: Abstraction has 209 states and 291 transitions. [2022-01-10 14:18:26,315 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:18:26,316 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 291 transitions. [2022-01-10 14:18:26,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-01-10 14:18:26,316 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:18:26,316 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] [2022-01-10 14:18:26,316 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-10 14:18:26,317 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-01-10 14:18:26,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:18:26,317 INFO L85 PathProgramCache]: Analyzing trace with hash 1853692862, now seen corresponding path program 1 times [2022-01-10 14:18:26,317 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:18:26,317 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745167869] [2022-01-10 14:18:26,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:18:26,317 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:18:26,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:18:26,384 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 14:18:26,384 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:18:26,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745167869] [2022-01-10 14:18:26,384 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745167869] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:18:26,384 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:18:26,384 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-10 14:18:26,385 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675359161] [2022-01-10 14:18:26,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:18:26,385 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 14:18:26,385 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:18:26,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 14:18:26,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-10 14:18:26,385 INFO L87 Difference]: Start difference. First operand 209 states and 291 transitions. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:18:26,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:18:26,561 INFO L93 Difference]: Finished difference Result 442 states and 597 transitions. [2022-01-10 14:18:26,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-10 14:18:26,562 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-01-10 14:18:26,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:18:26,563 INFO L225 Difference]: With dead ends: 442 [2022-01-10 14:18:26,563 INFO L226 Difference]: Without dead ends: 378 [2022-01-10 14:18:26,563 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2022-01-10 14:18:26,564 INFO L933 BasicCegarLoop]: 114 mSDtfsCounter, 602 mSDsluCounter, 667 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 602 SdHoareTripleChecker+Valid, 781 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 14:18:26,564 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [602 Valid, 781 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 14:18:26,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2022-01-10 14:18:26,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 268. [2022-01-10 14:18:26,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 263 states have (on average 1.403041825095057) internal successors, (369), 267 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:18:26,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 369 transitions. [2022-01-10 14:18:26,575 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 369 transitions. Word has length 26 [2022-01-10 14:18:26,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:18:26,575 INFO L470 AbstractCegarLoop]: Abstraction has 268 states and 369 transitions. [2022-01-10 14:18:26,575 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:18:26,575 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 369 transitions. [2022-01-10 14:18:26,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-01-10 14:18:26,576 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:18:26,576 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] [2022-01-10 14:18:26,576 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-10 14:18:26,576 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-01-10 14:18:26,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:18:26,576 INFO L85 PathProgramCache]: Analyzing trace with hash -787645188, now seen corresponding path program 1 times [2022-01-10 14:18:26,577 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:18:26,577 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224527258] [2022-01-10 14:18:26,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:18:26,577 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:18:26,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:18:26,611 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 14:18:26,612 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:18:26,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224527258] [2022-01-10 14:18:26,612 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224527258] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:18:26,612 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:18:26,612 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-10 14:18:26,612 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625821832] [2022-01-10 14:18:26,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:18:26,612 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 14:18:26,613 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:18:26,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 14:18:26,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-10 14:18:26,613 INFO L87 Difference]: Start difference. First operand 268 states and 369 transitions. Second operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:18:26,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:18:26,787 INFO L93 Difference]: Finished difference Result 511 states and 693 transitions. [2022-01-10 14:18:26,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-10 14:18:26,788 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-01-10 14:18:26,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:18:26,789 INFO L225 Difference]: With dead ends: 511 [2022-01-10 14:18:26,789 INFO L226 Difference]: Without dead ends: 440 [2022-01-10 14:18:26,789 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2022-01-10 14:18:26,790 INFO L933 BasicCegarLoop]: 130 mSDtfsCounter, 293 mSDsluCounter, 647 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 777 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 14:18:26,790 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [293 Valid, 777 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 14:18:26,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2022-01-10 14:18:26,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 314. [2022-01-10 14:18:26,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 314 states, 309 states have (on average 1.3948220064724919) internal successors, (431), 313 states have internal predecessors, (431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:18:26,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 431 transitions. [2022-01-10 14:18:26,805 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 431 transitions. Word has length 30 [2022-01-10 14:18:26,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:18:26,805 INFO L470 AbstractCegarLoop]: Abstraction has 314 states and 431 transitions. [2022-01-10 14:18:26,805 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:18:26,805 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 431 transitions. [2022-01-10 14:18:26,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-01-10 14:18:26,806 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:18:26,806 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] [2022-01-10 14:18:26,806 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-10 14:18:26,806 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-01-10 14:18:26,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:18:26,807 INFO L85 PathProgramCache]: Analyzing trace with hash -786721667, now seen corresponding path program 1 times [2022-01-10 14:18:26,807 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:18:26,807 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111016693] [2022-01-10 14:18:26,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:18:26,807 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:18:26,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:18:26,837 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 14:18:26,838 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:18:26,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111016693] [2022-01-10 14:18:26,847 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111016693] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:18:26,847 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:18:26,847 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 14:18:26,847 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379623777] [2022-01-10 14:18:26,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:18:26,847 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 14:18:26,848 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:18:26,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 14:18:26,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 14:18:26,848 INFO L87 Difference]: Start difference. First operand 314 states and 431 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:18:26,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:18:26,965 INFO L93 Difference]: Finished difference Result 405 states and 557 transitions. [2022-01-10 14:18:26,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-10 14:18:26,965 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-01-10 14:18:26,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:18:26,966 INFO L225 Difference]: With dead ends: 405 [2022-01-10 14:18:26,966 INFO L226 Difference]: Without dead ends: 403 [2022-01-10 14:18:26,966 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 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 14:18:26,967 INFO L933 BasicCegarLoop]: 172 mSDtfsCounter, 123 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 580 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 14:18:26,967 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [123 Valid, 580 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 14:18:26,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2022-01-10 14:18:26,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 318. [2022-01-10 14:18:26,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 313 states have (on average 1.3833865814696487) internal successors, (433), 317 states have internal predecessors, (433), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:18:26,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 433 transitions. [2022-01-10 14:18:26,981 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 433 transitions. Word has length 30 [2022-01-10 14:18:26,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:18:26,982 INFO L470 AbstractCegarLoop]: Abstraction has 318 states and 433 transitions. [2022-01-10 14:18:26,982 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:18:26,982 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 433 transitions. [2022-01-10 14:18:26,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-01-10 14:18:26,982 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:18:26,982 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] [2022-01-10 14:18:26,982 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-10 14:18:26,983 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-01-10 14:18:26,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:18:26,983 INFO L85 PathProgramCache]: Analyzing trace with hash -1480190041, now seen corresponding path program 1 times [2022-01-10 14:18:26,983 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:18:26,983 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969349927] [2022-01-10 14:18:26,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:18:26,983 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:18:27,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:18:27,160 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 14:18:27,160 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:18:27,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969349927] [2022-01-10 14:18:27,160 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969349927] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:18:27,160 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:18:27,160 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-10 14:18:27,160 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235645647] [2022-01-10 14:18:27,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:18:27,161 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-10 14:18:27,161 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:18:27,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-10 14:18:27,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-01-10 14:18:27,161 INFO L87 Difference]: Start difference. First operand 318 states and 433 transitions. Second operand has 10 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:18:27,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:18:27,618 INFO L93 Difference]: Finished difference Result 840 states and 1151 transitions. [2022-01-10 14:18:27,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-10 14:18:27,619 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-01-10 14:18:27,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:18:27,621 INFO L225 Difference]: With dead ends: 840 [2022-01-10 14:18:27,621 INFO L226 Difference]: Without dead ends: 719 [2022-01-10 14:18:27,621 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=122, Invalid=258, Unknown=0, NotChecked=0, Total=380 [2022-01-10 14:18:27,623 INFO L933 BasicCegarLoop]: 260 mSDtfsCounter, 794 mSDsluCounter, 1132 mSDsCounter, 0 mSdLazyCounter, 378 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 794 SdHoareTripleChecker+Valid, 1392 SdHoareTripleChecker+Invalid, 397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-10 14:18:27,623 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [794 Valid, 1392 Invalid, 397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 378 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-10 14:18:27,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 719 states. [2022-01-10 14:18:27,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 719 to 453. [2022-01-10 14:18:27,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 448 states have (on average 1.3794642857142858) internal successors, (618), 452 states have internal predecessors, (618), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:18:27,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 618 transitions. [2022-01-10 14:18:27,685 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 618 transitions. Word has length 30 [2022-01-10 14:18:27,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:18:27,687 INFO L470 AbstractCegarLoop]: Abstraction has 453 states and 618 transitions. [2022-01-10 14:18:27,687 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:18:27,687 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 618 transitions. [2022-01-10 14:18:27,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-01-10 14:18:27,689 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:18:27,689 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] [2022-01-10 14:18:27,689 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-10 14:18:27,689 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-01-10 14:18:27,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:18:27,689 INFO L85 PathProgramCache]: Analyzing trace with hash -1480160250, now seen corresponding path program 1 times [2022-01-10 14:18:27,690 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:18:27,690 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908109211] [2022-01-10 14:18:27,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:18:27,690 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:18:27,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:18:27,831 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 14:18:27,831 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:18:27,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908109211] [2022-01-10 14:18:27,831 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908109211] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:18:27,831 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:18:27,832 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-01-10 14:18:27,832 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109073881] [2022-01-10 14:18:27,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:18:27,832 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-01-10 14:18:27,832 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:18:27,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-01-10 14:18:27,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-01-10 14:18:27,832 INFO L87 Difference]: Start difference. First operand 453 states and 618 transitions. Second operand has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:18:28,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:18:28,287 INFO L93 Difference]: Finished difference Result 648 states and 869 transitions. [2022-01-10 14:18:28,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-01-10 14:18:28,287 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-01-10 14:18:28,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:18:28,289 INFO L225 Difference]: With dead ends: 648 [2022-01-10 14:18:28,289 INFO L226 Difference]: Without dead ends: 590 [2022-01-10 14:18:28,289 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=145, Invalid=317, Unknown=0, NotChecked=0, Total=462 [2022-01-10 14:18:28,290 INFO L933 BasicCegarLoop]: 207 mSDtfsCounter, 715 mSDsluCounter, 842 mSDsCounter, 0 mSdLazyCounter, 372 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 715 SdHoareTripleChecker+Valid, 1049 SdHoareTripleChecker+Invalid, 397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-10 14:18:28,290 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [715 Valid, 1049 Invalid, 397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 372 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-10 14:18:28,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2022-01-10 14:18:28,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 445. [2022-01-10 14:18:28,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 445 states, 440 states have (on average 1.375) internal successors, (605), 444 states have internal predecessors, (605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:18:28,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 605 transitions. [2022-01-10 14:18:28,314 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 605 transitions. Word has length 30 [2022-01-10 14:18:28,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:18:28,314 INFO L470 AbstractCegarLoop]: Abstraction has 445 states and 605 transitions. [2022-01-10 14:18:28,314 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:18:28,314 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 605 transitions. [2022-01-10 14:18:28,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-01-10 14:18:28,315 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:18:28,315 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] [2022-01-10 14:18:28,315 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-10 14:18:28,315 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-01-10 14:18:28,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:18:28,316 INFO L85 PathProgramCache]: Analyzing trace with hash -1676703546, now seen corresponding path program 1 times [2022-01-10 14:18:28,316 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:18:28,316 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991891224] [2022-01-10 14:18:28,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:18:28,316 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:18:28,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:18:28,368 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 14:18:28,368 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:18:28,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991891224] [2022-01-10 14:18:28,368 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991891224] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:18:28,368 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:18:28,369 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-10 14:18:28,369 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424686413] [2022-01-10 14:18:28,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:18:28,369 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-10 14:18:28,369 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:18:28,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-10 14:18:28,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-01-10 14:18:28,370 INFO L87 Difference]: Start difference. First operand 445 states and 605 transitions. Second operand has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:18:28,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:18:28,738 INFO L93 Difference]: Finished difference Result 1364 states and 1831 transitions. [2022-01-10 14:18:28,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-01-10 14:18:28,739 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-01-10 14:18:28,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:18:28,742 INFO L225 Difference]: With dead ends: 1364 [2022-01-10 14:18:28,742 INFO L226 Difference]: Without dead ends: 1147 [2022-01-10 14:18:28,743 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=199, Invalid=613, Unknown=0, NotChecked=0, Total=812 [2022-01-10 14:18:28,743 INFO L933 BasicCegarLoop]: 112 mSDtfsCounter, 1450 mSDsluCounter, 752 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1450 SdHoareTripleChecker+Valid, 864 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 14:18:28,743 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1450 Valid, 864 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 14:18:28,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1147 states. [2022-01-10 14:18:28,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1147 to 438. [2022-01-10 14:18:28,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 438 states, 433 states have (on average 1.3810623556581987) internal successors, (598), 437 states have internal predecessors, (598), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:18:28,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 598 transitions. [2022-01-10 14:18:28,771 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 598 transitions. Word has length 30 [2022-01-10 14:18:28,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:18:28,771 INFO L470 AbstractCegarLoop]: Abstraction has 438 states and 598 transitions. [2022-01-10 14:18:28,771 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:18:28,771 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 598 transitions. [2022-01-10 14:18:28,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-01-10 14:18:28,772 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:18:28,772 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] [2022-01-10 14:18:28,772 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-10 14:18:28,772 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-01-10 14:18:28,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:18:28,773 INFO L85 PathProgramCache]: Analyzing trace with hash -2113924268, now seen corresponding path program 1 times [2022-01-10 14:18:28,773 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:18:28,773 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806458706] [2022-01-10 14:18:28,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:18:28,773 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:18:28,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:18:28,806 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 14:18:28,807 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:18:28,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806458706] [2022-01-10 14:18:28,807 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806458706] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:18:28,807 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:18:28,807 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 14:18:28,807 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205671929] [2022-01-10 14:18:28,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:18:28,807 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 14:18:28,807 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:18:28,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 14:18:28,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 14:18:28,808 INFO L87 Difference]: Start difference. First operand 438 states and 598 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:18:28,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:18:28,972 INFO L93 Difference]: Finished difference Result 1085 states and 1487 transitions. [2022-01-10 14:18:28,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-10 14:18:28,973 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-01-10 14:18:28,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:18:28,975 INFO L225 Difference]: With dead ends: 1085 [2022-01-10 14:18:28,975 INFO L226 Difference]: Without dead ends: 969 [2022-01-10 14:18:28,976 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 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 14:18:28,976 INFO L933 BasicCegarLoop]: 194 mSDtfsCounter, 362 mSDsluCounter, 473 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 362 SdHoareTripleChecker+Valid, 667 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 14:18:28,976 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [362 Valid, 667 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 14:18:28,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 969 states. [2022-01-10 14:18:29,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 969 to 447. [2022-01-10 14:18:29,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 447 states, 442 states have (on average 1.3778280542986425) internal successors, (609), 446 states have internal predecessors, (609), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:18:29,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 609 transitions. [2022-01-10 14:18:29,013 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 609 transitions. Word has length 30 [2022-01-10 14:18:29,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:18:29,013 INFO L470 AbstractCegarLoop]: Abstraction has 447 states and 609 transitions. [2022-01-10 14:18:29,013 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:18:29,013 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 609 transitions. [2022-01-10 14:18:29,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-01-10 14:18:29,013 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:18:29,013 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] [2022-01-10 14:18:29,014 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-10 14:18:29,014 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-01-10 14:18:29,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:18:29,014 INFO L85 PathProgramCache]: Analyzing trace with hash -2113894477, now seen corresponding path program 1 times [2022-01-10 14:18:29,014 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:18:29,014 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413522511] [2022-01-10 14:18:29,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:18:29,014 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:18:29,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:18:29,057 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 14:18:29,058 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:18:29,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413522511] [2022-01-10 14:18:29,058 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413522511] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:18:29,058 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:18:29,058 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-10 14:18:29,058 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797491496] [2022-01-10 14:18:29,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:18:29,058 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 14:18:29,058 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:18:29,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 14:18:29,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-10 14:18:29,059 INFO L87 Difference]: Start difference. First operand 447 states and 609 transitions. Second operand has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:18:29,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:18:29,276 INFO L93 Difference]: Finished difference Result 1076 states and 1448 transitions. [2022-01-10 14:18:29,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-01-10 14:18:29,276 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-01-10 14:18:29,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:18:29,279 INFO L225 Difference]: With dead ends: 1076 [2022-01-10 14:18:29,279 INFO L226 Difference]: Without dead ends: 973 [2022-01-10 14:18:29,279 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2022-01-10 14:18:29,280 INFO L933 BasicCegarLoop]: 109 mSDtfsCounter, 737 mSDsluCounter, 617 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 737 SdHoareTripleChecker+Valid, 726 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 14:18:29,280 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [737 Valid, 726 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 14:18:29,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 973 states. [2022-01-10 14:18:29,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 973 to 452. [2022-01-10 14:18:29,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 452 states, 447 states have (on average 1.378076062639821) internal successors, (616), 451 states have internal predecessors, (616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:18:29,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 616 transitions. [2022-01-10 14:18:29,308 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 616 transitions. Word has length 30 [2022-01-10 14:18:29,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:18:29,308 INFO L470 AbstractCegarLoop]: Abstraction has 452 states and 616 transitions. [2022-01-10 14:18:29,308 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:18:29,308 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 616 transitions. [2022-01-10 14:18:29,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-01-10 14:18:29,309 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:18:29,309 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] [2022-01-10 14:18:29,309 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-10 14:18:29,309 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-01-10 14:18:29,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:18:29,309 INFO L85 PathProgramCache]: Analyzing trace with hash 1293539347, now seen corresponding path program 1 times [2022-01-10 14:18:29,310 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:18:29,310 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677440151] [2022-01-10 14:18:29,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:18:29,310 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:18:29,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:18:29,406 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 14:18:29,406 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:18:29,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677440151] [2022-01-10 14:18:29,406 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677440151] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:18:29,406 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:18:29,406 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-10 14:18:29,406 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497629138] [2022-01-10 14:18:29,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:18:29,407 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-10 14:18:29,407 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:18:29,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-10 14:18:29,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-01-10 14:18:29,407 INFO L87 Difference]: Start difference. First operand 452 states and 616 transitions. Second operand has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:18:29,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:18:29,607 INFO L93 Difference]: Finished difference Result 649 states and 892 transitions. [2022-01-10 14:18:29,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-10 14:18:29,607 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-01-10 14:18:29,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:18:29,609 INFO L225 Difference]: With dead ends: 649 [2022-01-10 14:18:29,609 INFO L226 Difference]: Without dead ends: 647 [2022-01-10 14:18:29,610 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2022-01-10 14:18:29,610 INFO L933 BasicCegarLoop]: 174 mSDtfsCounter, 498 mSDsluCounter, 417 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 498 SdHoareTripleChecker+Valid, 591 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 14:18:29,610 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [498 Valid, 591 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 14:18:29,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 647 states. [2022-01-10 14:18:29,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 647 to 451. [2022-01-10 14:18:29,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 451 states, 446 states have (on average 1.3744394618834082) internal successors, (613), 450 states have internal predecessors, (613), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:18:29,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 451 states and 613 transitions. [2022-01-10 14:18:29,637 INFO L78 Accepts]: Start accepts. Automaton has 451 states and 613 transitions. Word has length 30 [2022-01-10 14:18:29,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:18:29,637 INFO L470 AbstractCegarLoop]: Abstraction has 451 states and 613 transitions. [2022-01-10 14:18:29,638 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:18:29,638 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 613 transitions. [2022-01-10 14:18:29,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-01-10 14:18:29,638 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:18:29,638 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] [2022-01-10 14:18:29,638 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-10 14:18:29,638 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-01-10 14:18:29,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:18:29,639 INFO L85 PathProgramCache]: Analyzing trace with hash 1293569138, now seen corresponding path program 1 times [2022-01-10 14:18:29,639 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:18:29,639 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040865894] [2022-01-10 14:18:29,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:18:29,639 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:18:29,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:18:29,721 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 14:18:29,721 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:18:29,721 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040865894] [2022-01-10 14:18:29,722 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040865894] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:18:29,722 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:18:29,722 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 14:18:29,722 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091782139] [2022-01-10 14:18:29,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:18:29,722 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 14:18:29,722 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:18:29,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 14:18:29,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-01-10 14:18:29,722 INFO L87 Difference]: Start difference. First operand 451 states and 613 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:18:29,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:18:29,784 INFO L93 Difference]: Finished difference Result 521 states and 715 transitions. [2022-01-10 14:18:29,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 14:18:29,784 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-01-10 14:18:29,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:18:29,785 INFO L225 Difference]: With dead ends: 521 [2022-01-10 14:18:29,785 INFO L226 Difference]: Without dead ends: 519 [2022-01-10 14:18:29,786 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-01-10 14:18:29,786 INFO L933 BasicCegarLoop]: 153 mSDtfsCounter, 110 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 14:18:29,786 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [110 Valid, 375 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 14:18:29,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2022-01-10 14:18:29,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 449. [2022-01-10 14:18:29,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 449 states, 445 states have (on average 1.3730337078651684) internal successors, (611), 448 states have internal predecessors, (611), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:18:29,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 611 transitions. [2022-01-10 14:18:29,813 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 611 transitions. Word has length 30 [2022-01-10 14:18:29,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:18:29,813 INFO L470 AbstractCegarLoop]: Abstraction has 449 states and 611 transitions. [2022-01-10 14:18:29,813 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:18:29,813 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 611 transitions. [2022-01-10 14:18:29,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-01-10 14:18:29,814 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:18:29,814 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] [2022-01-10 14:18:29,814 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-01-10 14:18:29,814 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-01-10 14:18:29,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:18:29,814 INFO L85 PathProgramCache]: Analyzing trace with hash 657941955, now seen corresponding path program 1 times [2022-01-10 14:18:29,814 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:18:29,814 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264042838] [2022-01-10 14:18:29,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:18:29,815 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:18:29,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:18:29,837 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 14:18:29,838 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:18:29,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264042838] [2022-01-10 14:18:29,838 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264042838] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:18:29,838 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:18:29,838 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 14:18:29,838 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228857601] [2022-01-10 14:18:29,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:18:29,838 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 14:18:29,838 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:18:29,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 14:18:29,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 14:18:29,839 INFO L87 Difference]: Start difference. First operand 449 states and 611 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:18:29,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:18:29,913 INFO L93 Difference]: Finished difference Result 524 states and 717 transitions. [2022-01-10 14:18:29,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 14:18:29,914 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-01-10 14:18:29,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:18:29,915 INFO L225 Difference]: With dead ends: 524 [2022-01-10 14:18:29,915 INFO L226 Difference]: Without dead ends: 519 [2022-01-10 14:18:29,915 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 14:18:29,916 INFO L933 BasicCegarLoop]: 157 mSDtfsCounter, 46 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 14:18:29,916 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [46 Valid, 406 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 14:18:29,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2022-01-10 14:18:29,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 449. [2022-01-10 14:18:29,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 449 states, 445 states have (on average 1.3640449438202247) internal successors, (607), 448 states have internal predecessors, (607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:18:29,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 607 transitions. [2022-01-10 14:18:29,943 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 607 transitions. Word has length 31 [2022-01-10 14:18:29,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:18:29,943 INFO L470 AbstractCegarLoop]: Abstraction has 449 states and 607 transitions. [2022-01-10 14:18:29,943 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:18:29,943 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 607 transitions. [2022-01-10 14:18:29,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-01-10 14:18:29,944 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:18:29,944 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] [2022-01-10 14:18:29,944 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-01-10 14:18:29,944 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-01-10 14:18:29,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:18:29,944 INFO L85 PathProgramCache]: Analyzing trace with hash -1724583695, now seen corresponding path program 1 times [2022-01-10 14:18:29,945 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:18:29,945 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139113678] [2022-01-10 14:18:29,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:18:29,945 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:18:29,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:18:29,982 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 14:18:29,982 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:18:29,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139113678] [2022-01-10 14:18:29,982 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139113678] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:18:29,982 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:18:29,982 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-10 14:18:29,982 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185996160] [2022-01-10 14:18:29,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:18:29,983 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 14:18:29,983 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:18:29,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 14:18:29,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-10 14:18:29,983 INFO L87 Difference]: Start difference. First operand 449 states and 607 transitions. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:18:30,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:18:30,141 INFO L93 Difference]: Finished difference Result 635 states and 851 transitions. [2022-01-10 14:18:30,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-10 14:18:30,141 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-01-10 14:18:30,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:18:30,142 INFO L225 Difference]: With dead ends: 635 [2022-01-10 14:18:30,143 INFO L226 Difference]: Without dead ends: 575 [2022-01-10 14:18:30,143 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2022-01-10 14:18:30,143 INFO L933 BasicCegarLoop]: 104 mSDtfsCounter, 258 mSDsluCounter, 401 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 505 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 14:18:30,144 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [258 Valid, 505 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 14:18:30,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2022-01-10 14:18:30,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 386. [2022-01-10 14:18:30,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 382 states have (on average 1.3664921465968587) internal successors, (522), 385 states have internal predecessors, (522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:18:30,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 522 transitions. [2022-01-10 14:18:30,169 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 522 transitions. Word has length 32 [2022-01-10 14:18:30,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:18:30,170 INFO L470 AbstractCegarLoop]: Abstraction has 386 states and 522 transitions. [2022-01-10 14:18:30,170 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:18:30,170 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 522 transitions. [2022-01-10 14:18:30,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-01-10 14:18:30,172 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:18:30,172 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] [2022-01-10 14:18:30,172 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-01-10 14:18:30,172 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-01-10 14:18:30,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:18:30,172 INFO L85 PathProgramCache]: Analyzing trace with hash -1675837912, now seen corresponding path program 1 times [2022-01-10 14:18:30,172 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:18:30,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479568473] [2022-01-10 14:18:30,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:18:30,173 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:18:30,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:18:30,216 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 14:18:30,216 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:18:30,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479568473] [2022-01-10 14:18:30,217 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479568473] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:18:30,217 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:18:30,217 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 14:18:30,217 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555650789] [2022-01-10 14:18:30,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:18:30,217 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 14:18:30,217 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:18:30,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 14:18:30,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 14:18:30,217 INFO L87 Difference]: Start difference. First operand 386 states and 522 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:18:30,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:18:30,321 INFO L93 Difference]: Finished difference Result 468 states and 625 transitions. [2022-01-10 14:18:30,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-10 14:18:30,322 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-01-10 14:18:30,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:18:30,323 INFO L225 Difference]: With dead ends: 468 [2022-01-10 14:18:30,323 INFO L226 Difference]: Without dead ends: 466 [2022-01-10 14:18:30,323 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 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 14:18:30,324 INFO L933 BasicCegarLoop]: 178 mSDtfsCounter, 106 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 568 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 14:18:30,324 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [106 Valid, 568 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 14:18:30,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2022-01-10 14:18:30,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 386. [2022-01-10 14:18:30,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 382 states have (on average 1.361256544502618) internal successors, (520), 385 states have internal predecessors, (520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:18:30,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 520 transitions. [2022-01-10 14:18:30,355 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 520 transitions. Word has length 34 [2022-01-10 14:18:30,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:18:30,355 INFO L470 AbstractCegarLoop]: Abstraction has 386 states and 520 transitions. [2022-01-10 14:18:30,355 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:18:30,356 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 520 transitions. [2022-01-10 14:18:30,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-01-10 14:18:30,356 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:18:30,356 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] [2022-01-10 14:18:30,356 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-01-10 14:18:30,356 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-01-10 14:18:30,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:18:30,357 INFO L85 PathProgramCache]: Analyzing trace with hash 660642368, now seen corresponding path program 1 times [2022-01-10 14:18:30,357 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:18:30,357 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361589456] [2022-01-10 14:18:30,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:18:30,357 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:18:30,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:18:30,384 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 14:18:30,384 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:18:30,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361589456] [2022-01-10 14:18:30,384 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361589456] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:18:30,384 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:18:30,384 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 14:18:30,384 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127905248] [2022-01-10 14:18:30,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:18:30,385 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 14:18:30,385 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:18:30,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 14:18:30,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 14:18:30,385 INFO L87 Difference]: Start difference. First operand 386 states and 520 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:18:30,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:18:30,421 INFO L93 Difference]: Finished difference Result 400 states and 536 transitions. [2022-01-10 14:18:30,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 14:18:30,422 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2022-01-10 14:18:30,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:18:30,423 INFO L225 Difference]: With dead ends: 400 [2022-01-10 14:18:30,423 INFO L226 Difference]: Without dead ends: 368 [2022-01-10 14:18:30,423 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 14:18:30,423 INFO L933 BasicCegarLoop]: 126 mSDtfsCounter, 1 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 14:18:30,423 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 372 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 14:18:30,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2022-01-10 14:18:30,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 361. [2022-01-10 14:18:30,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 357 states have (on average 1.3389355742296918) internal successors, (478), 360 states have internal predecessors, (478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:18:30,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 478 transitions. [2022-01-10 14:18:30,443 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 478 transitions. Word has length 35 [2022-01-10 14:18:30,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:18:30,443 INFO L470 AbstractCegarLoop]: Abstraction has 361 states and 478 transitions. [2022-01-10 14:18:30,444 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:18:30,444 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 478 transitions. [2022-01-10 14:18:30,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-01-10 14:18:30,444 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:18:30,444 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] [2022-01-10 14:18:30,444 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-01-10 14:18:30,444 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-01-10 14:18:30,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:18:30,445 INFO L85 PathProgramCache]: Analyzing trace with hash -759482811, now seen corresponding path program 1 times [2022-01-10 14:18:30,445 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:18:30,445 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671481189] [2022-01-10 14:18:30,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:18:30,445 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:18:30,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:18:30,480 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 14:18:30,480 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:18:30,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671481189] [2022-01-10 14:18:30,480 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671481189] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:18:30,481 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:18:30,481 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-10 14:18:30,481 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439877652] [2022-01-10 14:18:30,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:18:30,481 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 14:18:30,481 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:18:30,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 14:18:30,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-10 14:18:30,481 INFO L87 Difference]: Start difference. First operand 361 states and 478 transitions. Second operand has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:18:30,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:18:30,692 INFO L93 Difference]: Finished difference Result 608 states and 754 transitions. [2022-01-10 14:18:30,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-10 14:18:30,693 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-01-10 14:18:30,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:18:30,694 INFO L225 Difference]: With dead ends: 608 [2022-01-10 14:18:30,694 INFO L226 Difference]: Without dead ends: 597 [2022-01-10 14:18:30,695 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2022-01-10 14:18:30,695 INFO L933 BasicCegarLoop]: 105 mSDtfsCounter, 349 mSDsluCounter, 530 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 349 SdHoareTripleChecker+Valid, 635 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 14:18:30,695 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [349 Valid, 635 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 14:18:30,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2022-01-10 14:18:30,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 394. [2022-01-10 14:18:30,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 390 states have (on average 1.3256410256410256) internal successors, (517), 393 states have internal predecessors, (517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:18:30,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 517 transitions. [2022-01-10 14:18:30,722 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 517 transitions. Word has length 36 [2022-01-10 14:18:30,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:18:30,722 INFO L470 AbstractCegarLoop]: Abstraction has 394 states and 517 transitions. [2022-01-10 14:18:30,722 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:18:30,722 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 517 transitions. [2022-01-10 14:18:30,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-01-10 14:18:30,722 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:18:30,722 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] [2022-01-10 14:18:30,723 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-01-10 14:18:30,723 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-01-10 14:18:30,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:18:30,723 INFO L85 PathProgramCache]: Analyzing trace with hash -758559290, now seen corresponding path program 1 times [2022-01-10 14:18:30,723 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:18:30,723 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488346057] [2022-01-10 14:18:30,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:18:30,723 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:18:30,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:18:30,750 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 14:18:30,750 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:18:30,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488346057] [2022-01-10 14:18:30,750 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488346057] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:18:30,750 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:18:30,750 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 14:18:30,750 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353315110] [2022-01-10 14:18:30,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:18:30,751 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 14:18:30,751 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:18:30,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 14:18:30,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 14:18:30,751 INFO L87 Difference]: Start difference. First operand 394 states and 517 transitions. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:18:30,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:18:30,863 INFO L93 Difference]: Finished difference Result 473 states and 610 transitions. [2022-01-10 14:18:30,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 14:18:30,863 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-01-10 14:18:30,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:18:30,864 INFO L225 Difference]: With dead ends: 473 [2022-01-10 14:18:30,864 INFO L226 Difference]: Without dead ends: 441 [2022-01-10 14:18:30,865 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 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 14:18:30,865 INFO L933 BasicCegarLoop]: 166 mSDtfsCounter, 80 mSDsluCounter, 389 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 555 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 14:18:30,865 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [80 Valid, 555 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 14:18:30,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2022-01-10 14:18:30,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 371. [2022-01-10 14:18:30,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 371 states, 367 states have (on average 1.3215258855585832) internal successors, (485), 370 states have internal predecessors, (485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:18:30,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 485 transitions. [2022-01-10 14:18:30,888 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 485 transitions. Word has length 36 [2022-01-10 14:18:30,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:18:30,888 INFO L470 AbstractCegarLoop]: Abstraction has 371 states and 485 transitions. [2022-01-10 14:18:30,888 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:18:30,888 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 485 transitions. [2022-01-10 14:18:30,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-01-10 14:18:30,888 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:18:30,889 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] [2022-01-10 14:18:30,889 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-01-10 14:18:30,889 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-01-10 14:18:30,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:18:30,889 INFO L85 PathProgramCache]: Analyzing trace with hash 352923914, now seen corresponding path program 1 times [2022-01-10 14:18:30,889 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:18:30,889 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982674510] [2022-01-10 14:18:30,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:18:30,889 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:18:30,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:18:30,932 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 14:18:30,932 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:18:30,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982674510] [2022-01-10 14:18:30,932 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982674510] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:18:30,932 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:18:30,932 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-10 14:18:30,932 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695906160] [2022-01-10 14:18:30,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:18:30,933 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 14:18:30,933 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:18:30,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 14:18:30,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-10 14:18:30,933 INFO L87 Difference]: Start difference. First operand 371 states and 485 transitions. Second operand has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:18:31,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:18:31,153 INFO L93 Difference]: Finished difference Result 636 states and 799 transitions. [2022-01-10 14:18:31,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-10 14:18:31,154 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2022-01-10 14:18:31,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:18:31,155 INFO L225 Difference]: With dead ends: 636 [2022-01-10 14:18:31,155 INFO L226 Difference]: Without dead ends: 598 [2022-01-10 14:18:31,156 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2022-01-10 14:18:31,156 INFO L933 BasicCegarLoop]: 162 mSDtfsCounter, 294 mSDsluCounter, 645 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 807 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 14:18:31,156 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [294 Valid, 807 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 14:18:31,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2022-01-10 14:18:31,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 385. [2022-01-10 14:18:31,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 385 states, 381 states have (on average 1.3097112860892388) internal successors, (499), 384 states have internal predecessors, (499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:18:31,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 499 transitions. [2022-01-10 14:18:31,182 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 499 transitions. Word has length 37 [2022-01-10 14:18:31,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:18:31,182 INFO L470 AbstractCegarLoop]: Abstraction has 385 states and 499 transitions. [2022-01-10 14:18:31,182 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:18:31,182 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 499 transitions. [2022-01-10 14:18:31,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-01-10 14:18:31,183 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:18:31,183 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] [2022-01-10 14:18:31,183 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-01-10 14:18:31,183 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-01-10 14:18:31,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:18:31,183 INFO L85 PathProgramCache]: Analyzing trace with hash -1190254268, now seen corresponding path program 1 times [2022-01-10 14:18:31,183 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:18:31,183 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126212054] [2022-01-10 14:18:31,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:18:31,183 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:18:31,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-10 14:18:31,412 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-01-10 14:18:31,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-10 14:18:31,554 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-01-10 14:18:31,554 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-01-10 14:18:31,555 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2022-01-10 14:18:31,556 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2022-01-10 14:18:31,556 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (2 of 5 remaining) [2022-01-10 14:18:31,556 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2022-01-10 14:18:31,556 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2022-01-10 14:18:31,556 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-01-10 14:18:31,559 INFO L732 BasicCegarLoop]: Path program histogram: [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 14:18:31,561 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2022-01-10 14:18:31,639 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 02:18:31 BasicIcfg [2022-01-10 14:18:31,639 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-10 14:18:31,640 INFO L158 Benchmark]: Toolchain (without parser) took 7694.76ms. Allocated memory was 181.4MB in the beginning and 360.7MB in the end (delta: 179.3MB). Free memory was 123.5MB in the beginning and 219.2MB in the end (delta: -95.7MB). Peak memory consumption was 83.1MB. Max. memory is 8.0GB. [2022-01-10 14:18:31,640 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 181.4MB. Free memory was 140.4MB in the beginning and 140.3MB in the end (delta: 76.0kB). There was no memory consumed. Max. memory is 8.0GB. [2022-01-10 14:18:31,644 INFO L158 Benchmark]: CACSL2BoogieTranslator took 324.11ms. Allocated memory was 181.4MB in the beginning and 249.6MB in the end (delta: 68.2MB). Free memory was 123.3MB in the beginning and 220.2MB in the end (delta: -96.9MB). Peak memory consumption was 14.9MB. Max. memory is 8.0GB. [2022-01-10 14:18:31,644 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.26ms. Allocated memory is still 249.6MB. Free memory was 220.2MB in the beginning and 218.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-01-10 14:18:31,644 INFO L158 Benchmark]: Boogie Preprocessor took 34.99ms. Allocated memory is still 249.6MB. Free memory was 218.1MB in the beginning and 216.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-01-10 14:18:31,644 INFO L158 Benchmark]: RCFGBuilder took 326.16ms. Allocated memory is still 249.6MB. Free memory was 216.0MB in the beginning and 197.2MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. [2022-01-10 14:18:31,645 INFO L158 Benchmark]: IcfgTransformer took 98.51ms. Allocated memory is still 249.6MB. Free memory was 197.2MB in the beginning and 188.2MB in the end (delta: 8.9MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2022-01-10 14:18:31,646 INFO L158 Benchmark]: TraceAbstraction took 6853.13ms. Allocated memory was 249.6MB in the beginning and 360.7MB in the end (delta: 111.1MB). Free memory was 187.7MB in the beginning and 219.2MB in the end (delta: -31.5MB). Peak memory consumption was 81.2MB. Max. memory is 8.0GB. [2022-01-10 14:18:31,649 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 181.4MB. Free memory was 140.4MB in the beginning and 140.3MB in the end (delta: 76.0kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 324.11ms. Allocated memory was 181.4MB in the beginning and 249.6MB in the end (delta: 68.2MB). Free memory was 123.3MB in the beginning and 220.2MB in the end (delta: -96.9MB). Peak memory consumption was 14.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 51.26ms. Allocated memory is still 249.6MB. Free memory was 220.2MB in the beginning and 218.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 34.99ms. Allocated memory is still 249.6MB. Free memory was 218.1MB in the beginning and 216.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 326.16ms. Allocated memory is still 249.6MB. Free memory was 216.0MB in the beginning and 197.2MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. * IcfgTransformer took 98.51ms. Allocated memory is still 249.6MB. Free memory was 197.2MB in the beginning and 188.2MB in the end (delta: 8.9MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * TraceAbstraction took 6853.13ms. Allocated memory was 249.6MB in the beginning and 360.7MB in the end (delta: 111.1MB). Free memory was 187.7MB in the beginning and 219.2MB in the end (delta: -31.5MB). Peak memory consumption was 81.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of BvToInt. Possible FailurePath: [L227] unsigned int a ; [L228] unsigned int ma = __VERIFIER_nondet_uint(); [L229] signed char ea = __VERIFIER_nondet_char(); [L230] unsigned int b ; [L231] unsigned int mb = __VERIFIER_nondet_uint(); [L232] signed char eb = __VERIFIER_nondet_char(); [L233] unsigned int r_add ; [L234] unsigned int zero ; [L235] int sa ; [L236] int sb ; [L237] int tmp ; [L238] int tmp___0 ; [L239] int tmp___1 ; [L240] int tmp___2 ; [L241] int tmp___3 ; [L242] int tmp___4 ; [L243] int tmp___5 ; [L244] int tmp___6 ; [L245] int tmp___7 ; [L246] int tmp___8 ; [L247] int tmp___9 ; [L248] int __retres23 ; [L252] CALL, EXPR base2flt(0, 0) [L26] unsigned int res ; [L27] unsigned int __retres4 ; VAL [\old(e)=0, \old(m)=0, e=0, m=0] [L30] COND TRUE ! m [L31] __retres4 = 0U VAL [\old(e)=0, \old(m)=0, __retres4=0, e=0, m=0] [L81] return (__retres4); VAL [\old(e)=0, \old(m)=0, \result=0, __retres4=0, e=0, m=0] [L252] RET, EXPR base2flt(0, 0) [L252] zero = base2flt(0, 0) [L253] CALL, EXPR base2flt(ma, ea) [L26] unsigned int res ; [L27] unsigned int __retres4 ; VAL [\old(e)=121, \old(m)=16777217, e=121, m=16777217] [L30] COND FALSE !(! m) VAL [\old(e)=121, \old(m)=16777217, e=121, m=16777217] [L36] COND FALSE !(m < 1U << 24U) VAL [\old(e)=121, \old(m)=16777217, e=121, m=16777217] [L58] COND TRUE 1 VAL [\old(e)=121, \old(m)=16777217, e=121, m=16777217] [L60] COND FALSE !(m >= 1U << 25U) VAL [\old(e)=121, \old(m)=16777217, e=121, m=16777217] [L77] m = m & ~ (1U << 24U) [L78] res = m | ((unsigned int ) (e + 128) << 24U) [L79] __retres4 = res VAL [\old(e)=121, \old(m)=16777217, __retres4=4177526784, e=121, m=0, res=4177526784] [L81] return (__retres4); VAL [\old(e)=121, \old(m)=16777217, \result=-117440512, __retres4=4177526784, e=121, m=0, res=4177526784] [L253] RET, EXPR base2flt(ma, ea) [L253] a = base2flt(ma, ea) [L254] CALL, EXPR base2flt(mb, eb) [L26] unsigned int res ; [L27] unsigned int __retres4 ; VAL [\old(e)=127, \old(m)=33554432, e=127, m=33554432] [L30] COND FALSE !(! m) VAL [\old(e)=127, \old(m)=33554432, e=127, m=33554432] [L36] COND FALSE !(m < 1U << 24U) VAL [\old(e)=127, \old(m)=33554432, e=127, m=33554432] [L58] COND TRUE 1 VAL [\old(e)=127, \old(m)=33554432, e=127, m=33554432] [L60] COND TRUE m >= 1U << 25U VAL [\old(e)=127, \old(m)=33554432, e=127, m=33554432] [L65] COND TRUE e >= 127 [L66] __retres4 = 4294967295U VAL [\old(e)=127, \old(m)=33554432, __retres4=4294967295, e=127, m=33554432] [L81] return (__retres4); VAL [\old(e)=127, \old(m)=33554432, \result=-1, __retres4=4294967295, e=127, m=33554432] [L254] RET, EXPR base2flt(mb, eb) [L254] b = base2flt(mb, eb) [L256] COND FALSE !(a < zero) VAL [a=4177526784, b=4294967295, ea=121, eb=127, ma=16777217, mb=33554432, zero=0] [L259] COND TRUE a > zero [L260] tmp = 1 VAL [a=4177526784, b=4294967295, ea=121, eb=127, ma=16777217, mb=33554432, tmp=1, zero=0] [L264] sa = tmp VAL [a=4177526784, b=4294967295, ea=121, eb=127, ma=16777217, mb=33554432, sa=1, tmp=1, zero=0] [L266] COND FALSE !(b < zero) VAL [a=4177526784, b=4294967295, ea=121, eb=127, ma=16777217, mb=33554432, sa=1, tmp=1, zero=0] [L269] COND TRUE b > zero [L270] tmp___0 = 1 VAL [a=4177526784, b=4294967295, ea=121, eb=127, ma=16777217, mb=33554432, sa=1, tmp=1, tmp___0=1, zero=0] [L274] sb = tmp___0 VAL [a=4177526784, b=4294967295, ea=121, eb=127, ma=16777217, mb=33554432, sa=1, sb=1, tmp=1, tmp___0=1, zero=0] [L277] CALL addflt(a, b) [L85] unsigned int res ; [L86] unsigned int ma ; [L87] unsigned int mb ; [L88] unsigned int delta ; [L89] int ea ; [L90] int eb ; [L91] unsigned int tmp ; [L92] unsigned int __retres10 ; VAL [\old(a)=4177526784, \old(b)=4294967295, a=4177526784, b=4294967295] [L95] COND TRUE a < b [L96] tmp = a [L97] a = b [L98] b = tmp VAL [\old(a)=4177526784, \old(b)=4294967295, a=4294967295, b=4177526784, tmp=4177526784] [L102] COND FALSE !(! b) [L109] ma = a & ((1U << 24U) - 1U) [L110] ea = (int )(a >> 24U) - 128 [L111] ma = ma | (1U << 24U) [L112] mb = b & ((1U << 24U) - 1U) [L113] eb = (int )(b >> 24U) - 128 [L114] mb = mb | (1U << 24U) [L115] CALL __VERIFIER_assert(ea >= eb) [L17] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L115] RET __VERIFIER_assert(ea >= eb) [L116] delta = ea - eb VAL [\old(a)=4177526784, \old(b)=4294967295, a=4294967295, b=4177526784, delta=6, ea=127, eb=121, ma=33030146, mb=33554431, tmp=4177526784] [L117] COND FALSE !(!(delta < sizeof(mb) * 8)) VAL [\old(a)=4177526784, \old(b)=4294967295, a=4294967295, b=4177526784, delta=6, ea=127, eb=121, ma=33030146, mb=33554431, tmp=4177526784] [L118] mb = mb >> delta VAL [\old(a)=4177526784, \old(b)=4294967295, a=4294967295, b=4177526784, delta=6, ea=127, eb=121, ma=33030146, mb=524287, tmp=4177526784] [L120] COND FALSE !(! mb) [L126] ma = ma + mb VAL [\old(a)=4177526784, \old(b)=4294967295, a=4294967295, b=4177526784, delta=6, ea=127, eb=121, ma=33554433, mb=524287, tmp=4177526784] [L127] COND FALSE !(ma & (1U << 25U)) VAL [\old(a)=4177526784, \old(b)=4294967295, a=4294967295, b=4177526784, delta=6, ea=127, eb=121, ma=33554433, mb=524287, tmp=4177526784] [L140] CALL __VERIFIER_assert(ma < 1U << 25U) [L17] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L18] reach_error() VAL [\old(cond)=0, cond=0] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 97 locations, 5 error locations. Started 1 CEGAR loops. OverallTime: 6.7s, OverallIterations: 23, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 9681 SdHoareTripleChecker+Valid, 2.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 9681 mSDsluCounter, 14613 SdHoareTripleChecker+Invalid, 1.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 11381 mSDsCounter, 278 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2842 IncrementalHoareTripleChecker+Invalid, 3120 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 278 mSolverCounterUnsat, 3232 mSDtfsCounter, 2842 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 279 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 229 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 377 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=453occurred in iteration=9, InterpolantAutomatonStates: 221, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 22 MinimizatonAttempts, 4269 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 684 NumberOfCodeBlocks, 684 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 625 ConstructedInterpolants, 0 QuantifiedInterpolants, 1372 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 22 InterpolantComputations, 22 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-01-10 14:18:31,671 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...