/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_4-3a.c.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 14:18:35,949 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 14:18:35,950 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 14:18:35,992 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 14:18:35,992 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 14:18:35,993 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 14:18:35,994 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 14:18:35,995 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 14:18:35,996 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 14:18:35,996 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 14:18:35,998 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 14:18:35,999 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 14:18:35,999 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 14:18:36,000 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 14:18:36,000 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 14:18:36,001 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 14:18:36,001 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 14:18:36,002 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 14:18:36,003 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 14:18:36,004 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 14:18:36,005 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 14:18:36,009 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 14:18:36,010 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 14:18:36,010 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 14:18:36,012 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 14:18:36,012 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 14:18:36,012 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 14:18:36,013 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 14:18:36,013 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 14:18:36,014 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 14:18:36,014 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 14:18:36,014 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 14:18:36,015 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 14:18:36,015 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 14:18:36,016 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 14:18:36,016 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 14:18:36,017 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 14:18:36,017 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 14:18:36,017 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 14:18:36,017 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 14:18:36,018 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 14:18:36,027 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:36,046 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 14:18:36,047 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 14:18:36,047 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 14:18:36,047 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 14:18:36,048 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 14:18:36,048 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 14:18:36,048 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 14:18:36,048 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 14:18:36,048 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 14:18:36,048 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 14:18:36,048 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 14:18:36,048 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 14:18:36,048 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 14:18:36,049 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 14:18:36,049 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-10 14:18:36,049 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-10 14:18:36,049 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 14:18:36,049 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 14:18:36,049 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 14:18:36,049 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 14:18:36,049 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 14:18:36,049 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 14:18:36,049 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 14:18:36,049 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 14:18:36,050 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 14:18:36,050 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-10 14:18:36,050 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-10 14:18:36,050 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 14:18:36,050 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 14:18:36,050 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 14:18:36,050 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-01-10 14:18:36,050 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-10 14:18:36,051 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-10 14:18:36,051 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:36,236 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 14:18:36,250 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 14:18:36,255 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 14:18:36,255 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 14:18:36,256 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 14:18:36,257 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/bitvector/soft_float_4-3a.c.cil.c [2022-01-10 14:18:36,313 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d59455420/70fb8d54ddac4ea3bef133bf57eaa6dd/FLAGa7a0f7481 [2022-01-10 14:18:36,624 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 14:18:36,624 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/bitvector/soft_float_4-3a.c.cil.c [2022-01-10 14:18:36,629 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d59455420/70fb8d54ddac4ea3bef133bf57eaa6dd/FLAGa7a0f7481 [2022-01-10 14:18:37,043 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d59455420/70fb8d54ddac4ea3bef133bf57eaa6dd [2022-01-10 14:18:37,045 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 14:18:37,046 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-01-10 14:18:37,047 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 14:18:37,047 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 14:18:37,049 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 14:18:37,050 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 02:18:37" (1/1) ... [2022-01-10 14:18:37,051 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1de58d56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:18:37, skipping insertion in model container [2022-01-10 14:18:37,051 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 02:18:37" (1/1) ... [2022-01-10 14:18:37,055 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 14:18:37,071 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 14:18:37,171 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_4-3a.c.cil.c[730,743] [2022-01-10 14:18:37,211 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 14:18:37,235 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 14:18:37,243 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_4-3a.c.cil.c[730,743] [2022-01-10 14:18:37,278 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 14:18:37,299 INFO L208 MainTranslator]: Completed translation [2022-01-10 14:18:37,300 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:18:37 WrapperNode [2022-01-10 14:18:37,300 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 14:18:37,301 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 14:18:37,301 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 14:18:37,301 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 14:18:37,306 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:37" (1/1) ... [2022-01-10 14:18:37,325 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:37" (1/1) ... [2022-01-10 14:18:37,362 INFO L137 Inliner]: procedures = 17, calls = 18, calls flagged for inlining = 13, calls inlined = 14, statements flattened = 301 [2022-01-10 14:18:37,363 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 14:18:37,363 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 14:18:37,363 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 14:18:37,363 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 14:18:37,369 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:37" (1/1) ... [2022-01-10 14:18:37,370 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:37" (1/1) ... [2022-01-10 14:18:37,372 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:37" (1/1) ... [2022-01-10 14:18:37,372 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:37" (1/1) ... [2022-01-10 14:18:37,378 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:37" (1/1) ... [2022-01-10 14:18:37,382 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:37" (1/1) ... [2022-01-10 14:18:37,383 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:37" (1/1) ... [2022-01-10 14:18:37,386 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 14:18:37,387 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 14:18:37,387 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 14:18:37,387 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 14:18:37,388 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:18:37" (1/1) ... [2022-01-10 14:18:37,393 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 14:18:37,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 14:18:37,424 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:37,440 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:37,455 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 14:18:37,455 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-10 14:18:37,455 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 14:18:37,455 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 14:18:37,506 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 14:18:37,507 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 14:18:37,787 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 14:18:37,792 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 14:18:37,793 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2022-01-10 14:18:37,794 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 02:18:37 BoogieIcfgContainer [2022-01-10 14:18:37,794 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 14:18:37,795 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-10 14:18:37,795 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-10 14:18:37,797 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-10 14:18:37,799 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 02:18:37" (1/1) ... [2022-01-10 14:18:37,898 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 02:18:37 BasicIcfg [2022-01-10 14:18:37,898 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-10 14:18:37,899 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 14:18:37,900 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 14:18:37,902 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 14:18:37,902 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 02:18:37" (1/4) ... [2022-01-10 14:18:37,904 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7eed89ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 02:18:37, skipping insertion in model container [2022-01-10 14:18:37,904 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:18:37" (2/4) ... [2022-01-10 14:18:37,904 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7eed89ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 02:18:37, skipping insertion in model container [2022-01-10 14:18:37,904 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 02:18:37" (3/4) ... [2022-01-10 14:18:37,905 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7eed89ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 02:18:37, skipping insertion in model container [2022-01-10 14:18:37,905 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 02:18:37" (4/4) ... [2022-01-10 14:18:37,906 INFO L111 eAbstractionObserver]: Analyzing ICFG soft_float_4-3a.c.cil.cTransformedIcfg [2022-01-10 14:18:37,909 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 14:18:37,910 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2022-01-10 14:18:37,941 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 14:18:37,946 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:37,946 INFO L340 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-01-10 14:18:37,956 INFO L276 IsEmpty]: Start isEmpty. Operand has 86 states, 78 states have (on average 1.7179487179487178) internal successors, (134), 85 states have internal predecessors, (134), 0 states have call successors, (0), 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:37,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-01-10 14:18:37,961 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:18:37,961 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 14:18:37,961 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-01-10 14:18:37,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:18:37,965 INFO L85 PathProgramCache]: Analyzing trace with hash -2124957439, now seen corresponding path program 1 times [2022-01-10 14:18:37,971 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:18:37,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715019802] [2022-01-10 14:18:37,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:18:37,972 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:18:38,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:18:38,200 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:38,201 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:18:38,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715019802] [2022-01-10 14:18:38,202 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715019802] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:18:38,202 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:18:38,202 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 14:18:38,204 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314570649] [2022-01-10 14:18:38,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:18:38,208 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 14:18:38,209 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:18:38,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 14:18:38,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 14:18:38,239 INFO L87 Difference]: Start difference. First operand has 86 states, 78 states have (on average 1.7179487179487178) internal successors, (134), 85 states have internal predecessors, (134), 0 states have call successors, (0), 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 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 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:38,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:18:38,435 INFO L93 Difference]: Finished difference Result 219 states and 323 transitions. [2022-01-10 14:18:38,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 14:18:38,437 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 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 15 [2022-01-10 14:18:38,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:18:38,445 INFO L225 Difference]: With dead ends: 219 [2022-01-10 14:18:38,445 INFO L226 Difference]: Without dead ends: 135 [2022-01-10 14:18:38,447 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-10 14:18:38,450 INFO L933 BasicCegarLoop]: 102 mSDtfsCounter, 242 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 14:18:38,451 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [242 Valid, 342 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 14:18:38,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2022-01-10 14:18:38,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 85. [2022-01-10 14:18:38,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 78 states have (on average 1.4615384615384615) internal successors, (114), 84 states have internal predecessors, (114), 0 states have call successors, (0), 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:38,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 114 transitions. [2022-01-10 14:18:38,479 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 114 transitions. Word has length 15 [2022-01-10 14:18:38,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:18:38,479 INFO L470 AbstractCegarLoop]: Abstraction has 85 states and 114 transitions. [2022-01-10 14:18:38,479 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 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:38,479 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 114 transitions. [2022-01-10 14:18:38,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-01-10 14:18:38,480 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:18:38,480 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 14:18:38,480 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-10 14:18:38,480 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-01-10 14:18:38,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:18:38,481 INFO L85 PathProgramCache]: Analyzing trace with hash -2124927648, now seen corresponding path program 1 times [2022-01-10 14:18:38,481 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:18:38,481 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208350996] [2022-01-10 14:18:38,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:18:38,482 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:18:38,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:18:38,587 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:38,588 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:18:38,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208350996] [2022-01-10 14:18:38,588 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208350996] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:18:38,588 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:18:38,589 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 14:18:38,589 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359399153] [2022-01-10 14:18:38,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:18:38,590 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 14:18:38,590 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:18:38,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 14:18:38,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 14:18:38,591 INFO L87 Difference]: Start difference. First operand 85 states and 114 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 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:38,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:18:38,705 INFO L93 Difference]: Finished difference Result 184 states and 231 transitions. [2022-01-10 14:18:38,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 14:18:38,707 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 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 15 [2022-01-10 14:18:38,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:18:38,710 INFO L225 Difference]: With dead ends: 184 [2022-01-10 14:18:38,711 INFO L226 Difference]: Without dead ends: 139 [2022-01-10 14:18:38,713 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-10 14:18:38,714 INFO L933 BasicCegarLoop]: 103 mSDtfsCounter, 122 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 396 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 14:18:38,714 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [122 Valid, 396 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 14:18:38,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2022-01-10 14:18:38,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 86. [2022-01-10 14:18:38,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 79 states have (on average 1.4556962025316456) internal successors, (115), 85 states have internal predecessors, (115), 0 states have call successors, (0), 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:38,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 115 transitions. [2022-01-10 14:18:38,721 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 115 transitions. Word has length 15 [2022-01-10 14:18:38,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:18:38,721 INFO L470 AbstractCegarLoop]: Abstraction has 86 states and 115 transitions. [2022-01-10 14:18:38,721 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 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:38,721 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 115 transitions. [2022-01-10 14:18:38,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-01-10 14:18:38,722 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:18:38,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] [2022-01-10 14:18:38,722 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-10 14:18:38,722 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-01-10 14:18:38,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:18:38,725 INFO L85 PathProgramCache]: Analyzing trace with hash 1591836809, now seen corresponding path program 1 times [2022-01-10 14:18:38,725 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:18:38,725 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380097219] [2022-01-10 14:18:38,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:18:38,726 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:18:38,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:18:38,818 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:38,819 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:18:38,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380097219] [2022-01-10 14:18:38,820 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380097219] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:18:38,820 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:18:38,820 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-10 14:18:38,821 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872472695] [2022-01-10 14:18:38,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:18:38,821 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 14:18:38,821 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:18:38,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 14:18:38,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-10 14:18:38,822 INFO L87 Difference]: Start difference. First operand 86 states and 115 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 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:38,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:18:38,983 INFO L93 Difference]: Finished difference Result 236 states and 299 transitions. [2022-01-10 14:18:38,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-10 14:18:38,984 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 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 19 [2022-01-10 14:18:38,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:18:38,985 INFO L225 Difference]: With dead ends: 236 [2022-01-10 14:18:38,985 INFO L226 Difference]: Without dead ends: 210 [2022-01-10 14:18:38,985 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2022-01-10 14:18:38,986 INFO L933 BasicCegarLoop]: 96 mSDtfsCounter, 427 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 427 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 14:18:38,986 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [427 Valid, 419 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 14:18:38,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2022-01-10 14:18:38,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 118. [2022-01-10 14:18:38,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 111 states have (on average 1.4504504504504505) internal successors, (161), 117 states have internal predecessors, (161), 0 states have call successors, (0), 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:38,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 161 transitions. [2022-01-10 14:18:38,996 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 161 transitions. Word has length 19 [2022-01-10 14:18:38,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:18:38,996 INFO L470 AbstractCegarLoop]: Abstraction has 118 states and 161 transitions. [2022-01-10 14:18:38,996 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 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:38,996 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 161 transitions. [2022-01-10 14:18:38,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-01-10 14:18:38,997 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:18:38,997 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 14:18:38,997 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-10 14:18:38,997 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-01-10 14:18:38,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:18:38,998 INFO L85 PathProgramCache]: Analyzing trace with hash 1591866600, now seen corresponding path program 1 times [2022-01-10 14:18:38,998 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:18:38,998 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144174899] [2022-01-10 14:18:38,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:18:38,998 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:18:39,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:18:39,050 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:39,051 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:18:39,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144174899] [2022-01-10 14:18:39,051 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144174899] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:18:39,051 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:18:39,051 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-10 14:18:39,051 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804647066] [2022-01-10 14:18:39,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:18:39,052 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 14:18:39,052 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:18:39,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 14:18:39,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-10 14:18:39,052 INFO L87 Difference]: Start difference. First operand 118 states and 161 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 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:39,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:18:39,167 INFO L93 Difference]: Finished difference Result 225 states and 281 transitions. [2022-01-10 14:18:39,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-10 14:18:39,167 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 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 19 [2022-01-10 14:18:39,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:18:39,168 INFO L225 Difference]: With dead ends: 225 [2022-01-10 14:18:39,168 INFO L226 Difference]: Without dead ends: 200 [2022-01-10 14:18:39,169 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2022-01-10 14:18:39,169 INFO L933 BasicCegarLoop]: 100 mSDtfsCounter, 242 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 487 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 14:18:39,170 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [242 Valid, 487 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 14:18:39,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2022-01-10 14:18:39,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 119. [2022-01-10 14:18:39,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 112 states have (on average 1.4464285714285714) internal successors, (162), 118 states have internal predecessors, (162), 0 states have call successors, (0), 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:39,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 162 transitions. [2022-01-10 14:18:39,177 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 162 transitions. Word has length 19 [2022-01-10 14:18:39,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:18:39,178 INFO L470 AbstractCegarLoop]: Abstraction has 119 states and 162 transitions. [2022-01-10 14:18:39,178 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 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:39,178 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 162 transitions. [2022-01-10 14:18:39,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-01-10 14:18:39,178 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:18:39,179 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 14:18:39,179 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-10 14:18:39,179 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-01-10 14:18:39,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:18:39,179 INFO L85 PathProgramCache]: Analyzing trace with hash -1716453005, now seen corresponding path program 1 times [2022-01-10 14:18:39,179 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:18:39,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215969820] [2022-01-10 14:18:39,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:18:39,180 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:18:39,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:18:39,250 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:39,250 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:18:39,250 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215969820] [2022-01-10 14:18:39,250 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215969820] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:18:39,250 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:18:39,250 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-10 14:18:39,251 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054655448] [2022-01-10 14:18:39,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:18:39,251 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 14:18:39,251 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:18:39,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 14:18:39,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-10 14:18:39,252 INFO L87 Difference]: Start difference. First operand 119 states and 162 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 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:39,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:18:39,415 INFO L93 Difference]: Finished difference Result 214 states and 266 transitions. [2022-01-10 14:18:39,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-10 14:18:39,416 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 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 19 [2022-01-10 14:18:39,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:18:39,416 INFO L225 Difference]: With dead ends: 214 [2022-01-10 14:18:39,417 INFO L226 Difference]: Without dead ends: 185 [2022-01-10 14:18:39,417 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=167, Unknown=0, NotChecked=0, Total=240 [2022-01-10 14:18:39,418 INFO L933 BasicCegarLoop]: 99 mSDtfsCounter, 233 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 577 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 14:18:39,418 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [233 Valid, 577 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 14:18:39,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2022-01-10 14:18:39,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 108. [2022-01-10 14:18:39,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 101 states have (on average 1.4257425742574257) internal successors, (144), 107 states have internal predecessors, (144), 0 states have call successors, (0), 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:39,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 144 transitions. [2022-01-10 14:18:39,424 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 144 transitions. Word has length 19 [2022-01-10 14:18:39,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:18:39,424 INFO L470 AbstractCegarLoop]: Abstraction has 108 states and 144 transitions. [2022-01-10 14:18:39,424 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 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:39,425 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 144 transitions. [2022-01-10 14:18:39,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-01-10 14:18:39,425 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:18:39,425 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] [2022-01-10 14:18:39,425 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-10 14:18:39,426 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-01-10 14:18:39,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:18:39,426 INFO L85 PathProgramCache]: Analyzing trace with hash 1270198582, now seen corresponding path program 1 times [2022-01-10 14:18:39,426 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:18:39,426 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290062920] [2022-01-10 14:18:39,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:18:39,426 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:18:39,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:18:39,505 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:39,506 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:18:39,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290062920] [2022-01-10 14:18:39,506 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290062920] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:18:39,506 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:18:39,506 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-10 14:18:39,506 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503252761] [2022-01-10 14:18:39,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:18:39,506 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-10 14:18:39,507 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:18:39,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-10 14:18:39,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-01-10 14:18:39,507 INFO L87 Difference]: Start difference. First operand 108 states and 144 transitions. Second operand has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 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:39,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:18:39,722 INFO L93 Difference]: Finished difference Result 195 states and 239 transitions. [2022-01-10 14:18:39,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-10 14:18:39,723 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 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 23 [2022-01-10 14:18:39,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:18:39,724 INFO L225 Difference]: With dead ends: 195 [2022-01-10 14:18:39,724 INFO L226 Difference]: Without dead ends: 191 [2022-01-10 14:18:39,724 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=182, Unknown=0, NotChecked=0, Total=272 [2022-01-10 14:18:39,726 INFO L933 BasicCegarLoop]: 115 mSDtfsCounter, 210 mSDsluCounter, 771 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 886 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 14:18:39,727 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [210 Valid, 886 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 14:18:39,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2022-01-10 14:18:39,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 125. [2022-01-10 14:18:39,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 118 states have (on average 1.4067796610169492) internal successors, (166), 124 states have internal predecessors, (166), 0 states have call successors, (0), 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:39,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 166 transitions. [2022-01-10 14:18:39,738 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 166 transitions. Word has length 23 [2022-01-10 14:18:39,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:18:39,738 INFO L470 AbstractCegarLoop]: Abstraction has 125 states and 166 transitions. [2022-01-10 14:18:39,738 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 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:39,739 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 166 transitions. [2022-01-10 14:18:39,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-01-10 14:18:39,742 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:18:39,743 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] [2022-01-10 14:18:39,743 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-10 14:18:39,743 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-01-10 14:18:39,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:18:39,744 INFO L85 PathProgramCache]: Analyzing trace with hash 336695478, now seen corresponding path program 1 times [2022-01-10 14:18:39,744 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:18:39,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125532595] [2022-01-10 14:18:39,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:18:39,744 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:18:39,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:18:39,824 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:39,825 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:18:39,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125532595] [2022-01-10 14:18:39,825 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125532595] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:18:39,825 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:18:39,825 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-10 14:18:39,825 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183448961] [2022-01-10 14:18:39,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:18:39,825 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 14:18:39,826 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:18:39,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 14:18:39,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-10 14:18:39,826 INFO L87 Difference]: Start difference. First operand 125 states and 166 transitions. Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 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:39,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:18:39,926 INFO L93 Difference]: Finished difference Result 182 states and 230 transitions. [2022-01-10 14:18:39,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-10 14:18:39,927 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 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 23 [2022-01-10 14:18:39,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:18:39,928 INFO L225 Difference]: With dead ends: 182 [2022-01-10 14:18:39,928 INFO L226 Difference]: Without dead ends: 149 [2022-01-10 14:18:39,928 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-01-10 14:18:39,931 INFO L933 BasicCegarLoop]: 100 mSDtfsCounter, 112 mSDsluCounter, 500 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 600 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 14:18:39,931 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [112 Valid, 600 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 14:18:39,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2022-01-10 14:18:39,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 119. [2022-01-10 14:18:39,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 112 states have (on average 1.3928571428571428) internal successors, (156), 118 states have internal predecessors, (156), 0 states have call successors, (0), 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:39,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 156 transitions. [2022-01-10 14:18:39,942 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 156 transitions. Word has length 23 [2022-01-10 14:18:39,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:18:39,942 INFO L470 AbstractCegarLoop]: Abstraction has 119 states and 156 transitions. [2022-01-10 14:18:39,942 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 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:39,942 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 156 transitions. [2022-01-10 14:18:39,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-01-10 14:18:39,943 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:18:39,943 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] [2022-01-10 14:18:39,943 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-10 14:18:39,944 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-01-10 14:18:39,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:18:39,944 INFO L85 PathProgramCache]: Analyzing trace with hash 1323372960, now seen corresponding path program 1 times [2022-01-10 14:18:39,944 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:18:39,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630315999] [2022-01-10 14:18:39,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:18:39,944 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:18:39,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:18:40,001 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:40,002 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:18:40,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630315999] [2022-01-10 14:18:40,002 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630315999] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:18:40,002 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:18:40,002 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-10 14:18:40,002 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829625349] [2022-01-10 14:18:40,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:18:40,003 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 14:18:40,003 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:18:40,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 14:18:40,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-10 14:18:40,003 INFO L87 Difference]: Start difference. First operand 119 states and 156 transitions. Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 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:40,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:18:40,172 INFO L93 Difference]: Finished difference Result 345 states and 433 transitions. [2022-01-10 14:18:40,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-10 14:18:40,172 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 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 23 [2022-01-10 14:18:40,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:18:40,174 INFO L225 Difference]: With dead ends: 345 [2022-01-10 14:18:40,174 INFO L226 Difference]: Without dead ends: 299 [2022-01-10 14:18:40,174 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2022-01-10 14:18:40,174 INFO L933 BasicCegarLoop]: 159 mSDtfsCounter, 582 mSDsluCounter, 542 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 582 SdHoareTripleChecker+Valid, 701 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 14:18:40,175 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [582 Valid, 701 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 14:18:40,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2022-01-10 14:18:40,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 133. [2022-01-10 14:18:40,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 126 states have (on average 1.3968253968253967) internal successors, (176), 132 states have internal predecessors, (176), 0 states have call successors, (0), 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:40,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 176 transitions. [2022-01-10 14:18:40,183 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 176 transitions. Word has length 23 [2022-01-10 14:18:40,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:18:40,183 INFO L470 AbstractCegarLoop]: Abstraction has 133 states and 176 transitions. [2022-01-10 14:18:40,183 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 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:40,183 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 176 transitions. [2022-01-10 14:18:40,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-01-10 14:18:40,184 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:18:40,184 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] [2022-01-10 14:18:40,184 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-10 14:18:40,184 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-01-10 14:18:40,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:18:40,184 INFO L85 PathProgramCache]: Analyzing trace with hash 1323402751, now seen corresponding path program 1 times [2022-01-10 14:18:40,185 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:18:40,185 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951700627] [2022-01-10 14:18:40,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:18:40,185 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:18:40,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:18:40,309 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:40,309 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:18:40,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951700627] [2022-01-10 14:18:40,309 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951700627] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:18:40,309 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:18:40,309 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-10 14:18:40,310 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666258324] [2022-01-10 14:18:40,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:18:40,310 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-10 14:18:40,310 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:18:40,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-10 14:18:40,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-01-10 14:18:40,326 INFO L87 Difference]: Start difference. First operand 133 states and 176 transitions. Second operand has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 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:40,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:18:40,708 INFO L93 Difference]: Finished difference Result 358 states and 452 transitions. [2022-01-10 14:18:40,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-10 14:18:40,708 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 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 23 [2022-01-10 14:18:40,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:18:40,709 INFO L225 Difference]: With dead ends: 358 [2022-01-10 14:18:40,709 INFO L226 Difference]: Without dead ends: 327 [2022-01-10 14:18:40,710 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2022-01-10 14:18:40,711 INFO L933 BasicCegarLoop]: 211 mSDtfsCounter, 441 mSDsluCounter, 940 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 441 SdHoareTripleChecker+Valid, 1151 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 14:18:40,712 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [441 Valid, 1151 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-10 14:18:40,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2022-01-10 14:18:40,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 138. [2022-01-10 14:18:40,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 131 states have (on average 1.381679389312977) internal successors, (181), 137 states have internal predecessors, (181), 0 states have call successors, (0), 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:40,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 181 transitions. [2022-01-10 14:18:40,724 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 181 transitions. Word has length 23 [2022-01-10 14:18:40,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:18:40,725 INFO L470 AbstractCegarLoop]: Abstraction has 138 states and 181 transitions. [2022-01-10 14:18:40,725 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 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:40,725 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 181 transitions. [2022-01-10 14:18:40,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-01-10 14:18:40,726 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:18:40,726 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] [2022-01-10 14:18:40,726 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-10 14:18:40,726 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-01-10 14:18:40,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:18:40,727 INFO L85 PathProgramCache]: Analyzing trace with hash -626352747, now seen corresponding path program 1 times [2022-01-10 14:18:40,727 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:18:40,727 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752307306] [2022-01-10 14:18:40,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:18:40,727 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:18:40,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:18:40,888 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:40,889 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:18:40,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752307306] [2022-01-10 14:18:40,889 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752307306] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:18:40,889 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:18:40,889 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-10 14:18:40,889 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332245209] [2022-01-10 14:18:40,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:18:40,889 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 14:18:40,889 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:18:40,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 14:18:40,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-10 14:18:40,890 INFO L87 Difference]: Start difference. First operand 138 states and 181 transitions. Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 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:41,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:18:41,313 INFO L93 Difference]: Finished difference Result 327 states and 414 transitions. [2022-01-10 14:18:41,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-01-10 14:18:41,313 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 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 23 [2022-01-10 14:18:41,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:18:41,315 INFO L225 Difference]: With dead ends: 327 [2022-01-10 14:18:41,315 INFO L226 Difference]: Without dead ends: 325 [2022-01-10 14:18:41,315 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=188, Unknown=0, NotChecked=0, Total=272 [2022-01-10 14:18:41,316 INFO L933 BasicCegarLoop]: 207 mSDtfsCounter, 382 mSDsluCounter, 709 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 382 SdHoareTripleChecker+Valid, 916 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-10 14:18:41,317 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [382 Valid, 916 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-10 14:18:41,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2022-01-10 14:18:41,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 139. [2022-01-10 14:18:41,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 132 states have (on average 1.3863636363636365) internal successors, (183), 138 states have internal predecessors, (183), 0 states have call successors, (0), 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:41,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 183 transitions. [2022-01-10 14:18:41,326 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 183 transitions. Word has length 23 [2022-01-10 14:18:41,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:18:41,326 INFO L470 AbstractCegarLoop]: Abstraction has 139 states and 183 transitions. [2022-01-10 14:18:41,326 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 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:41,326 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 183 transitions. [2022-01-10 14:18:41,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-01-10 14:18:41,328 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:18:41,328 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] [2022-01-10 14:18:41,328 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-10 14:18:41,329 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-01-10 14:18:41,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:18:41,329 INFO L85 PathProgramCache]: Analyzing trace with hash -703423573, now seen corresponding path program 1 times [2022-01-10 14:18:41,329 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:18:41,329 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523349386] [2022-01-10 14:18:41,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:18:41,330 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:18:41,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:18:41,457 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:41,457 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:18:41,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523349386] [2022-01-10 14:18:41,457 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523349386] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:18:41,457 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:18:41,457 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-10 14:18:41,457 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731300751] [2022-01-10 14:18:41,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:18:41,458 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 14:18:41,458 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:18:41,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 14:18:41,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-10 14:18:41,459 INFO L87 Difference]: Start difference. First operand 139 states and 183 transitions. Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 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:41,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:18:41,714 INFO L93 Difference]: Finished difference Result 272 states and 346 transitions. [2022-01-10 14:18:41,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-10 14:18:41,715 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 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 23 [2022-01-10 14:18:41,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:18:41,716 INFO L225 Difference]: With dead ends: 272 [2022-01-10 14:18:41,716 INFO L226 Difference]: Without dead ends: 236 [2022-01-10 14:18:41,716 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2022-01-10 14:18:41,717 INFO L933 BasicCegarLoop]: 174 mSDtfsCounter, 249 mSDsluCounter, 606 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 780 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 14:18:41,717 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [249 Valid, 780 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-10 14:18:41,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2022-01-10 14:18:41,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 146. [2022-01-10 14:18:41,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 139 states have (on average 1.3741007194244603) internal successors, (191), 145 states have internal predecessors, (191), 0 states have call successors, (0), 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:41,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 191 transitions. [2022-01-10 14:18:41,726 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 191 transitions. Word has length 23 [2022-01-10 14:18:41,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:18:41,726 INFO L470 AbstractCegarLoop]: Abstraction has 146 states and 191 transitions. [2022-01-10 14:18:41,726 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 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:41,727 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 191 transitions. [2022-01-10 14:18:41,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-01-10 14:18:41,731 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:18:41,731 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] [2022-01-10 14:18:41,731 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-10 14:18:41,732 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-01-10 14:18:41,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:18:41,732 INFO L85 PathProgramCache]: Analyzing trace with hash -703393782, now seen corresponding path program 1 times [2022-01-10 14:18:41,732 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:18:41,732 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012938352] [2022-01-10 14:18:41,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:18:41,732 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:18:41,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:18:41,854 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:41,855 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:18:41,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012938352] [2022-01-10 14:18:41,855 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012938352] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:18:41,855 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:18:41,855 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-10 14:18:41,855 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853031596] [2022-01-10 14:18:41,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:18:41,855 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-10 14:18:41,855 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:18:41,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-10 14:18:41,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-01-10 14:18:41,856 INFO L87 Difference]: Start difference. First operand 146 states and 191 transitions. Second operand has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 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:42,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:18:42,353 INFO L93 Difference]: Finished difference Result 234 states and 300 transitions. [2022-01-10 14:18:42,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-10 14:18:42,353 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 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 23 [2022-01-10 14:18:42,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:18:42,354 INFO L225 Difference]: With dead ends: 234 [2022-01-10 14:18:42,354 INFO L226 Difference]: Without dead ends: 232 [2022-01-10 14:18:42,354 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=260, Unknown=0, NotChecked=0, Total=380 [2022-01-10 14:18:42,355 INFO L933 BasicCegarLoop]: 147 mSDtfsCounter, 466 mSDsluCounter, 709 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 466 SdHoareTripleChecker+Valid, 856 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-10 14:18:42,355 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [466 Valid, 856 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-10 14:18:42,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2022-01-10 14:18:42,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 145. [2022-01-10 14:18:42,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 138 states have (on average 1.3768115942028984) internal successors, (190), 144 states have internal predecessors, (190), 0 states have call successors, (0), 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:42,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 190 transitions. [2022-01-10 14:18:42,365 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 190 transitions. Word has length 23 [2022-01-10 14:18:42,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:18:42,365 INFO L470 AbstractCegarLoop]: Abstraction has 145 states and 190 transitions. [2022-01-10 14:18:42,365 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 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:42,365 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 190 transitions. [2022-01-10 14:18:42,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-01-10 14:18:42,366 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:18:42,366 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] [2022-01-10 14:18:42,366 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-10 14:18:42,366 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-01-10 14:18:42,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:18:42,366 INFO L85 PathProgramCache]: Analyzing trace with hash 1641788225, now seen corresponding path program 1 times [2022-01-10 14:18:42,367 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:18:42,367 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553265141] [2022-01-10 14:18:42,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:18:42,367 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:18:42,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:18:42,599 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:42,599 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:18:42,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553265141] [2022-01-10 14:18:42,599 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553265141] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:18:42,599 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:18:42,599 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-10 14:18:42,600 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830141643] [2022-01-10 14:18:42,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:18:42,600 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 14:18:42,601 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:18:42,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 14:18:42,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-01-10 14:18:42,602 INFO L87 Difference]: Start difference. First operand 145 states and 190 transitions. Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 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:42,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:18:42,904 INFO L93 Difference]: Finished difference Result 215 states and 277 transitions. [2022-01-10 14:18:42,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-10 14:18:42,905 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 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 23 [2022-01-10 14:18:42,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:18:42,905 INFO L225 Difference]: With dead ends: 215 [2022-01-10 14:18:42,905 INFO L226 Difference]: Without dead ends: 211 [2022-01-10 14:18:42,906 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2022-01-10 14:18:42,906 INFO L933 BasicCegarLoop]: 134 mSDtfsCounter, 319 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 319 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 14:18:42,906 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [319 Valid, 392 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-10 14:18:42,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2022-01-10 14:18:42,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 147. [2022-01-10 14:18:42,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 140 states have (on average 1.3785714285714286) internal successors, (193), 146 states have internal predecessors, (193), 0 states have call successors, (0), 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:42,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 193 transitions. [2022-01-10 14:18:42,917 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 193 transitions. Word has length 23 [2022-01-10 14:18:42,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:18:42,917 INFO L470 AbstractCegarLoop]: Abstraction has 147 states and 193 transitions. [2022-01-10 14:18:42,917 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 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:42,918 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 193 transitions. [2022-01-10 14:18:42,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-01-10 14:18:42,918 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:18:42,918 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] [2022-01-10 14:18:42,918 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-10 14:18:42,918 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-01-10 14:18:42,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:18:42,919 INFO L85 PathProgramCache]: Analyzing trace with hash 1641818016, now seen corresponding path program 1 times [2022-01-10 14:18:42,919 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:18:42,919 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371724600] [2022-01-10 14:18:42,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:18:42,919 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:18:42,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:18:43,050 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:43,050 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:18:43,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371724600] [2022-01-10 14:18:43,050 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [371724600] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:18:43,050 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:18:43,050 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-10 14:18:43,050 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601167175] [2022-01-10 14:18:43,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:18:43,051 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-10 14:18:43,051 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:18:43,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-10 14:18:43,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-01-10 14:18:43,051 INFO L87 Difference]: Start difference. First operand 147 states and 193 transitions. Second operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 0 states have call successors, (0), 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:43,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:18:43,306 INFO L93 Difference]: Finished difference Result 158 states and 209 transitions. [2022-01-10 14:18:43,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-10 14:18:43,306 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 0 states have call successors, (0), 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 23 [2022-01-10 14:18:43,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:18:43,307 INFO L225 Difference]: With dead ends: 158 [2022-01-10 14:18:43,307 INFO L226 Difference]: Without dead ends: 154 [2022-01-10 14:18:43,307 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2022-01-10 14:18:43,308 INFO L933 BasicCegarLoop]: 97 mSDtfsCounter, 247 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 14:18:43,308 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [247 Valid, 362 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-10 14:18:43,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2022-01-10 14:18:43,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 139. [2022-01-10 14:18:43,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 134 states have (on average 1.3656716417910448) internal successors, (183), 138 states have internal predecessors, (183), 0 states have call successors, (0), 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:43,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 183 transitions. [2022-01-10 14:18:43,321 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 183 transitions. Word has length 23 [2022-01-10 14:18:43,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:18:43,322 INFO L470 AbstractCegarLoop]: Abstraction has 139 states and 183 transitions. [2022-01-10 14:18:43,322 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 0 states have call successors, (0), 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:43,322 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 183 transitions. [2022-01-10 14:18:43,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-01-10 14:18:43,322 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:18:43,322 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] [2022-01-10 14:18:43,322 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-10 14:18:43,323 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-01-10 14:18:43,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:18:43,323 INFO L85 PathProgramCache]: Analyzing trace with hash 919736876, now seen corresponding path program 1 times [2022-01-10 14:18:43,323 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:18:43,323 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98590379] [2022-01-10 14:18:43,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:18:43,323 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:18:43,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:18:43,393 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:43,394 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:18:43,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98590379] [2022-01-10 14:18:43,394 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98590379] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:18:43,394 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:18:43,394 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-10 14:18:43,394 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535789074] [2022-01-10 14:18:43,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:18:43,394 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-10 14:18:43,394 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:18:43,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-10 14:18:43,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-01-10 14:18:43,395 INFO L87 Difference]: Start difference. First operand 139 states and 183 transitions. Second operand has 10 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 0 states have call successors, (0), 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:43,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:18:43,633 INFO L93 Difference]: Finished difference Result 204 states and 247 transitions. [2022-01-10 14:18:43,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-01-10 14:18:43,634 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 0 states have call successors, (0), 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 25 [2022-01-10 14:18:43,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:18:43,635 INFO L225 Difference]: With dead ends: 204 [2022-01-10 14:18:43,635 INFO L226 Difference]: Without dead ends: 199 [2022-01-10 14:18:43,635 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=135, Invalid=465, Unknown=0, NotChecked=0, Total=600 [2022-01-10 14:18:43,635 INFO L933 BasicCegarLoop]: 96 mSDtfsCounter, 160 mSDsluCounter, 768 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 864 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 14:18:43,636 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [160 Valid, 864 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 14:18:43,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2022-01-10 14:18:43,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 152. [2022-01-10 14:18:43,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 147 states have (on average 1.3401360544217686) internal successors, (197), 151 states have internal predecessors, (197), 0 states have call successors, (0), 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:43,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 197 transitions. [2022-01-10 14:18:43,652 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 197 transitions. Word has length 25 [2022-01-10 14:18:43,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:18:43,652 INFO L470 AbstractCegarLoop]: Abstraction has 152 states and 197 transitions. [2022-01-10 14:18:43,652 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 0 states have call successors, (0), 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:43,652 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 197 transitions. [2022-01-10 14:18:43,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-01-10 14:18:43,653 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:18:43,653 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] [2022-01-10 14:18:43,653 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-01-10 14:18:43,654 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-01-10 14:18:43,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:18:43,654 INFO L85 PathProgramCache]: Analyzing trace with hash 920660397, now seen corresponding path program 1 times [2022-01-10 14:18:43,654 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:18:43,654 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967316442] [2022-01-10 14:18:43,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:18:43,654 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:18:43,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:18:43,681 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:43,681 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:18:43,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967316442] [2022-01-10 14:18:43,682 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967316442] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:18:43,682 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:18:43,682 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 14:18:43,682 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520656530] [2022-01-10 14:18:43,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:18:43,682 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 14:18:43,682 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:18:43,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 14:18:43,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 14:18:43,682 INFO L87 Difference]: Start difference. First operand 152 states and 197 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 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:43,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:18:43,802 INFO L93 Difference]: Finished difference Result 169 states and 217 transitions. [2022-01-10 14:18:43,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-10 14:18:43,803 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 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 25 [2022-01-10 14:18:43,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:18:43,803 INFO L225 Difference]: With dead ends: 169 [2022-01-10 14:18:43,803 INFO L226 Difference]: Without dead ends: 150 [2022-01-10 14:18:43,804 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:43,804 INFO L933 BasicCegarLoop]: 119 mSDtfsCounter, 31 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 14:18:43,804 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 419 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 14:18:43,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2022-01-10 14:18:43,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 140. [2022-01-10 14:18:43,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 135 states have (on average 1.3407407407407408) internal successors, (181), 139 states have internal predecessors, (181), 0 states have call successors, (0), 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:43,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 181 transitions. [2022-01-10 14:18:43,817 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 181 transitions. Word has length 25 [2022-01-10 14:18:43,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:18:43,817 INFO L470 AbstractCegarLoop]: Abstraction has 140 states and 181 transitions. [2022-01-10 14:18:43,818 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 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:43,818 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 181 transitions. [2022-01-10 14:18:43,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-01-10 14:18:43,818 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:18:43,818 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] [2022-01-10 14:18:43,818 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-01-10 14:18:43,818 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-01-10 14:18:43,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:18:43,818 INFO L85 PathProgramCache]: Analyzing trace with hash 479769508, now seen corresponding path program 1 times [2022-01-10 14:18:43,819 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:18:43,819 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376059723] [2022-01-10 14:18:43,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:18:43,819 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:18:43,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:18:43,914 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:43,914 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:18:43,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376059723] [2022-01-10 14:18:43,914 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376059723] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:18:43,914 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:18:43,914 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-10 14:18:43,914 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440693684] [2022-01-10 14:18:43,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:18:43,915 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-10 14:18:43,915 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:18:43,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-10 14:18:43,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-01-10 14:18:43,915 INFO L87 Difference]: Start difference. First operand 140 states and 181 transitions. Second operand has 10 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 0 states have call successors, (0), 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:44,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:18:44,691 INFO L93 Difference]: Finished difference Result 322 states and 399 transitions. [2022-01-10 14:18:44,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-01-10 14:18:44,692 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 0 states have call successors, (0), 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 25 [2022-01-10 14:18:44,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:18:44,693 INFO L225 Difference]: With dead ends: 322 [2022-01-10 14:18:44,693 INFO L226 Difference]: Without dead ends: 320 [2022-01-10 14:18:44,693 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=117, Invalid=263, Unknown=0, NotChecked=0, Total=380 [2022-01-10 14:18:44,693 INFO L933 BasicCegarLoop]: 176 mSDtfsCounter, 461 mSDsluCounter, 1197 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 461 SdHoareTripleChecker+Valid, 1373 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-10 14:18:44,693 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [461 Valid, 1373 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-01-10 14:18:44,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2022-01-10 14:18:44,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 144. [2022-01-10 14:18:44,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 139 states have (on average 1.330935251798561) internal successors, (185), 143 states have internal predecessors, (185), 0 states have call successors, (0), 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:44,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 185 transitions. [2022-01-10 14:18:44,709 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 185 transitions. Word has length 25 [2022-01-10 14:18:44,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:18:44,709 INFO L470 AbstractCegarLoop]: Abstraction has 144 states and 185 transitions. [2022-01-10 14:18:44,709 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 0 states have call successors, (0), 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:44,709 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 185 transitions. [2022-01-10 14:18:44,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-01-10 14:18:44,710 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:18:44,710 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] [2022-01-10 14:18:44,710 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-01-10 14:18:44,710 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-01-10 14:18:44,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:18:44,710 INFO L85 PathProgramCache]: Analyzing trace with hash -629523014, now seen corresponding path program 1 times [2022-01-10 14:18:44,710 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:18:44,710 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339137046] [2022-01-10 14:18:44,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:18:44,711 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:18:44,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-10 14:18:44,752 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-01-10 14:18:44,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-10 14:18:44,808 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-01-10 14:18:44,809 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-01-10 14:18:44,809 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-01-10 14:18:44,810 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-01-10 14:18:44,811 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (4 of 7 remaining) [2022-01-10 14:18:44,811 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (3 of 7 remaining) [2022-01-10 14:18:44,811 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (2 of 7 remaining) [2022-01-10 14:18:44,811 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION (1 of 7 remaining) [2022-01-10 14:18:44,811 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-01-10 14:18:44,811 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-01-10 14:18:44,814 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 14:18:44,817 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2022-01-10 14:18:44,877 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 02:18:44 BasicIcfg [2022-01-10 14:18:44,877 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-10 14:18:44,878 INFO L158 Benchmark]: Toolchain (without parser) took 7831.80ms. Allocated memory was 179.3MB in the beginning and 300.9MB in the end (delta: 121.6MB). Free memory was 122.6MB in the beginning and 197.8MB in the end (delta: -75.2MB). Peak memory consumption was 46.8MB. Max. memory is 8.0GB. [2022-01-10 14:18:44,878 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 179.3MB. Free memory is still 138.9MB. There was no memory consumed. Max. memory is 8.0GB. [2022-01-10 14:18:44,879 INFO L158 Benchmark]: CACSL2BoogieTranslator took 253.07ms. Allocated memory was 179.3MB in the beginning and 250.6MB in the end (delta: 71.3MB). Free memory was 122.3MB in the beginning and 221.6MB in the end (delta: -99.2MB). Peak memory consumption was 11.8MB. Max. memory is 8.0GB. [2022-01-10 14:18:44,879 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.89ms. Allocated memory is still 250.6MB. Free memory was 221.6MB in the beginning and 219.0MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-01-10 14:18:44,879 INFO L158 Benchmark]: Boogie Preprocessor took 22.82ms. Allocated memory is still 250.6MB. Free memory was 219.0MB in the beginning and 216.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-01-10 14:18:44,879 INFO L158 Benchmark]: RCFGBuilder took 407.63ms. Allocated memory is still 250.6MB. Free memory was 216.9MB in the beginning and 199.1MB in the end (delta: 17.8MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. [2022-01-10 14:18:44,879 INFO L158 Benchmark]: IcfgTransformer took 103.73ms. Allocated memory is still 250.6MB. Free memory was 199.1MB in the beginning and 189.6MB in the end (delta: 9.4MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2022-01-10 14:18:44,880 INFO L158 Benchmark]: TraceAbstraction took 6977.95ms. Allocated memory was 250.6MB in the beginning and 300.9MB in the end (delta: 50.3MB). Free memory was 189.1MB in the beginning and 197.8MB in the end (delta: -8.8MB). Peak memory consumption was 42.6MB. Max. memory is 8.0GB. [2022-01-10 14:18:44,883 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.11ms. Allocated memory is still 179.3MB. Free memory is still 138.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 253.07ms. Allocated memory was 179.3MB in the beginning and 250.6MB in the end (delta: 71.3MB). Free memory was 122.3MB in the beginning and 221.6MB in the end (delta: -99.2MB). Peak memory consumption was 11.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 61.89ms. Allocated memory is still 250.6MB. Free memory was 221.6MB in the beginning and 219.0MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 22.82ms. Allocated memory is still 250.6MB. Free memory was 219.0MB in the beginning and 216.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 407.63ms. Allocated memory is still 250.6MB. Free memory was 216.9MB in the beginning and 199.1MB in the end (delta: 17.8MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. * IcfgTransformer took 103.73ms. Allocated memory is still 250.6MB. Free memory was 199.1MB in the beginning and 189.6MB in the end (delta: 9.4MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * TraceAbstraction took 6977.95ms. Allocated memory was 250.6MB in the beginning and 300.9MB in the end (delta: 50.3MB). Free memory was 189.1MB in the beginning and 197.8MB in the end (delta: -8.8MB). Peak memory consumption was 42.6MB. 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: 17]: 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: [L226] unsigned int a ; [L227] unsigned int ma = __VERIFIER_nondet_uint(); [L228] signed char ea = __VERIFIER_nondet_char(); [L229] unsigned int b ; [L230] unsigned int mb = __VERIFIER_nondet_uint(); [L231] signed char eb = __VERIFIER_nondet_char(); [L232] unsigned int r_add1 ; [L233] unsigned int r_add2 ; [L234] unsigned int zero ; [L235] int tmp ; [L236] int tmp___0 ; [L237] int __retres14 ; [L241] CALL, EXPR base2flt(0, 0) [L25] unsigned int res ; [L26] unsigned int __retres4 ; VAL [\old(e)=0, \old(m)=0, e=0, m=0] [L29] COND TRUE ! m [L30] __retres4 = 0U VAL [\old(e)=0, \old(m)=0, __retres4=0, e=0, m=0] [L80] return (__retres4); VAL [\old(e)=0, \old(m)=0, \result=0, __retres4=0, e=0, m=0] [L241] RET, EXPR base2flt(0, 0) [L241] zero = base2flt(0, 0) [L242] CALL, EXPR base2flt(ma, ea) [L25] unsigned int res ; [L26] unsigned int __retres4 ; VAL [\old(e)=127, \old(m)=33554432, e=127, m=33554432] [L29] COND FALSE !(! m) VAL [\old(e)=127, \old(m)=33554432, e=127, m=33554432] [L35] COND FALSE !(m < 1U << 24U) VAL [\old(e)=127, \old(m)=33554432, e=127, m=33554432] [L57] COND TRUE 1 VAL [\old(e)=127, \old(m)=33554432, e=127, m=33554432] [L59] COND TRUE m >= 1U << 25U VAL [\old(e)=127, \old(m)=33554432, e=127, m=33554432] [L64] COND TRUE e >= 127 [L65] __retres4 = 4294967295U VAL [\old(e)=127, \old(m)=33554432, __retres4=4294967295, e=127, m=33554432] [L80] return (__retres4); VAL [\old(e)=127, \old(m)=33554432, \result=-1, __retres4=4294967295, e=127, m=33554432] [L242] RET, EXPR base2flt(ma, ea) [L242] a = base2flt(ma, ea) [L243] CALL, EXPR base2flt(mb, eb) [L25] unsigned int res ; [L26] unsigned int __retres4 ; VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L29] COND FALSE !(! m) VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L35] COND FALSE !(m < 1U << 24U) VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L57] COND TRUE 1 VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L59] COND FALSE !(m >= 1U << 25U) VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L76] m = m & ~ (1U << 24U) [L77] res = m | ((unsigned int )(e + 128) << 24U) [L78] __retres4 = res VAL [\old(e)=0, \old(m)=16777216, __retres4=2164260864, e=0, m=16777216, res=2164260864] [L80] return (__retres4); VAL [\old(e)=0, \old(m)=16777216, \result=-2130706432, __retres4=2164260864, e=0, m=16777216, res=2164260864] [L243] RET, EXPR base2flt(mb, eb) [L243] b = base2flt(mb, eb) [L244] CALL addflt(a, b) [L84] unsigned int res ; [L85] unsigned int ma ; [L86] unsigned int mb ; [L87] unsigned int delta ; [L88] int ea ; [L89] int eb ; [L90] unsigned int tmp ; [L91] unsigned int __retres10 ; VAL [\old(a)=4294967295, \old(b)=2164260864, a=4294967295, b=2164260864] [L94] COND FALSE !(a < b) VAL [\old(a)=4294967295, \old(b)=2164260864, a=4294967295, b=2164260864] [L101] COND FALSE !(! b) [L108] ma = a & ((1U << 24U) - 1U) [L109] ea = (int )(a >> 24U) - 128 [L110] ma = ma | (1U << 24U) [L111] mb = b & ((1U << 24U) - 1U) [L112] eb = (int )(b >> 24U) - 128 [L113] mb = mb | (1U << 24U) [L114] CALL __VERIFIER_assert(ea >= eb) [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L114] RET __VERIFIER_assert(ea >= eb) [L115] delta = ea - eb [L116] CALL __VERIFIER_assert(delta < sizeof(mb) * 8) [L16] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L17] reach_error() VAL [\old(cond)=0, cond=0] - UnprovableResult [Line: 17]: 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: 17]: 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: 17]: 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: 17]: 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: 17]: 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: 17]: 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, 86 locations, 7 error locations. Started 1 CEGAR loops. OverallTime: 6.9s, OverallIterations: 18, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4926 SdHoareTripleChecker+Valid, 2.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4926 mSDsluCounter, 11521 SdHoareTripleChecker+Invalid, 2.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 9286 mSDsCounter, 363 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1892 IncrementalHoareTripleChecker+Invalid, 2255 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 363 mSolverCounterUnsat, 2235 mSDtfsCounter, 1892 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 258 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 208 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=152occurred in iteration=15, InterpolantAutomatonStates: 193, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 17 MinimizatonAttempts, 1479 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 394 NumberOfCodeBlocks, 394 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 352 ConstructedInterpolants, 0 QuantifiedInterpolants, 1039 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 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:44,904 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...