/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_SUM.epf -i ../../../trunk/examples/svcomp/ldv-regression/rule60_list2.c_1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-11 05:20:04,412 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-11 05:20:04,440 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-11 05:20:04,465 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-11 05:20:04,465 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-11 05:20:04,466 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-11 05:20:04,467 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-11 05:20:04,468 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-11 05:20:04,469 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-11 05:20:04,469 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-11 05:20:04,470 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-11 05:20:04,471 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-11 05:20:04,471 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-11 05:20:04,472 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-11 05:20:04,472 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-11 05:20:04,473 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-11 05:20:04,473 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-11 05:20:04,474 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-11 05:20:04,477 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-11 05:20:04,478 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-11 05:20:04,479 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-11 05:20:04,480 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-11 05:20:04,481 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-11 05:20:04,482 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-11 05:20:04,483 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-11 05:20:04,484 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-11 05:20:04,484 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-11 05:20:04,484 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-11 05:20:04,485 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-11 05:20:04,485 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-11 05:20:04,485 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-11 05:20:04,486 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-11 05:20:04,486 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-11 05:20:04,487 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-11 05:20:04,487 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-11 05:20:04,488 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-11 05:20:04,488 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-11 05:20:04,488 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-11 05:20:04,489 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-11 05:20:04,489 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-11 05:20:04,489 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-11 05:20:04,490 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_SUM.epf [2022-01-11 05:20:04,508 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-11 05:20:04,508 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-11 05:20:04,508 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-11 05:20:04,508 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-11 05:20:04,509 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-11 05:20:04,509 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-11 05:20:04,509 INFO L138 SettingsManager]: * Use SBE=true [2022-01-11 05:20:04,510 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-11 05:20:04,510 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-11 05:20:04,510 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-11 05:20:04,510 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-11 05:20:04,510 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-11 05:20:04,510 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-11 05:20:04,510 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-11 05:20:04,510 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-11 05:20:04,510 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-11 05:20:04,510 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-11 05:20:04,510 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-11 05:20:04,511 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-11 05:20:04,511 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-11 05:20:04,511 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-11 05:20:04,511 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-11 05:20:04,511 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-11 05:20:04,511 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-11 05:20:04,511 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-11 05:20:04,511 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-11 05:20:04,512 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-11 05:20:04,512 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-11 05:20:04,512 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-11 05:20:04,512 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-11 05:20:04,512 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-01-11 05:20:04,512 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-11 05:20:04,513 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-11 05:20:04,513 INFO L138 SettingsManager]: * TransformationType=BV_TO_INT_SUM 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-11 05:20:04,660 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-11 05:20:04,674 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-11 05:20:04,676 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-11 05:20:04,677 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-11 05:20:04,677 INFO L275 PluginConnector]: CDTParser initialized [2022-01-11 05:20:04,678 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-regression/rule60_list2.c_1.i [2022-01-11 05:20:04,742 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/07cf6dd3d/d4fdf155c25b41c3b46e4782a350ec6b/FLAG6cf9fa600 [2022-01-11 05:20:05,217 INFO L306 CDTParser]: Found 1 translation units. [2022-01-11 05:20:05,217 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-regression/rule60_list2.c_1.i [2022-01-11 05:20:05,229 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/07cf6dd3d/d4fdf155c25b41c3b46e4782a350ec6b/FLAG6cf9fa600 [2022-01-11 05:20:05,241 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/07cf6dd3d/d4fdf155c25b41c3b46e4782a350ec6b [2022-01-11 05:20:05,243 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-11 05:20:05,259 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-01-11 05:20:05,264 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-11 05:20:05,265 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-11 05:20:05,275 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-11 05:20:05,276 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 05:20:05" (1/1) ... [2022-01-11 05:20:05,277 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36d006f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:20:05, skipping insertion in model container [2022-01-11 05:20:05,277 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 05:20:05" (1/1) ... [2022-01-11 05:20:05,281 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-11 05:20:05,309 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-11 05:20:05,435 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-regression/rule60_list2.c_1.i[296,309] [2022-01-11 05:20:05,502 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-11 05:20:05,509 INFO L203 MainTranslator]: Completed pre-run [2022-01-11 05:20:05,516 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-regression/rule60_list2.c_1.i[296,309] [2022-01-11 05:20:05,532 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-11 05:20:05,552 INFO L208 MainTranslator]: Completed translation [2022-01-11 05:20:05,552 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:20:05 WrapperNode [2022-01-11 05:20:05,552 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-11 05:20:05,553 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-11 05:20:05,553 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-11 05:20:05,553 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-11 05:20:05,558 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:20:05" (1/1) ... [2022-01-11 05:20:05,567 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:20:05" (1/1) ... [2022-01-11 05:20:05,581 INFO L137 Inliner]: procedures = 127, calls = 20, calls flagged for inlining = 12, calls inlined = 17, statements flattened = 122 [2022-01-11 05:20:05,581 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-11 05:20:05,582 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-11 05:20:05,582 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-11 05:20:05,582 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-11 05:20:05,587 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:20:05" (1/1) ... [2022-01-11 05:20:05,587 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:20:05" (1/1) ... [2022-01-11 05:20:05,589 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:20:05" (1/1) ... [2022-01-11 05:20:05,589 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:20:05" (1/1) ... [2022-01-11 05:20:05,593 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:20:05" (1/1) ... [2022-01-11 05:20:05,594 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:20:05" (1/1) ... [2022-01-11 05:20:05,595 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:20:05" (1/1) ... [2022-01-11 05:20:05,597 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-11 05:20:05,598 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-11 05:20:05,598 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-11 05:20:05,598 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-11 05:20:05,611 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:20:05" (1/1) ... [2022-01-11 05:20:05,616 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-11 05:20:05,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 05:20:05,635 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-11 05:20:05,661 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-11 05:20:05,662 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-01-11 05:20:05,662 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-11 05:20:05,662 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-11 05:20:05,662 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-11 05:20:05,651 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-11 05:20:05,746 INFO L234 CfgBuilder]: Building ICFG [2022-01-11 05:20:05,747 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-11 05:20:05,947 INFO L275 CfgBuilder]: Performing block encoding [2022-01-11 05:20:05,953 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-11 05:20:05,954 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-01-11 05:20:05,955 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 05:20:05 BoogieIcfgContainer [2022-01-11 05:20:05,956 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-11 05:20:05,956 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-11 05:20:05,956 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-11 05:20:05,958 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-11 05:20:05,960 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 05:20:05" (1/1) ... [2022-01-11 05:20:06,062 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 11.01 05:20:06 BasicIcfg [2022-01-11 05:20:06,063 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-11 05:20:06,070 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-11 05:20:06,070 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-11 05:20:06,072 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-11 05:20:06,073 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.01 05:20:05" (1/4) ... [2022-01-11 05:20:06,073 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@da3e33c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 05:20:06, skipping insertion in model container [2022-01-11 05:20:06,073 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:20:05" (2/4) ... [2022-01-11 05:20:06,073 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@da3e33c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 05:20:06, skipping insertion in model container [2022-01-11 05:20:06,073 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 05:20:05" (3/4) ... [2022-01-11 05:20:06,074 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@da3e33c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.01 05:20:06, skipping insertion in model container [2022-01-11 05:20:06,074 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 11.01 05:20:06" (4/4) ... [2022-01-11 05:20:06,076 INFO L111 eAbstractionObserver]: Analyzing ICFG rule60_list2.c_1.iTransformedIcfg [2022-01-11 05:20:06,080 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-11 05:20:06,081 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2022-01-11 05:20:06,113 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-11 05:20:06,120 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-11 05:20:06,120 INFO L340 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-01-11 05:20:06,135 INFO L276 IsEmpty]: Start isEmpty. Operand has 49 states, 42 states have (on average 1.4761904761904763) internal successors, (62), 48 states have internal predecessors, (62), 0 states have call successors, (0), 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-11 05:20:06,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-01-11 05:20:06,138 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 05:20:06,139 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2022-01-11 05:20:06,139 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2022-01-11 05:20:06,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 05:20:06,143 INFO L85 PathProgramCache]: Analyzing trace with hash 5049636, now seen corresponding path program 1 times [2022-01-11 05:20:06,148 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 05:20:06,149 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464807204] [2022-01-11 05:20:06,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:20:06,149 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 05:20:06,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:20:06,382 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-11 05:20:06,383 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 05:20:06,383 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464807204] [2022-01-11 05:20:06,384 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464807204] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 05:20:06,384 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 05:20:06,384 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 05:20:06,386 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678130127] [2022-01-11 05:20:06,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 05:20:06,390 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 05:20:06,391 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 05:20:06,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 05:20:06,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 05:20:06,422 INFO L87 Difference]: Start difference. First operand has 49 states, 42 states have (on average 1.4761904761904763) internal successors, (62), 48 states have internal predecessors, (62), 0 states have call successors, (0), 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 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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-11 05:20:06,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 05:20:06,448 INFO L93 Difference]: Finished difference Result 85 states and 110 transitions. [2022-01-11 05:20:06,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 05:20:06,450 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 [2022-01-11 05:20:06,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 05:20:06,458 INFO L225 Difference]: With dead ends: 85 [2022-01-11 05:20:06,458 INFO L226 Difference]: Without dead ends: 33 [2022-01-11 05:20:06,460 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 05:20:06,463 INFO L933 BasicCegarLoop]: 44 mSDtfsCounter, 43 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 05:20:06,464 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [43 Valid, 45 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 05:20:06,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-01-11 05:20:06,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-01-11 05:20:06,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 29 states have (on average 1.3103448275862069) internal successors, (38), 32 states have internal predecessors, (38), 0 states have call successors, (0), 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-11 05:20:06,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2022-01-11 05:20:06,495 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 38 transitions. Word has length 4 [2022-01-11 05:20:06,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 05:20:06,496 INFO L470 AbstractCegarLoop]: Abstraction has 33 states and 38 transitions. [2022-01-11 05:20:06,496 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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-11 05:20:06,496 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2022-01-11 05:20:06,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-01-11 05:20:06,497 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 05:20:06,497 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 05:20:06,497 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-11 05:20:06,498 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2022-01-11 05:20:06,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 05:20:06,500 INFO L85 PathProgramCache]: Analyzing trace with hash 633139956, now seen corresponding path program 1 times [2022-01-11 05:20:06,500 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 05:20:06,501 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222120265] [2022-01-11 05:20:06,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:20:06,501 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 05:20:06,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:20:06,680 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-11 05:20:06,680 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 05:20:06,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222120265] [2022-01-11 05:20:06,681 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222120265] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 05:20:06,681 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 05:20:06,681 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-11 05:20:06,681 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729911348] [2022-01-11 05:20:06,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 05:20:06,682 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-11 05:20:06,682 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 05:20:06,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-11 05:20:06,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-11 05:20:06,683 INFO L87 Difference]: Start difference. First operand 33 states and 38 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-11 05:20:06,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 05:20:06,775 INFO L93 Difference]: Finished difference Result 58 states and 66 transitions. [2022-01-11 05:20:06,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-11 05:20:06,775 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-11 05:20:06,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 05:20:06,777 INFO L225 Difference]: With dead ends: 58 [2022-01-11 05:20:06,777 INFO L226 Difference]: Without dead ends: 35 [2022-01-11 05:20:06,780 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-11 05:20:06,782 INFO L933 BasicCegarLoop]: 34 mSDtfsCounter, 4 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 05:20:06,782 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 127 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 05:20:06,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-01-11 05:20:06,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2022-01-11 05:20:06,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 32 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 05:20:06,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2022-01-11 05:20:06,789 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 15 [2022-01-11 05:20:06,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 05:20:06,790 INFO L470 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2022-01-11 05:20:06,790 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-11 05:20:06,791 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2022-01-11 05:20:06,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-01-11 05:20:06,792 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 05:20:06,794 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 05:20:06,795 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-11 05:20:06,799 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2022-01-11 05:20:06,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 05:20:06,799 INFO L85 PathProgramCache]: Analyzing trace with hash 661769107, now seen corresponding path program 1 times [2022-01-11 05:20:06,799 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 05:20:06,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11661162] [2022-01-11 05:20:06,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:20:06,800 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 05:20:06,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:20:06,929 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-11 05:20:06,929 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 05:20:06,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11661162] [2022-01-11 05:20:06,929 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11661162] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 05:20:06,929 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 05:20:06,930 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-11 05:20:06,930 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654375318] [2022-01-11 05:20:06,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 05:20:06,930 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-11 05:20:06,930 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 05:20:06,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-11 05:20:06,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-11 05:20:06,931 INFO L87 Difference]: Start difference. First operand 33 states and 37 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-11 05:20:06,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 05:20:06,971 INFO L93 Difference]: Finished difference Result 61 states and 68 transitions. [2022-01-11 05:20:06,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-11 05:20:06,972 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-11 05:20:06,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 05:20:06,973 INFO L225 Difference]: With dead ends: 61 [2022-01-11 05:20:06,973 INFO L226 Difference]: Without dead ends: 33 [2022-01-11 05:20:06,975 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-01-11 05:20:06,978 INFO L933 BasicCegarLoop]: 35 mSDtfsCounter, 1 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 05:20:06,979 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 128 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 05:20:06,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-01-11 05:20:06,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-01-11 05:20:06,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 32 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 05:20:06,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2022-01-11 05:20:06,986 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 15 [2022-01-11 05:20:06,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 05:20:06,986 INFO L470 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2022-01-11 05:20:06,986 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-11 05:20:06,986 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2022-01-11 05:20:06,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-01-11 05:20:06,987 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 05:20:06,987 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 05:20:06,987 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-11 05:20:06,988 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2022-01-11 05:20:06,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 05:20:06,989 INFO L85 PathProgramCache]: Analyzing trace with hash -1135182252, now seen corresponding path program 1 times [2022-01-11 05:20:06,989 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 05:20:06,989 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408058565] [2022-01-11 05:20:06,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:20:06,989 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 05:20:07,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:20:07,118 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-11 05:20:07,118 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 05:20:07,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408058565] [2022-01-11 05:20:07,119 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408058565] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 05:20:07,119 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 05:20:07,119 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-11 05:20:07,119 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019462340] [2022-01-11 05:20:07,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 05:20:07,119 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-11 05:20:07,120 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 05:20:07,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-11 05:20:07,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-01-11 05:20:07,121 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 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-11 05:20:07,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 05:20:07,248 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2022-01-11 05:20:07,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-11 05:20:07,248 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 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-11 05:20:07,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 05:20:07,249 INFO L225 Difference]: With dead ends: 49 [2022-01-11 05:20:07,249 INFO L226 Difference]: Without dead ends: 47 [2022-01-11 05:20:07,249 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2022-01-11 05:20:07,249 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 107 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 05:20:07,250 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [107 Valid, 86 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 05:20:07,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-01-11 05:20:07,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 31. [2022-01-11 05:20:07,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 30 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 05:20:07,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2022-01-11 05:20:07,253 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 15 [2022-01-11 05:20:07,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 05:20:07,253 INFO L470 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2022-01-11 05:20:07,253 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 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-11 05:20:07,254 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2022-01-11 05:20:07,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-01-11 05:20:07,254 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 05:20:07,254 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 05:20:07,254 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-11 05:20:07,254 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2022-01-11 05:20:07,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 05:20:07,255 INFO L85 PathProgramCache]: Analyzing trace with hash 357201238, now seen corresponding path program 1 times [2022-01-11 05:20:07,255 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 05:20:07,255 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886151003] [2022-01-11 05:20:07,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:20:07,255 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 05:20:07,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:20:07,466 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-11 05:20:07,466 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 05:20:07,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886151003] [2022-01-11 05:20:07,467 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886151003] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 05:20:07,467 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 05:20:07,467 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-01-11 05:20:07,467 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279502443] [2022-01-11 05:20:07,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 05:20:07,467 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-11 05:20:07,467 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 05:20:07,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-11 05:20:07,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2022-01-11 05:20:07,468 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand has 12 states, 12 states have (on average 1.5) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 05:20:07,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 05:20:07,861 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2022-01-11 05:20:07,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-11 05:20:07,862 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.5) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-01-11 05:20:07,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 05:20:07,862 INFO L225 Difference]: With dead ends: 45 [2022-01-11 05:20:07,862 INFO L226 Difference]: Without dead ends: 38 [2022-01-11 05:20:07,863 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2022-01-11 05:20:07,863 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 160 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 05:20:07,863 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [160 Valid, 80 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 05:20:07,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-01-11 05:20:07,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-01-11 05:20:07,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 35 states have (on average 1.2) internal successors, (42), 37 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 05:20:07,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2022-01-11 05:20:07,867 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 18 [2022-01-11 05:20:07,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 05:20:07,868 INFO L470 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2022-01-11 05:20:07,868 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.5) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 05:20:07,868 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2022-01-11 05:20:07,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-01-11 05:20:07,868 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 05:20:07,868 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 05:20:07,868 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-11 05:20:07,869 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2022-01-11 05:20:07,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 05:20:07,869 INFO L85 PathProgramCache]: Analyzing trace with hash 357231029, now seen corresponding path program 1 times [2022-01-11 05:20:07,869 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 05:20:07,869 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392336760] [2022-01-11 05:20:07,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:20:07,870 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 05:20:07,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:20:07,977 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-11 05:20:07,977 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 05:20:07,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392336760] [2022-01-11 05:20:07,978 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392336760] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 05:20:07,978 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 05:20:07,978 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-11 05:20:07,978 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938761452] [2022-01-11 05:20:07,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 05:20:07,978 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-11 05:20:07,978 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 05:20:07,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-11 05:20:07,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-01-11 05:20:07,979 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand has 9 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 05:20:08,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 05:20:08,129 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2022-01-11 05:20:08,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-11 05:20:08,130 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-01-11 05:20:08,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 05:20:08,130 INFO L225 Difference]: With dead ends: 49 [2022-01-11 05:20:08,130 INFO L226 Difference]: Without dead ends: 42 [2022-01-11 05:20:08,130 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2022-01-11 05:20:08,132 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 103 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 05:20:08,133 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [103 Valid, 80 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 05:20:08,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-01-11 05:20:08,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 38. [2022-01-11 05:20:08,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 36 states have (on average 1.1944444444444444) internal successors, (43), 37 states have internal predecessors, (43), 0 states have call successors, (0), 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-11 05:20:08,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2022-01-11 05:20:08,141 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 43 transitions. Word has length 18 [2022-01-11 05:20:08,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 05:20:08,142 INFO L470 AbstractCegarLoop]: Abstraction has 38 states and 43 transitions. [2022-01-11 05:20:08,142 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 05:20:08,142 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2022-01-11 05:20:08,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-01-11 05:20:08,143 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 05:20:08,143 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-11 05:20:08,143 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-11 05:20:08,143 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2022-01-11 05:20:08,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 05:20:08,144 INFO L85 PathProgramCache]: Analyzing trace with hash -1268989601, now seen corresponding path program 1 times [2022-01-11 05:20:08,144 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 05:20:08,144 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147240052] [2022-01-11 05:20:08,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:20:08,144 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 05:20:08,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:20:08,261 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-11 05:20:08,261 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 05:20:08,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147240052] [2022-01-11 05:20:08,262 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147240052] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 05:20:08,262 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 05:20:08,262 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-11 05:20:08,262 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53412763] [2022-01-11 05:20:08,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 05:20:08,263 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-11 05:20:08,263 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 05:20:08,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-11 05:20:08,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-01-11 05:20:08,264 INFO L87 Difference]: Start difference. First operand 38 states and 43 transitions. Second operand has 10 states, 10 states have (on average 2.3) 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-11 05:20:08,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 05:20:08,382 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2022-01-11 05:20:08,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-11 05:20:08,382 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.3) 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-11 05:20:08,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 05:20:08,384 INFO L225 Difference]: With dead ends: 49 [2022-01-11 05:20:08,385 INFO L226 Difference]: Without dead ends: 45 [2022-01-11 05:20:08,385 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=161, Unknown=0, NotChecked=0, Total=240 [2022-01-11 05:20:08,387 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 138 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 05:20:08,387 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [138 Valid, 45 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 05:20:08,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-01-11 05:20:08,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 40. [2022-01-11 05:20:08,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 38 states have (on average 1.1578947368421053) internal successors, (44), 39 states have internal predecessors, (44), 0 states have call successors, (0), 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-11 05:20:08,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2022-01-11 05:20:08,401 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 23 [2022-01-11 05:20:08,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 05:20:08,401 INFO L470 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2022-01-11 05:20:08,402 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.3) 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-11 05:20:08,402 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2022-01-11 05:20:08,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-01-11 05:20:08,402 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 05:20:08,402 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-11 05:20:08,403 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-11 05:20:08,404 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2022-01-11 05:20:08,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 05:20:08,404 INFO L85 PathProgramCache]: Analyzing trace with hash -1268959810, now seen corresponding path program 1 times [2022-01-11 05:20:08,404 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 05:20:08,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619001806] [2022-01-11 05:20:08,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:20:08,404 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 05:20:08,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:20:08,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-11 05:20:08,600 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 05:20:08,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619001806] [2022-01-11 05:20:08,600 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619001806] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 05:20:08,600 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 05:20:08,600 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-01-11 05:20:08,600 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095809845] [2022-01-11 05:20:08,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 05:20:08,601 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-11 05:20:08,601 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 05:20:08,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-11 05:20:08,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2022-01-11 05:20:08,601 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 12 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-11 05:20:08,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 05:20:08,906 INFO L93 Difference]: Finished difference Result 45 states and 48 transitions. [2022-01-11 05:20:08,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-11 05:20:08,907 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 12 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-11 05:20:08,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 05:20:08,907 INFO L225 Difference]: With dead ends: 45 [2022-01-11 05:20:08,907 INFO L226 Difference]: Without dead ends: 43 [2022-01-11 05:20:08,908 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2022-01-11 05:20:08,908 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 141 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 05:20:08,908 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [141 Valid, 74 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 05:20:08,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-01-11 05:20:08,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 38. [2022-01-11 05:20:08,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 36 states have (on average 1.1388888888888888) internal successors, (41), 37 states have internal predecessors, (41), 0 states have call successors, (0), 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-11 05:20:08,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2022-01-11 05:20:08,911 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 23 [2022-01-11 05:20:08,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 05:20:08,911 INFO L470 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2022-01-11 05:20:08,911 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 12 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-11 05:20:08,911 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2022-01-11 05:20:08,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-01-11 05:20:08,912 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 05:20:08,912 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-11 05:20:08,912 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-11 05:20:08,912 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2022-01-11 05:20:08,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 05:20:08,912 INFO L85 PathProgramCache]: Analyzing trace with hash -1240330659, now seen corresponding path program 1 times [2022-01-11 05:20:08,912 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 05:20:08,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049511181] [2022-01-11 05:20:08,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:20:08,913 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 05:20:08,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:20:09,040 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-11 05:20:09,041 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 05:20:09,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049511181] [2022-01-11 05:20:09,041 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049511181] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 05:20:09,041 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 05:20:09,041 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-11 05:20:09,041 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214716653] [2022-01-11 05:20:09,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 05:20:09,042 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-11 05:20:09,042 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 05:20:09,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-11 05:20:09,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-01-11 05:20:09,042 INFO L87 Difference]: Start difference. First operand 38 states and 41 transitions. Second operand has 10 states, 10 states have (on average 2.3) 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-11 05:20:09,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 05:20:09,177 INFO L93 Difference]: Finished difference Result 42 states and 44 transitions. [2022-01-11 05:20:09,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-11 05:20:09,177 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.3) 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-11 05:20:09,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 05:20:09,178 INFO L225 Difference]: With dead ends: 42 [2022-01-11 05:20:09,178 INFO L226 Difference]: Without dead ends: 38 [2022-01-11 05:20:09,178 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=182, Unknown=0, NotChecked=0, Total=272 [2022-01-11 05:20:09,180 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 138 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 05:20:09,180 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [138 Valid, 44 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 05:20:09,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-01-11 05:20:09,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-01-11 05:20:09,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 37 states have internal predecessors, (40), 0 states have call successors, (0), 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-11 05:20:09,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 40 transitions. [2022-01-11 05:20:09,183 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 40 transitions. Word has length 23 [2022-01-11 05:20:09,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 05:20:09,183 INFO L470 AbstractCegarLoop]: Abstraction has 38 states and 40 transitions. [2022-01-11 05:20:09,183 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.3) 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-11 05:20:09,183 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2022-01-11 05:20:09,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-01-11 05:20:09,184 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 05:20:09,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-11 05:20:09,184 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-11 05:20:09,184 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2022-01-11 05:20:09,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 05:20:09,184 INFO L85 PathProgramCache]: Analyzing trace with hash 1247182174, now seen corresponding path program 1 times [2022-01-11 05:20:09,184 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 05:20:09,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414389891] [2022-01-11 05:20:09,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:20:09,185 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 05:20:09,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:20:09,274 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-11 05:20:09,274 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 05:20:09,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414389891] [2022-01-11 05:20:09,274 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414389891] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 05:20:09,274 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 05:20:09,274 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-11 05:20:09,275 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367782531] [2022-01-11 05:20:09,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 05:20:09,275 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-11 05:20:09,275 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 05:20:09,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-11 05:20:09,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-01-11 05:20:09,275 INFO L87 Difference]: Start difference. First operand 38 states and 40 transitions. Second operand has 9 states, 9 states have (on average 2.5555555555555554) 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-11 05:20:09,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 05:20:09,400 INFO L93 Difference]: Finished difference Result 38 states and 40 transitions. [2022-01-11 05:20:09,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-11 05:20:09,401 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.5555555555555554) 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-11 05:20:09,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 05:20:09,401 INFO L225 Difference]: With dead ends: 38 [2022-01-11 05:20:09,401 INFO L226 Difference]: Without dead ends: 32 [2022-01-11 05:20:09,402 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2022-01-11 05:20:09,402 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 63 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 05:20:09,402 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [63 Valid, 68 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 05:20:09,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-01-11 05:20:09,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-01-11 05:20:09,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 1.096774193548387) internal successors, (34), 31 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 05:20:09,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2022-01-11 05:20:09,405 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 23 [2022-01-11 05:20:09,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 05:20:09,405 INFO L470 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2022-01-11 05:20:09,405 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.5555555555555554) 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-11 05:20:09,405 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2022-01-11 05:20:09,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-01-11 05:20:09,405 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 05:20:09,405 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 05:20:09,405 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-11 05:20:09,406 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2022-01-11 05:20:09,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 05:20:09,406 INFO L85 PathProgramCache]: Analyzing trace with hash -167832514, now seen corresponding path program 1 times [2022-01-11 05:20:09,406 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 05:20:09,406 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051656363] [2022-01-11 05:20:09,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:20:09,406 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 05:20:09,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:20:09,469 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-11 05:20:09,469 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 05:20:09,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051656363] [2022-01-11 05:20:09,469 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051656363] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 05:20:09,469 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 05:20:09,470 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-11 05:20:09,470 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288532063] [2022-01-11 05:20:09,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 05:20:09,470 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-11 05:20:09,470 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 05:20:09,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-11 05:20:09,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-01-11 05:20:09,471 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 05:20:09,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 05:20:09,536 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2022-01-11 05:20:09,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-11 05:20:09,536 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-01-11 05:20:09,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 05:20:09,536 INFO L225 Difference]: With dead ends: 39 [2022-01-11 05:20:09,536 INFO L226 Difference]: Without dead ends: 30 [2022-01-11 05:20:09,537 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2022-01-11 05:20:09,537 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 19 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 05:20:09,537 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 110 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 05:20:09,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-01-11 05:20:09,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 27. [2022-01-11 05:20:09,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 0 states have call successors, (0), 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-11 05:20:09,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2022-01-11 05:20:09,539 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 26 [2022-01-11 05:20:09,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 05:20:09,540 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2022-01-11 05:20:09,540 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 05:20:09,540 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2022-01-11 05:20:09,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-01-11 05:20:09,540 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 05:20:09,540 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 05:20:09,540 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-11 05:20:09,540 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2022-01-11 05:20:09,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 05:20:09,541 INFO L85 PathProgramCache]: Analyzing trace with hash 719671167, now seen corresponding path program 1 times [2022-01-11 05:20:09,541 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 05:20:09,541 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250207085] [2022-01-11 05:20:09,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:20:09,541 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 05:20:09,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-11 05:20:09,583 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-01-11 05:20:09,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-11 05:20:09,617 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-01-11 05:20:09,618 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-01-11 05:20:09,618 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-01-11 05:20:09,619 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-01-11 05:20:09,620 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (3 of 6 remaining) [2022-01-11 05:20:09,620 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2022-01-11 05:20:09,620 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2022-01-11 05:20:09,620 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-01-11 05:20:09,620 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-11 05:20:09,622 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 05:20:09,624 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2022-01-11 05:20:09,664 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.01 05:20:09 BasicIcfg [2022-01-11 05:20:09,664 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-11 05:20:09,664 INFO L158 Benchmark]: Toolchain (without parser) took 4405.45ms. Allocated memory was 197.1MB in the beginning and 317.7MB in the end (delta: 120.6MB). Free memory was 171.2MB in the beginning and 258.0MB in the end (delta: -86.7MB). Peak memory consumption was 33.7MB. Max. memory is 8.0GB. [2022-01-11 05:20:09,664 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 197.1MB. Free memory is still 158.5MB. There was no memory consumed. Max. memory is 8.0GB. [2022-01-11 05:20:09,664 INFO L158 Benchmark]: CACSL2BoogieTranslator took 288.11ms. Allocated memory was 197.1MB in the beginning and 317.7MB in the end (delta: 120.6MB). Free memory was 171.2MB in the beginning and 283.3MB in the end (delta: -112.1MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-01-11 05:20:09,665 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.03ms. Allocated memory is still 317.7MB. Free memory was 283.3MB in the beginning and 281.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-01-11 05:20:09,665 INFO L158 Benchmark]: Boogie Preprocessor took 15.52ms. Allocated memory is still 317.7MB. Free memory was 281.2MB in the beginning and 279.7MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-01-11 05:20:09,665 INFO L158 Benchmark]: RCFGBuilder took 357.91ms. Allocated memory is still 317.7MB. Free memory was 279.7MB in the beginning and 264.4MB in the end (delta: 15.2MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2022-01-11 05:20:09,665 INFO L158 Benchmark]: IcfgTransformer took 106.47ms. Allocated memory is still 317.7MB. Free memory was 264.4MB in the beginning and 258.7MB in the end (delta: 5.8MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. [2022-01-11 05:20:09,665 INFO L158 Benchmark]: TraceAbstraction took 3594.04ms. Allocated memory is still 317.7MB. Free memory was 258.2MB in the beginning and 258.0MB in the end (delta: 183.9kB). Peak memory consumption was 710.2kB. Max. memory is 8.0GB. [2022-01-11 05:20:09,666 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 197.1MB. Free memory is still 158.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 288.11ms. Allocated memory was 197.1MB in the beginning and 317.7MB in the end (delta: 120.6MB). Free memory was 171.2MB in the beginning and 283.3MB in the end (delta: -112.1MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 28.03ms. Allocated memory is still 317.7MB. Free memory was 283.3MB in the beginning and 281.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 15.52ms. Allocated memory is still 317.7MB. Free memory was 281.2MB in the beginning and 279.7MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 357.91ms. Allocated memory is still 317.7MB. Free memory was 279.7MB in the beginning and 264.4MB in the end (delta: 15.2MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * IcfgTransformer took 106.47ms. Allocated memory is still 317.7MB. Free memory was 264.4MB in the beginning and 258.7MB in the end (delta: 5.8MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. * TraceAbstraction took 3594.04ms. Allocated memory is still 317.7MB. Free memory was 258.2MB in the beginning and 258.0MB in the end (delta: 183.9kB). Peak memory consumption was 710.2kB. 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 - CounterExampleResult [Line: 6]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L519] void * guard_malloc_counter = 0; [L534] struct list_head *elem = ((void *)0); [L544] static struct list_head head; VAL [elem={0:0}, guard_malloc_counter={0:0}, head={-4:0}] [L546] struct list_head *dev1, *dev2; [L547] CALL, EXPR my_malloc(sizeof(*dev1)) [L529] CALL, EXPR __getMemory(size) [L522] (size > 0) ? (0) : __blast_assert () VAL [\old(size)=16, elem={0:0}, guard_malloc_counter={0:0}, head={-4:0}, size=16] [L523] guard_malloc_counter++ VAL [\old(size)=16, elem={0:0}, guard_malloc_counter={0:-1}, head={-4:0}, size=16] [L524] COND FALSE !(!__VERIFIER_nondet_int()) [L526] return (void *) guard_malloc_counter; VAL [\old(size)=16, \result={0:-1}, elem={0:0}, guard_malloc_counter={0:-1}, head={-4:0}, size=16] [L529] RET, EXPR __getMemory(size) [L529] return __getMemory(size); [L547] RET, EXPR my_malloc(sizeof(*dev1)) [L547] dev1 = my_malloc(sizeof(*dev1)) [L548] CALL, EXPR my_malloc(sizeof(*dev2)) [L529] CALL, EXPR __getMemory(size) [L522] (size > 0) ? (0) : __blast_assert () VAL [\old(size)=16, elem={0:0}, guard_malloc_counter={0:-1}, head={-4:0}, size=16] [L523] guard_malloc_counter++ VAL [\old(size)=16, elem={0:0}, guard_malloc_counter={0:-2}, head={-4:0}, size=16] [L524] COND FALSE !(!__VERIFIER_nondet_int()) [L526] return (void *) guard_malloc_counter; VAL [\old(size)=16, \result={0:-2}, elem={0:0}, guard_malloc_counter={0:-2}, head={-4:0}, size=16] [L529] RET, EXPR __getMemory(size) [L529] return __getMemory(size); [L548] RET, EXPR my_malloc(sizeof(*dev2)) [L548] dev2 = my_malloc(sizeof(*dev2)) [L549] COND TRUE dev1!=((void *)0) && dev2!=((void *)0) [L550] CALL list_add(dev2, &head) [L536] (new!=elem) ? (0) : __blast_assert () VAL [elem={0:0}, guard_malloc_counter={0:-2}, head={-4:0}, head={-4:0}, head={-4:0}, new={0:-2}, new={0:-2}] [L537] COND TRUE __VERIFIER_nondet_int() [L538] elem = new VAL [elem={0:-2}, guard_malloc_counter={0:-2}, head={-4:0}, head={-4:0}, head={-4:0}, new={0:-2}, new={0:-2}] [L550] RET list_add(dev2, &head) [L551] CALL list_add(dev1, &head) [L536] (new!=elem) ? (0) : __blast_assert () VAL [elem={0:-2}, guard_malloc_counter={0:-2}, head={-4:0}, head={-4:0}, head={-4:0}, new={0:-1}, new={0:-1}] [L537] COND TRUE __VERIFIER_nondet_int() [L538] elem = new VAL [elem={0:-1}, guard_malloc_counter={0:-2}, head={-4:0}, head={-4:0}, head={-4:0}, new={0:-1}, new={0:-1}] [L551] RET list_add(dev1, &head) [L552] CALL list_del(dev2) [L541] COND FALSE !(entry==elem) VAL [elem={0:-1}, entry={0:-2}, entry={0:-2}, guard_malloc_counter={0:-2}, head={-4:0}] [L552] RET list_del(dev2) [L553] CALL list_add(dev2, &head) [L536] (new!=elem) ? (0) : __blast_assert () VAL [elem={0:-1}, guard_malloc_counter={0:-2}, head={-4:0}, head={-4:0}, head={-4:0}, new={0:-2}, new={0:-2}] [L537] COND FALSE !(__VERIFIER_nondet_int()) [L553] RET list_add(dev2, &head) [L554] CALL list_add(dev1, &head) [L536] (new!=elem) ? (0) : __blast_assert () [L536] CALL __blast_assert () [L6] reach_error() VAL [elem={0:-1}, guard_malloc_counter={0:-2}, head={-4:0}] - UnprovableResult [Line: 6]: 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: 6]: 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: 6]: 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: 6]: 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: 6]: 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, 49 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 3.5s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 917 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 917 mSDsluCounter, 887 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 609 mSDsCounter, 113 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 927 IncrementalHoareTripleChecker+Invalid, 1040 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 113 mSolverCounterUnsat, 278 mSDtfsCounter, 927 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 141 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=49occurred in iteration=0, InterpolantAutomatonStates: 91, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 35 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 229 NumberOfCodeBlocks, 229 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 192 ConstructedInterpolants, 0 QuantifiedInterpolants, 1370 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-01-11 05:20:09,703 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...