/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/verifythis/tree_del_rec.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-11 06:03:22,642 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-11 06:03:22,644 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-11 06:03:22,687 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-11 06:03:22,688 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-11 06:03:22,689 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-11 06:03:22,690 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-11 06:03:22,691 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-11 06:03:22,693 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-11 06:03:22,694 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-11 06:03:22,694 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-11 06:03:22,717 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-11 06:03:22,717 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-11 06:03:22,720 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-11 06:03:22,720 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-11 06:03:22,721 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-11 06:03:22,722 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-11 06:03:22,723 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-11 06:03:22,724 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-11 06:03:22,725 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-11 06:03:22,727 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-11 06:03:22,735 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-11 06:03:22,738 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-11 06:03:22,739 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-11 06:03:22,744 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-11 06:03:22,745 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-11 06:03:22,745 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-11 06:03:22,745 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-11 06:03:22,746 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-11 06:03:22,746 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-11 06:03:22,747 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-11 06:03:22,747 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-11 06:03:22,748 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-11 06:03:22,748 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-11 06:03:22,749 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-11 06:03:22,749 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-11 06:03:22,750 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-11 06:03:22,750 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-11 06:03:22,750 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-11 06:03:22,751 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-11 06:03:22,751 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-11 06:03:22,760 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 06:03:22,786 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-11 06:03:22,787 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-11 06:03:22,787 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-11 06:03:22,787 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-11 06:03:22,788 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-11 06:03:22,788 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-11 06:03:22,789 INFO L138 SettingsManager]: * Use SBE=true [2022-01-11 06:03:22,789 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-11 06:03:22,789 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-11 06:03:22,789 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-11 06:03:22,790 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-11 06:03:22,790 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-11 06:03:22,790 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-11 06:03:22,790 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-11 06:03:22,790 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-11 06:03:22,790 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-11 06:03:22,790 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-11 06:03:22,790 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-11 06:03:22,791 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-11 06:03:22,791 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-11 06:03:22,791 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-11 06:03:22,792 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-11 06:03:22,792 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-11 06:03:22,792 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-11 06:03:22,792 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-11 06:03:22,792 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-11 06:03:22,793 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-11 06:03:22,793 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-11 06:03:22,793 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-11 06:03:22,793 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-11 06:03:22,793 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-01-11 06:03:22,793 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-11 06:03:22,795 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-11 06:03:22,795 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 06:03:23,042 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-11 06:03:23,065 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-11 06:03:23,067 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-11 06:03:23,068 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-11 06:03:23,069 INFO L275 PluginConnector]: CDTParser initialized [2022-01-11 06:03:23,070 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/verifythis/tree_del_rec.c [2022-01-11 06:03:23,132 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a4d505b9/bdc3743a5df9446baec7bb1486e11fd2/FLAG6d5f7fd90 [2022-01-11 06:03:23,549 INFO L306 CDTParser]: Found 1 translation units. [2022-01-11 06:03:23,550 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/verifythis/tree_del_rec.c [2022-01-11 06:03:23,560 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a4d505b9/bdc3743a5df9446baec7bb1486e11fd2/FLAG6d5f7fd90 [2022-01-11 06:03:23,577 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a4d505b9/bdc3743a5df9446baec7bb1486e11fd2 [2022-01-11 06:03:23,580 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-11 06:03:23,583 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-01-11 06:03:23,593 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-11 06:03:23,593 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-11 06:03:23,596 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-11 06:03:23,596 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 06:03:23" (1/1) ... [2022-01-11 06:03:23,597 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6292e7c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 06:03:23, skipping insertion in model container [2022-01-11 06:03:23,597 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 06:03:23" (1/1) ... [2022-01-11 06:03:23,604 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-11 06:03:23,624 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-11 06:03:23,844 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/verifythis/tree_del_rec.c[585,598] [2022-01-11 06:03:23,862 WARN L1533 CHandler]: Possible shadowing of function min [2022-01-11 06:03:23,866 WARN L1533 CHandler]: Possible shadowing of function min [2022-01-11 06:03:23,898 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-11 06:03:23,914 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-01-11 06:03:23,924 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-11 06:03:23,933 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/verifythis/tree_del_rec.c[585,598] [2022-01-11 06:03:23,942 WARN L1533 CHandler]: Possible shadowing of function min [2022-01-11 06:03:23,946 WARN L1533 CHandler]: Possible shadowing of function min [2022-01-11 06:03:23,957 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-11 06:03:23,965 INFO L203 MainTranslator]: Completed pre-run [2022-01-11 06:03:23,979 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/verifythis/tree_del_rec.c[585,598] [2022-01-11 06:03:23,991 WARN L1533 CHandler]: Possible shadowing of function min [2022-01-11 06:03:23,992 WARN L1533 CHandler]: Possible shadowing of function min [2022-01-11 06:03:24,000 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-11 06:03:24,014 INFO L208 MainTranslator]: Completed translation [2022-01-11 06:03:24,016 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 06:03:24 WrapperNode [2022-01-11 06:03:24,016 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-11 06:03:24,017 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-11 06:03:24,017 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-11 06:03:24,018 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-11 06:03:24,024 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 06:03:24" (1/1) ... [2022-01-11 06:03:24,036 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 06:03:24" (1/1) ... [2022-01-11 06:03:24,069 INFO L137 Inliner]: procedures = 31, calls = 61, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 95 [2022-01-11 06:03:24,070 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-11 06:03:24,071 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-11 06:03:24,071 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-11 06:03:24,071 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-11 06:03:24,079 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 06:03:24" (1/1) ... [2022-01-11 06:03:24,079 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 06:03:24" (1/1) ... [2022-01-11 06:03:24,101 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 06:03:24" (1/1) ... [2022-01-11 06:03:24,102 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 06:03:24" (1/1) ... [2022-01-11 06:03:24,110 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 06:03:24" (1/1) ... [2022-01-11 06:03:24,120 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 06:03:24" (1/1) ... [2022-01-11 06:03:24,122 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 06:03:24" (1/1) ... [2022-01-11 06:03:24,125 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-11 06:03:24,126 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-11 06:03:24,126 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-11 06:03:24,126 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-11 06:03:24,127 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 06:03:24" (1/1) ... [2022-01-11 06:03:24,142 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-11 06:03:24,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 06:03:24,172 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 06:03:24,174 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 06:03:24,205 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-11 06:03:24,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-11 06:03:24,205 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-11 06:03:24,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-01-11 06:03:24,205 INFO L130 BoogieDeclarations]: Found specification of procedure tree_del [2022-01-11 06:03:24,206 INFO L138 BoogieDeclarations]: Found implementation of procedure tree_del [2022-01-11 06:03:24,206 INFO L130 BoogieDeclarations]: Found specification of procedure min [2022-01-11 06:03:24,206 INFO L138 BoogieDeclarations]: Found implementation of procedure min [2022-01-11 06:03:24,206 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-01-11 06:03:24,206 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-01-11 06:03:24,206 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_tree [2022-01-11 06:03:24,206 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_tree [2022-01-11 06:03:24,206 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-01-11 06:03:24,206 INFO L130 BoogieDeclarations]: Found specification of procedure size [2022-01-11 06:03:24,207 INFO L138 BoogieDeclarations]: Found implementation of procedure size [2022-01-11 06:03:24,207 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-11 06:03:24,207 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-11 06:03:24,207 INFO L130 BoogieDeclarations]: Found specification of procedure tree_inorder [2022-01-11 06:03:24,207 INFO L138 BoogieDeclarations]: Found implementation of procedure tree_inorder [2022-01-11 06:03:24,207 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-11 06:03:24,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-01-11 06:03:24,320 INFO L234 CfgBuilder]: Building ICFG [2022-01-11 06:03:24,321 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-11 06:03:24,807 INFO L275 CfgBuilder]: Performing block encoding [2022-01-11 06:03:24,813 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-11 06:03:24,814 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-01-11 06:03:24,815 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 06:03:24 BoogieIcfgContainer [2022-01-11 06:03:24,817 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-11 06:03:24,818 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-11 06:03:24,818 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-11 06:03:24,819 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-11 06:03:24,822 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 06:03:24" (1/1) ... [2022-01-11 06:03:24,987 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 11.01 06:03:24 BasicIcfg [2022-01-11 06:03:24,987 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-11 06:03:24,989 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-11 06:03:24,989 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-11 06:03:24,992 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-11 06:03:24,992 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.01 06:03:23" (1/4) ... [2022-01-11 06:03:24,993 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60e2e79c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 06:03:24, skipping insertion in model container [2022-01-11 06:03:24,993 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 06:03:24" (2/4) ... [2022-01-11 06:03:24,993 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60e2e79c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 06:03:24, skipping insertion in model container [2022-01-11 06:03:24,993 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 06:03:24" (3/4) ... [2022-01-11 06:03:24,993 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60e2e79c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.01 06:03:24, skipping insertion in model container [2022-01-11 06:03:24,994 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 11.01 06:03:24" (4/4) ... [2022-01-11 06:03:24,994 INFO L111 eAbstractionObserver]: Analyzing ICFG tree_del_rec.cTransformedIcfg [2022-01-11 06:03:24,998 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-11 06:03:24,999 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2022-01-11 06:03:25,047 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-11 06:03:25,055 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 06:03:25,056 INFO L340 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-01-11 06:03:25,072 INFO L276 IsEmpty]: Start isEmpty. Operand has 85 states, 59 states have (on average 1.3728813559322033) internal successors, (81), 63 states have internal predecessors, (81), 16 states have call successors, (16), 5 states have call predecessors, (16), 5 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-01-11 06:03:25,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-01-11 06:03:25,079 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 06:03:25,080 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 06:03:25,080 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 06:03:25,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 06:03:25,085 INFO L85 PathProgramCache]: Analyzing trace with hash -1955774906, now seen corresponding path program 1 times [2022-01-11 06:03:25,091 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 06:03:25,091 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596493907] [2022-01-11 06:03:25,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 06:03:25,092 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 06:03:25,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 06:03:25,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-11 06:03:25,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 06:03:25,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-11 06:03:25,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 06:03:25,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-11 06:03:25,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 06:03:25,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-01-11 06:03:25,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 06:03:25,578 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 06:03:25,579 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 06:03:25,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596493907] [2022-01-11 06:03:25,580 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596493907] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 06:03:25,580 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 06:03:25,580 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-11 06:03:25,581 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180333146] [2022-01-11 06:03:25,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 06:03:25,586 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-11 06:03:25,587 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 06:03:25,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-11 06:03:25,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-01-11 06:03:25,618 INFO L87 Difference]: Start difference. First operand has 85 states, 59 states have (on average 1.3728813559322033) internal successors, (81), 63 states have internal predecessors, (81), 16 states have call successors, (16), 5 states have call predecessors, (16), 5 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-11 06:03:27,766 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-11 06:03:28,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 06:03:28,642 INFO L93 Difference]: Finished difference Result 152 states and 205 transitions. [2022-01-11 06:03:28,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-11 06:03:28,644 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 31 [2022-01-11 06:03:28,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 06:03:28,652 INFO L225 Difference]: With dead ends: 152 [2022-01-11 06:03:28,653 INFO L226 Difference]: Without dead ends: 86 [2022-01-11 06:03:28,655 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-01-11 06:03:28,658 INFO L933 BasicCegarLoop]: 89 mSDtfsCounter, 27 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-01-11 06:03:28,659 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 340 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2022-01-11 06:03:28,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-01-11 06:03:28,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 81. [2022-01-11 06:03:28,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 55 states have (on average 1.2363636363636363) internal successors, (68), 59 states have internal predecessors, (68), 16 states have call successors, (16), 5 states have call predecessors, (16), 6 states have return successors, (19), 16 states have call predecessors, (19), 16 states have call successors, (19) [2022-01-11 06:03:28,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 103 transitions. [2022-01-11 06:03:28,716 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 103 transitions. Word has length 31 [2022-01-11 06:03:28,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 06:03:28,718 INFO L470 AbstractCegarLoop]: Abstraction has 81 states and 103 transitions. [2022-01-11 06:03:28,718 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-11 06:03:28,718 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 103 transitions. [2022-01-11 06:03:28,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-01-11 06:03:28,721 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 06:03:28,721 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 06:03:28,722 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-11 06:03:28,722 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 06:03:28,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 06:03:28,722 INFO L85 PathProgramCache]: Analyzing trace with hash 450464511, now seen corresponding path program 1 times [2022-01-11 06:03:28,722 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 06:03:28,723 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584595445] [2022-01-11 06:03:28,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 06:03:28,723 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 06:03:28,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 06:03:28,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-11 06:03:28,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 06:03:28,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-11 06:03:28,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 06:03:28,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-11 06:03:28,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 06:03:29,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-11 06:03:29,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 06:03:29,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-01-11 06:03:29,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 06:03:29,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-01-11 06:03:29,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 06:03:29,126 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-01-11 06:03:29,127 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 06:03:29,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584595445] [2022-01-11 06:03:29,127 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [584595445] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-11 06:03:29,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1812878412] [2022-01-11 06:03:29,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 06:03:29,132 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 06:03:29,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 06:03:29,139 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-11 06:03:29,144 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-01-11 06:03:29,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 06:03:29,309 INFO L263 TraceCheckSpWp]: Trace formula consists of 520 conjuncts, 20 conjunts are in the unsatisfiable core [2022-01-11 06:03:29,314 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-11 06:03:29,762 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-01-11 06:03:29,763 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-11 06:03:30,205 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-01-11 06:03:30,205 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1812878412] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-11 06:03:30,205 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-11 06:03:30,206 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 7, 7] total 22 [2022-01-11 06:03:30,206 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139240922] [2022-01-11 06:03:30,207 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-11 06:03:30,208 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-01-11 06:03:30,208 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 06:03:30,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-01-11 06:03:30,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=408, Unknown=0, NotChecked=0, Total=462 [2022-01-11 06:03:30,210 INFO L87 Difference]: Start difference. First operand 81 states and 103 transitions. Second operand has 22 states, 21 states have (on average 2.380952380952381) internal successors, (50), 17 states have internal predecessors, (50), 9 states have call successors, (15), 4 states have call predecessors, (15), 8 states have return successors, (15), 10 states have call predecessors, (15), 9 states have call successors, (15) [2022-01-11 06:03:32,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 06:03:32,376 INFO L93 Difference]: Finished difference Result 157 states and 208 transitions. [2022-01-11 06:03:32,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-11 06:03:32,377 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.380952380952381) internal successors, (50), 17 states have internal predecessors, (50), 9 states have call successors, (15), 4 states have call predecessors, (15), 8 states have return successors, (15), 10 states have call predecessors, (15), 9 states have call successors, (15) Word has length 43 [2022-01-11 06:03:32,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 06:03:32,379 INFO L225 Difference]: With dead ends: 157 [2022-01-11 06:03:32,379 INFO L226 Difference]: Without dead ends: 88 [2022-01-11 06:03:32,380 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 86 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=106, Invalid=706, Unknown=0, NotChecked=0, Total=812 [2022-01-11 06:03:32,381 INFO L933 BasicCegarLoop]: 78 mSDtfsCounter, 119 mSDsluCounter, 626 mSDsCounter, 0 mSdLazyCounter, 587 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 704 SdHoareTripleChecker+Invalid, 675 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 587 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-01-11 06:03:32,382 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [119 Valid, 704 Invalid, 675 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 587 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-01-11 06:03:32,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-01-11 06:03:32,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 83. [2022-01-11 06:03:32,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 56 states have (on average 1.2321428571428572) internal successors, (69), 61 states have internal predecessors, (69), 16 states have call successors, (16), 5 states have call predecessors, (16), 7 states have return successors, (21), 16 states have call predecessors, (21), 16 states have call successors, (21) [2022-01-11 06:03:32,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 106 transitions. [2022-01-11 06:03:32,394 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 106 transitions. Word has length 43 [2022-01-11 06:03:32,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 06:03:32,394 INFO L470 AbstractCegarLoop]: Abstraction has 83 states and 106 transitions. [2022-01-11 06:03:32,394 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.380952380952381) internal successors, (50), 17 states have internal predecessors, (50), 9 states have call successors, (15), 4 states have call predecessors, (15), 8 states have return successors, (15), 10 states have call predecessors, (15), 9 states have call successors, (15) [2022-01-11 06:03:32,394 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 106 transitions. [2022-01-11 06:03:32,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-01-11 06:03:32,396 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 06:03:32,396 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 06:03:32,424 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-01-11 06:03:32,614 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 06:03:32,614 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 06:03:32,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 06:03:32,615 INFO L85 PathProgramCache]: Analyzing trace with hash 1332151603, now seen corresponding path program 1 times [2022-01-11 06:03:32,615 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 06:03:32,615 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437677107] [2022-01-11 06:03:32,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 06:03:32,615 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 06:03:32,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 06:03:32,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-11 06:03:32,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 06:03:32,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-11 06:03:32,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 06:03:32,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-11 06:03:32,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 06:03:32,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-11 06:03:32,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 06:03:32,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-01-11 06:03:32,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 06:03:32,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-11 06:03:32,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 06:03:32,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-01-11 06:03:32,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 06:03:32,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-01-11 06:03:32,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 06:03:32,853 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-01-11 06:03:32,854 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 06:03:32,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437677107] [2022-01-11 06:03:32,857 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437677107] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 06:03:32,857 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 06:03:32,857 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-11 06:03:32,857 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588899364] [2022-01-11 06:03:32,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 06:03:32,858 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-11 06:03:32,858 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 06:03:32,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-11 06:03:32,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-01-11 06:03:32,859 INFO L87 Difference]: Start difference. First operand 83 states and 106 transitions. Second operand has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 7 states have internal predecessors, (30), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-01-11 06:03:35,709 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-11 06:03:35,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 06:03:35,802 INFO L93 Difference]: Finished difference Result 147 states and 189 transitions. [2022-01-11 06:03:35,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-11 06:03:35,803 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 7 states have internal predecessors, (30), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 53 [2022-01-11 06:03:35,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 06:03:35,804 INFO L225 Difference]: With dead ends: 147 [2022-01-11 06:03:35,804 INFO L226 Difference]: Without dead ends: 88 [2022-01-11 06:03:35,805 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2022-01-11 06:03:35,806 INFO L933 BasicCegarLoop]: 82 mSDtfsCounter, 102 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-01-11 06:03:35,806 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [104 Valid, 407 Invalid, 364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2022-01-11 06:03:35,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-01-11 06:03:35,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 85. [2022-01-11 06:03:35,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 57 states have (on average 1.2280701754385965) internal successors, (70), 63 states have internal predecessors, (70), 16 states have call successors, (16), 5 states have call predecessors, (16), 8 states have return successors, (23), 16 states have call predecessors, (23), 16 states have call successors, (23) [2022-01-11 06:03:35,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 109 transitions. [2022-01-11 06:03:35,816 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 109 transitions. Word has length 53 [2022-01-11 06:03:35,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 06:03:35,817 INFO L470 AbstractCegarLoop]: Abstraction has 85 states and 109 transitions. [2022-01-11 06:03:35,817 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 7 states have internal predecessors, (30), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-01-11 06:03:35,817 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 109 transitions. [2022-01-11 06:03:35,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-01-11 06:03:35,819 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 06:03:35,819 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 06:03:35,819 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-11 06:03:35,819 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 06:03:35,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 06:03:35,820 INFO L85 PathProgramCache]: Analyzing trace with hash 1240211948, now seen corresponding path program 1 times [2022-01-11 06:03:35,820 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 06:03:35,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309353746] [2022-01-11 06:03:35,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 06:03:35,820 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 06:03:35,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 06:03:35,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-11 06:03:35,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 06:03:35,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-11 06:03:35,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 06:03:35,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-11 06:03:35,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 06:03:35,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-11 06:03:36,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 06:03:36,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-11 06:03:36,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 06:03:36,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-01-11 06:03:36,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 06:03:36,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-01-11 06:03:36,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 06:03:36,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-11 06:03:36,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 06:03:36,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-01-11 06:03:36,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 06:03:36,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-01-11 06:03:36,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 06:03:36,072 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-01-11 06:03:36,072 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 06:03:36,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309353746] [2022-01-11 06:03:36,072 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309353746] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 06:03:36,072 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 06:03:36,073 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-11 06:03:36,073 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891071764] [2022-01-11 06:03:36,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 06:03:36,080 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-11 06:03:36,081 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 06:03:36,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-11 06:03:36,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-01-11 06:03:36,081 INFO L87 Difference]: Start difference. First operand 85 states and 109 transitions. Second operand has 10 states, 10 states have (on average 3.4) internal successors, (34), 7 states have internal predecessors, (34), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 5 states have call predecessors, (10), 3 states have call successors, (10) [2022-01-11 06:03:38,181 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.89s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-11 06:03:38,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 06:03:38,767 INFO L93 Difference]: Finished difference Result 139 states and 177 transitions. [2022-01-11 06:03:38,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-11 06:03:38,769 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.4) internal successors, (34), 7 states have internal predecessors, (34), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 5 states have call predecessors, (10), 3 states have call successors, (10) Word has length 66 [2022-01-11 06:03:38,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 06:03:38,770 INFO L225 Difference]: With dead ends: 139 [2022-01-11 06:03:38,770 INFO L226 Difference]: Without dead ends: 88 [2022-01-11 06:03:38,771 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2022-01-11 06:03:38,772 INFO L933 BasicCegarLoop]: 80 mSDtfsCounter, 115 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-01-11 06:03:38,772 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [121 Valid, 367 Invalid, 356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2022-01-11 06:03:38,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-01-11 06:03:38,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 87. [2022-01-11 06:03:38,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 58 states have (on average 1.2241379310344827) internal successors, (71), 65 states have internal predecessors, (71), 16 states have call successors, (16), 5 states have call predecessors, (16), 9 states have return successors, (25), 16 states have call predecessors, (25), 16 states have call successors, (25) [2022-01-11 06:03:38,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 112 transitions. [2022-01-11 06:03:38,784 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 112 transitions. Word has length 66 [2022-01-11 06:03:38,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 06:03:38,786 INFO L470 AbstractCegarLoop]: Abstraction has 87 states and 112 transitions. [2022-01-11 06:03:38,786 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.4) internal successors, (34), 7 states have internal predecessors, (34), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 5 states have call predecessors, (10), 3 states have call successors, (10) [2022-01-11 06:03:38,786 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 112 transitions. [2022-01-11 06:03:38,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-01-11 06:03:38,788 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 06:03:38,789 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 06:03:38,789 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-11 06:03:38,789 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 06:03:38,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 06:03:38,789 INFO L85 PathProgramCache]: Analyzing trace with hash -1600448234, now seen corresponding path program 1 times [2022-01-11 06:03:38,790 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 06:03:38,790 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137149702] [2022-01-11 06:03:38,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 06:03:38,790 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 06:03:38,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 06:03:39,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-11 06:03:39,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 06:03:39,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-11 06:03:39,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 06:03:39,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-11 06:03:39,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 06:03:39,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-11 06:03:39,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 06:03:39,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-11 06:03:39,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 06:03:39,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-01-11 06:03:39,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 06:03:39,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-01-11 06:03:39,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 06:03:39,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-11 06:03:39,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 06:03:39,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-01-11 06:03:39,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 06:03:39,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-01-11 06:03:39,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 06:03:39,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-11 06:03:39,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 06:03:39,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-01-11 06:03:39,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 06:03:39,164 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-01-11 06:03:39,164 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 06:03:39,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137149702] [2022-01-11 06:03:39,164 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137149702] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 06:03:39,164 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 06:03:39,164 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-11 06:03:39,165 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300005180] [2022-01-11 06:03:39,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 06:03:39,165 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-11 06:03:39,165 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 06:03:39,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-11 06:03:39,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-01-11 06:03:39,166 INFO L87 Difference]: Start difference. First operand 87 states and 112 transitions. Second operand has 8 states, 8 states have (on average 4.5) internal successors, (36), 5 states have internal predecessors, (36), 2 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 2 states have call successors, (12) [2022-01-11 06:03:41,320 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-11 06:03:41,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 06:03:41,609 INFO L93 Difference]: Finished difference Result 145 states and 185 transitions. [2022-01-11 06:03:41,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-11 06:03:41,611 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 5 states have internal predecessors, (36), 2 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 2 states have call successors, (12) Word has length 78 [2022-01-11 06:03:41,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 06:03:41,612 INFO L225 Difference]: With dead ends: 145 [2022-01-11 06:03:41,612 INFO L226 Difference]: Without dead ends: 90 [2022-01-11 06:03:41,613 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-01-11 06:03:41,614 INFO L933 BasicCegarLoop]: 77 mSDtfsCounter, 106 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 43 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-01-11 06:03:41,614 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [114 Valid, 204 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 144 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-01-11 06:03:41,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-01-11 06:03:41,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 89. [2022-01-11 06:03:41,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 60 states have (on average 1.2166666666666666) internal successors, (73), 67 states have internal predecessors, (73), 16 states have call successors, (16), 5 states have call predecessors, (16), 9 states have return successors, (25), 16 states have call predecessors, (25), 16 states have call successors, (25) [2022-01-11 06:03:41,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 114 transitions. [2022-01-11 06:03:41,627 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 114 transitions. Word has length 78 [2022-01-11 06:03:41,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 06:03:41,627 INFO L470 AbstractCegarLoop]: Abstraction has 89 states and 114 transitions. [2022-01-11 06:03:41,627 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 5 states have internal predecessors, (36), 2 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 2 states have call successors, (12) [2022-01-11 06:03:41,627 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 114 transitions. [2022-01-11 06:03:41,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-01-11 06:03:41,629 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 06:03:41,629 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 06:03:41,629 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-11 06:03:41,629 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 06:03:41,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 06:03:41,630 INFO L85 PathProgramCache]: Analyzing trace with hash 1248662034, now seen corresponding path program 1 times [2022-01-11 06:03:41,630 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 06:03:41,630 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539722724] [2022-01-11 06:03:41,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 06:03:41,630 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 06:03:41,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 06:03:41,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-11 06:03:41,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 06:03:41,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-11 06:03:41,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 06:03:41,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-11 06:03:41,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 06:03:41,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-11 06:03:41,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 06:03:41,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-11 06:03:41,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 06:03:42,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-01-11 06:03:42,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 06:03:42,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-01-11 06:03:42,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 06:03:42,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-11 06:03:42,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 06:03:42,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-01-11 06:03:42,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 06:03:42,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-01-11 06:03:42,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 06:03:42,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-11 06:03:42,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 06:03:42,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-01-11 06:03:42,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 06:03:42,100 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-01-11 06:03:42,100 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 06:03:42,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539722724] [2022-01-11 06:03:42,100 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539722724] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-11 06:03:42,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1419691891] [2022-01-11 06:03:42,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 06:03:42,101 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 06:03:42,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 06:03:42,104 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-11 06:03:42,105 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-01-11 06:03:42,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 06:03:42,477 INFO L263 TraceCheckSpWp]: Trace formula consists of 1106 conjuncts, 17 conjunts are in the unsatisfiable core [2022-01-11 06:03:42,481 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-11 06:03:43,117 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-01-11 06:03:43,117 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-11 06:03:43,319 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-01-11 06:03:43,322 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1419691891] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-11 06:03:43,322 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-11 06:03:43,323 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 4] total 14 [2022-01-11 06:03:43,323 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800848603] [2022-01-11 06:03:43,323 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-11 06:03:43,324 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-01-11 06:03:43,324 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 06:03:43,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-01-11 06:03:43,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2022-01-11 06:03:43,328 INFO L87 Difference]: Start difference. First operand 89 states and 114 transitions. Second operand has 14 states, 14 states have (on average 4.0) internal successors, (56), 12 states have internal predecessors, (56), 2 states have call successors, (21), 4 states have call predecessors, (21), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-01-11 06:03:45,872 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-11 06:03:46,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 06:03:46,184 INFO L93 Difference]: Finished difference Result 149 states and 190 transitions. [2022-01-11 06:03:46,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-11 06:03:46,185 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.0) internal successors, (56), 12 states have internal predecessors, (56), 2 states have call successors, (21), 4 states have call predecessors, (21), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 79 [2022-01-11 06:03:46,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 06:03:46,187 INFO L225 Difference]: With dead ends: 149 [2022-01-11 06:03:46,187 INFO L226 Difference]: Without dead ends: 93 [2022-01-11 06:03:46,187 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2022-01-11 06:03:46,188 INFO L933 BasicCegarLoop]: 80 mSDtfsCounter, 50 mSDsluCounter, 403 mSDsCounter, 0 mSdLazyCounter, 351 mSolverCounterSat, 23 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 351 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 52 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-01-11 06:03:46,188 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [58 Valid, 483 Invalid, 427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 351 Invalid, 1 Unknown, 52 Unchecked, 2.6s Time] [2022-01-11 06:03:46,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-01-11 06:03:46,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 92. [2022-01-11 06:03:46,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 63 states have (on average 1.2063492063492063) internal successors, (76), 70 states have internal predecessors, (76), 16 states have call successors, (16), 5 states have call predecessors, (16), 9 states have return successors, (25), 16 states have call predecessors, (25), 16 states have call successors, (25) [2022-01-11 06:03:46,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 117 transitions. [2022-01-11 06:03:46,200 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 117 transitions. Word has length 79 [2022-01-11 06:03:46,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 06:03:46,201 INFO L470 AbstractCegarLoop]: Abstraction has 92 states and 117 transitions. [2022-01-11 06:03:46,201 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.0) internal successors, (56), 12 states have internal predecessors, (56), 2 states have call successors, (21), 4 states have call predecessors, (21), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-01-11 06:03:46,201 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 117 transitions. [2022-01-11 06:03:46,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-01-11 06:03:46,202 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 06:03:46,202 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 06:03:46,211 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-01-11 06:03:46,409 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-01-11 06:03:46,409 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 06:03:46,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 06:03:46,410 INFO L85 PathProgramCache]: Analyzing trace with hash 1477567122, now seen corresponding path program 2 times [2022-01-11 06:03:46,410 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 06:03:46,410 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095600671] [2022-01-11 06:03:46,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 06:03:46,410 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 06:03:46,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 06:03:46,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-11 06:03:46,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 06:03:46,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-11 06:03:46,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 06:03:46,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-11 06:03:46,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 06:03:46,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-11 06:03:46,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 06:03:46,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-11 06:03:46,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 06:03:46,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-01-11 06:03:46,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 06:03:46,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-01-11 06:03:46,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 06:03:46,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-11 06:03:46,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 06:03:46,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-01-11 06:03:46,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 06:03:46,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-01-11 06:03:46,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 06:03:46,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-11 06:03:46,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 06:03:46,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-01-11 06:03:46,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 06:03:46,921 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-01-11 06:03:46,921 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 06:03:46,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095600671] [2022-01-11 06:03:46,921 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095600671] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-11 06:03:46,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [715845315] [2022-01-11 06:03:46,922 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-11 06:03:46,922 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 06:03:46,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 06:03:46,923 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-11 06:03:46,924 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-01-11 06:03:51,167 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-11 06:03:51,167 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-11 06:03:51,178 INFO L263 TraceCheckSpWp]: Trace formula consists of 1156 conjuncts, 73 conjunts are in the unsatisfiable core [2022-01-11 06:03:51,183 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-11 06:03:52,288 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-01-11 06:03:52,288 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-11 06:03:52,914 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-01-11 06:03:52,914 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [715845315] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-11 06:03:52,915 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-11 06:03:52,915 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 17, 8] total 31 [2022-01-11 06:03:52,915 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354647209] [2022-01-11 06:03:52,915 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-11 06:03:52,916 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-01-11 06:03:52,916 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 06:03:52,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-01-11 06:03:52,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=811, Unknown=0, NotChecked=0, Total=930 [2022-01-11 06:03:52,917 INFO L87 Difference]: Start difference. First operand 92 states and 117 transitions. Second operand has 31 states, 31 states have (on average 2.5483870967741935) internal successors, (79), 26 states have internal predecessors, (79), 7 states have call successors, (26), 4 states have call predecessors, (26), 6 states have return successors, (25), 9 states have call predecessors, (25), 7 states have call successors, (25) [2022-01-11 06:03:58,144 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-11 06:04:01,066 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-11 06:04:02,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 06:04:02,780 INFO L93 Difference]: Finished difference Result 219 states and 286 transitions. [2022-01-11 06:04:02,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-01-11 06:04:02,781 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 2.5483870967741935) internal successors, (79), 26 states have internal predecessors, (79), 7 states have call successors, (26), 4 states have call predecessors, (26), 6 states have return successors, (25), 9 states have call predecessors, (25), 7 states have call successors, (25) Word has length 81 [2022-01-11 06:04:02,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 06:04:02,783 INFO L225 Difference]: With dead ends: 219 [2022-01-11 06:04:02,783 INFO L226 Difference]: Without dead ends: 162 [2022-01-11 06:04:02,784 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 606 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=478, Invalid=2828, Unknown=0, NotChecked=0, Total=3306 [2022-01-11 06:04:02,785 INFO L933 BasicCegarLoop]: 85 mSDtfsCounter, 438 mSDsluCounter, 812 mSDsCounter, 0 mSdLazyCounter, 1185 mSolverCounterSat, 322 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 445 SdHoareTripleChecker+Valid, 897 SdHoareTripleChecker+Invalid, 1509 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 322 IncrementalHoareTripleChecker+Valid, 1185 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.2s IncrementalHoareTripleChecker+Time [2022-01-11 06:04:02,785 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [445 Valid, 897 Invalid, 1509 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [322 Valid, 1185 Invalid, 2 Unknown, 0 Unchecked, 8.2s Time] [2022-01-11 06:04:02,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2022-01-11 06:04:02,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 108. [2022-01-11 06:04:02,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 77 states have (on average 1.1818181818181819) internal successors, (91), 83 states have internal predecessors, (91), 17 states have call successors, (17), 5 states have call predecessors, (17), 10 states have return successors, (32), 19 states have call predecessors, (32), 17 states have call successors, (32) [2022-01-11 06:04:02,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 140 transitions. [2022-01-11 06:04:02,824 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 140 transitions. Word has length 81 [2022-01-11 06:04:02,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 06:04:02,824 INFO L470 AbstractCegarLoop]: Abstraction has 108 states and 140 transitions. [2022-01-11 06:04:02,824 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 2.5483870967741935) internal successors, (79), 26 states have internal predecessors, (79), 7 states have call successors, (26), 4 states have call predecessors, (26), 6 states have return successors, (25), 9 states have call predecessors, (25), 7 states have call successors, (25) [2022-01-11 06:04:02,825 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 140 transitions. [2022-01-11 06:04:02,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-01-11 06:04:02,826 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 06:04:02,826 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 06:04:02,839 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-01-11 06:04:03,036 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 06:04:03,036 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 06:04:03,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 06:04:03,037 INFO L85 PathProgramCache]: Analyzing trace with hash -2117109738, now seen corresponding path program 3 times [2022-01-11 06:04:03,037 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 06:04:03,037 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901905406] [2022-01-11 06:04:03,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 06:04:03,038 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 06:04:03,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-11 06:04:03,874 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-01-11 06:04:04,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-11 06:04:04,417 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-01-11 06:04:04,417 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-01-11 06:04:04,418 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2022-01-11 06:04:04,420 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2022-01-11 06:04:04,420 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2022-01-11 06:04:04,420 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2022-01-11 06:04:04,420 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-11 06:04:04,423 INFO L732 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1] [2022-01-11 06:04:04,427 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2022-01-11 06:04:04,505 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled [2022-01-11 06:04:04,505 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled [2022-01-11 06:04:04,506 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled [2022-01-11 06:04:04,508 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled [2022-01-11 06:04:04,508 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled [2022-01-11 06:04:04,508 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled [2022-01-11 06:04:04,511 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled [2022-01-11 06:04:04,511 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled [2022-01-11 06:04:04,511 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled [2022-01-11 06:04:04,511 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled [2022-01-11 06:04:04,511 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled [2022-01-11 06:04:04,511 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled [2022-01-11 06:04:04,512 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled [2022-01-11 06:04:04,512 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled [2022-01-11 06:04:04,512 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled [2022-01-11 06:04:04,512 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled [2022-01-11 06:04:04,513 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled [2022-01-11 06:04:04,513 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled [2022-01-11 06:04:04,513 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled [2022-01-11 06:04:04,513 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled [2022-01-11 06:04:04,513 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled [2022-01-11 06:04:04,513 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled [2022-01-11 06:04:04,554 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.01 06:04:04 BasicIcfg [2022-01-11 06:04:04,554 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-11 06:04:04,554 INFO L158 Benchmark]: Toolchain (without parser) took 40971.58ms. Allocated memory was 170.9MB in the beginning and 311.4MB in the end (delta: 140.5MB). Free memory was 115.1MB in the beginning and 107.5MB in the end (delta: 7.6MB). Peak memory consumption was 154.7MB. Max. memory is 8.0GB. [2022-01-11 06:04:04,555 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 170.9MB. Free memory is still 131.8MB. There was no memory consumed. Max. memory is 8.0GB. [2022-01-11 06:04:04,555 INFO L158 Benchmark]: CACSL2BoogieTranslator took 423.69ms. Allocated memory was 170.9MB in the beginning and 259.0MB in the end (delta: 88.1MB). Free memory was 114.8MB in the beginning and 227.2MB in the end (delta: -112.4MB). Peak memory consumption was 7.7MB. Max. memory is 8.0GB. [2022-01-11 06:04:04,556 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.96ms. Allocated memory is still 259.0MB. Free memory was 227.2MB in the beginning and 225.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-01-11 06:04:04,557 INFO L158 Benchmark]: Boogie Preprocessor took 54.43ms. Allocated memory is still 259.0MB. Free memory was 225.1MB in the beginning and 223.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-01-11 06:04:04,558 INFO L158 Benchmark]: RCFGBuilder took 690.61ms. Allocated memory is still 259.0MB. Free memory was 223.0MB in the beginning and 201.5MB in the end (delta: 21.5MB). Peak memory consumption was 22.0MB. Max. memory is 8.0GB. [2022-01-11 06:04:04,558 INFO L158 Benchmark]: IcfgTransformer took 169.74ms. Allocated memory is still 259.0MB. Free memory was 201.5MB in the beginning and 189.5MB in the end (delta: 12.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-01-11 06:04:04,558 INFO L158 Benchmark]: TraceAbstraction took 39564.65ms. Allocated memory was 259.0MB in the beginning and 311.4MB in the end (delta: 52.4MB). Free memory was 188.9MB in the beginning and 107.5MB in the end (delta: 81.4MB). Peak memory consumption was 140.7MB. Max. memory is 8.0GB. [2022-01-11 06:04:04,561 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.12ms. Allocated memory is still 170.9MB. Free memory is still 131.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 423.69ms. Allocated memory was 170.9MB in the beginning and 259.0MB in the end (delta: 88.1MB). Free memory was 114.8MB in the beginning and 227.2MB in the end (delta: -112.4MB). Peak memory consumption was 7.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 52.96ms. Allocated memory is still 259.0MB. Free memory was 227.2MB in the beginning and 225.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 54.43ms. Allocated memory is still 259.0MB. Free memory was 225.1MB in the beginning and 223.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 690.61ms. Allocated memory is still 259.0MB. Free memory was 223.0MB in the beginning and 201.5MB in the end (delta: 21.5MB). Peak memory consumption was 22.0MB. Max. memory is 8.0GB. * IcfgTransformer took 169.74ms. Allocated memory is still 259.0MB. Free memory was 201.5MB in the beginning and 189.5MB in the end (delta: 12.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 39564.65ms. Allocated memory was 259.0MB in the beginning and 311.4MB in the end (delta: 52.4MB). Free memory was 188.9MB in the beginning and 107.5MB in the end (delta: 81.4MB). Peak memory consumption was 140.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled * 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: 16]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L102] CALL, EXPR nondet_tree() [L25] COND FALSE !(__VERIFIER_nondet_bool()) [L28] struct node *n = (struct node *)malloc(sizeof(struct node)); [L29] n->data = __VERIFIER_nondet_int() [L30] CALL, EXPR nondet_tree() [L25] COND TRUE __VERIFIER_nondet_bool() [L26] return 0; VAL [\result={0:0}] [L30] RET, EXPR nondet_tree() VAL [n={-15:0}, nondet_tree()={0:0}] [L30] n->left = nondet_tree() [L31] CALL, EXPR nondet_tree() [L25] COND TRUE __VERIFIER_nondet_bool() [L26] return 0; VAL [\result={0:0}] [L31] RET, EXPR nondet_tree() VAL [n={-15:0}, nondet_tree()={0:0}] [L31] n->right = nondet_tree() [L32] return n; VAL [\result={-15:0}, n={-15:0}] [L102] RET, EXPR nondet_tree() VAL [nondet_tree()={-15:0}] [L102] CALL task(nondet_tree()) [L78] CALL, EXPR min(t) VAL [n={-15:0}] [L37] COND FALSE !(!n) [L40] EXPR n->data [L40] int a = n->data; [L41] EXPR n->left VAL [a=2147483647, n={-15:0}, n={-15:0}, n->left={0:0}] [L41] CALL, EXPR min(n->left) VAL [n={0:0}] [L37] COND TRUE !n [L38] return 2147483647; VAL [\result=-1, n={0:0}, n={0:0}] [L41] RET, EXPR min(n->left) VAL [a=2147483647, min(n->left)=-1, n={-15:0}, n={-15:0}, n->left={0:0}] [L41] int b = min(n->left); [L42] EXPR n->right VAL [a=2147483647, b=2147483647, n={-15:0}, n={-15:0}, n->right={0:0}] [L42] CALL, EXPR min(n->right) VAL [n={0:0}] [L37] COND TRUE !n [L38] return 2147483647; VAL [\result=-1, n={0:0}, n={0:0}] [L42] RET, EXPR min(n->right) VAL [a=2147483647, b=2147483647, min(n->right)=-1, n={-15:0}, n={-15:0}, n->right={0:0}] [L42] int c = min(n->right); [L43] COND TRUE b <= a && b <= c [L43] return b; VAL [\result=-1, a=2147483647, b=2147483647, c=2147483647, n={-15:0}, n={-15:0}] [L78] RET, EXPR min(t) VAL [min(t)=-1, t={-15:0}, t={-15:0}] [L78] int a = min(t); [L79] int b; VAL [a=2147483647, b={-8:0}, t={-15:0}, t={-15:0}] [L81] CALL, EXPR size(t) VAL [t={-15:0}] [L73] COND FALSE !(!t) [L74] EXPR t->left VAL [t={-15:0}, t={-15:0}, t->left={0:0}] [L74] CALL, EXPR size(t->left) VAL [t={0:0}] [L73] COND TRUE !t [L73] return 0; VAL [\result=0, t={0:0}, t={0:0}] [L74] RET, EXPR size(t->left) VAL [size(t->left)=0, t={-15:0}, t={-15:0}, t->left={0:0}] [L74] EXPR t->right VAL [size(t->left)=0, t={-15:0}, t={-15:0}, t->left={0:0}, t->right={0:0}] [L74] CALL, EXPR size(t->right) VAL [t={0:0}] [L73] COND TRUE !t [L73] return 0; VAL [\result=0, t={0:0}, t={0:0}] [L74] RET, EXPR size(t->right) VAL [size(t->left)=0, size(t->right)=0, t={-15:0}, t={-15:0}, t->left={0:0}, t->right={0:0}] [L74] return size(t->left) + size(t->right) + 1; [L81] RET, EXPR size(t) VAL [a=2147483647, b={-8:0}, size(t)=-1, t={-15:0}, t={-15:0}] [L81] int n = size(t); [L82] CALL assume_cycle_if_not(n != 0) [L9] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L82] RET assume_cycle_if_not(n != 0) [L83] EXPR, FCALL calloc(n, sizeof(int)) [L83] int *x = calloc(n, sizeof(int)); VAL [a=2147483647, b={-8:0}, calloc(n, sizeof(int))={-6:0}, n=1, t={-15:0}, t={-15:0}, x={-6:0}] [L84] CALL tree_inorder(t, x, n) VAL [\old(i)=1, a={-6:0}, t={-15:0}] [L62] COND FALSE !(!t) [L65] EXPR t->left VAL [\old(i)=1, a={-6:0}, a={-6:0}, i=1, t={-15:0}, t={-15:0}, t->left={0:0}] [L65] CALL, EXPR tree_inorder(t->left, a, i) VAL [\old(i)=1, a={-6:0}, t={0:0}] [L62] COND TRUE !t [L63] return i; VAL [\old(i)=1, \result=-1, a={-6:0}, a={-6:0}, i=1, t={0:0}, t={0:0}] [L65] RET, EXPR tree_inorder(t->left, a, i) VAL [\old(i)=1, a={-6:0}, a={-6:0}, i=1, t={-15:0}, t={-15:0}, t->left={0:0}, tree_inorder(t->left, a, i)=-1] [L65] i = tree_inorder(t->left, a, i) [L66] EXPR i++ [L66] EXPR t->data [L66] a[i++] = t->data [L67] EXPR t->right VAL [\old(i)=1, a={-6:0}, a={-6:0}, i=2, t={-15:0}, t={-15:0}, t->right={0:0}] [L67] CALL, EXPR tree_inorder(t->right, a, i) VAL [\old(i)=2, a={-6:0}, t={0:0}] [L62] COND TRUE !t [L63] return i; VAL [\old(i)=2, \result=-2, a={-6:0}, a={-6:0}, i=2, t={0:0}, t={0:0}] [L67] RET, EXPR tree_inorder(t->right, a, i) VAL [\old(i)=1, a={-6:0}, a={-6:0}, i=2, t={-15:0}, t={-15:0}, t->right={0:0}, tree_inorder(t->right, a, i)=-2] [L67] i = tree_inorder(t->right, a, i) [L68] return i; VAL [\old(i)=1, \result=-2, a={-6:0}, a={-6:0}, i=2, t={-15:0}, t={-15:0}] [L84] RET tree_inorder(t, x, n) VAL [a=2147483647, b={-8:0}, calloc(n, sizeof(int))={-6:0}, n=1, t={-15:0}, t={-15:0}, tree_inorder(t, x, n)=-2, x={-6:0}] [L85] EXPR x[0] [L85] CALL __VERIFIER_assert(a == x[0]) [L16] COND TRUE !cond VAL [\old(cond)=0, cond=0] [L16] reach_error() VAL [\old(cond)=0, cond=0] - UnprovableResult [Line: 16]: 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: 16]: 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: 16]: 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 6 procedures, 85 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 39.4s, OverallIterations: 8, TraceHistogramMax: 4, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 26.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 4 mSolverCounterUnknown, 994 SdHoareTripleChecker+Valid, 23.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 957 mSDsluCounter, 3402 SdHoareTripleChecker+Invalid, 22.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 52 IncrementalHoareTripleChecker+Unchecked, 2831 mSDsCounter, 583 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3107 IncrementalHoareTripleChecker+Invalid, 3746 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 583 mSolverCounterUnsat, 571 mSDtfsCounter, 3107 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 631 GetRequests, 496 SyntacticMatches, 1 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 765 ImplicationChecksByTransitivity, 3.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=108occurred in iteration=7, InterpolantAutomatonStates: 85, 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, 7 MinimizatonAttempts, 70 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 5.8s SatisfiabilityAnalysisTime, 5.5s InterpolantComputationTime, 716 NumberOfCodeBlocks, 716 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 824 ConstructedInterpolants, 2 QuantifiedInterpolants, 3171 SizeOfPredicates, 23 NumberOfNonLiveVariables, 2782 ConjunctsInSsa, 110 ConjunctsInUnsatCore, 13 InterpolantComputations, 4 PerfectInterpolantSequences, 393/426 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 06:04:04,584 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...