/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/forester-heap/dll-rb-sentinel-1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 00:51:07,829 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 00:51:07,830 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 00:51:07,885 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 00:51:07,886 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 00:51:07,886 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 00:51:07,887 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 00:51:07,888 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 00:51:07,889 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 00:51:07,890 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 00:51:07,890 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 00:51:07,891 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 00:51:07,891 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 00:51:07,892 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 00:51:07,892 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 00:51:07,893 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 00:51:07,894 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 00:51:07,894 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 00:51:07,896 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 00:51:07,897 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 00:51:07,898 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 00:51:07,899 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 00:51:07,900 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 00:51:07,900 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 00:51:07,902 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 00:51:07,902 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 00:51:07,903 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 00:51:07,903 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 00:51:07,903 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 00:51:07,904 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 00:51:07,904 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 00:51:07,905 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 00:51:07,905 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 00:51:07,906 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 00:51:07,906 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 00:51:07,906 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 00:51:07,907 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 00:51:07,907 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 00:51:07,907 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 00:51:07,908 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 00:51:07,908 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 00:51:07,909 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_Default.epf [2022-01-10 00:51:07,926 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 00:51:07,926 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 00:51:07,927 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 00:51:07,927 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 00:51:07,927 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-10 00:51:07,927 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-10 00:51:07,928 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 00:51:07,928 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 00:51:07,928 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 00:51:07,928 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 00:51:07,928 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 00:51:07,929 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 00:51:07,929 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 00:51:07,929 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 00:51:07,929 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 00:51:07,929 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 00:51:07,929 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 00:51:07,929 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 00:51:07,930 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 00:51:07,930 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 00:51:07,930 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 00:51:07,930 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 00:51:07,930 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 00:51:07,930 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 00:51:07,931 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 00:51:07,931 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-10 00:51:07,931 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-10 00:51:07,931 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 00:51:07,931 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 00:51:07,931 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 00:51:07,931 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-01-10 00:51:08,084 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 00:51:08,104 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 00:51:08,106 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 00:51:08,107 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 00:51:08,107 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 00:51:08,108 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/dll-rb-sentinel-1.i [2022-01-10 00:51:08,146 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb33b273d/a8dd3e51993643aaaf725e6e0cd8d704/FLAGadfb6acab [2022-01-10 00:51:08,482 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 00:51:08,482 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/dll-rb-sentinel-1.i [2022-01-10 00:51:08,515 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb33b273d/a8dd3e51993643aaaf725e6e0cd8d704/FLAGadfb6acab [2022-01-10 00:51:08,882 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb33b273d/a8dd3e51993643aaaf725e6e0cd8d704 [2022-01-10 00:51:08,886 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 00:51:08,888 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-10 00:51:08,890 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 00:51:08,890 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 00:51:08,892 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 00:51:08,893 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:51:08" (1/1) ... [2022-01-10 00:51:08,897 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@777d38b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:51:08, skipping insertion in model container [2022-01-10 00:51:08,897 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:51:08" (1/1) ... [2022-01-10 00:51:08,902 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 00:51:08,948 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 00:51:09,192 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/dll-rb-sentinel-1.i[22665,22678] [2022-01-10 00:51:09,195 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/dll-rb-sentinel-1.i[22735,22748] [2022-01-10 00:51:09,196 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/dll-rb-sentinel-1.i[22799,22812] [2022-01-10 00:51:09,196 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/dll-rb-sentinel-1.i[22894,22907] [2022-01-10 00:51:09,197 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/dll-rb-sentinel-1.i[22966,22979] [2022-01-10 00:51:09,198 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/dll-rb-sentinel-1.i[23105,23118] [2022-01-10 00:51:09,198 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/dll-rb-sentinel-1.i[23179,23192] [2022-01-10 00:51:09,201 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 00:51:09,206 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 00:51:09,240 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/dll-rb-sentinel-1.i[22665,22678] [2022-01-10 00:51:09,240 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/dll-rb-sentinel-1.i[22735,22748] [2022-01-10 00:51:09,241 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/dll-rb-sentinel-1.i[22799,22812] [2022-01-10 00:51:09,241 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/dll-rb-sentinel-1.i[22894,22907] [2022-01-10 00:51:09,242 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/dll-rb-sentinel-1.i[22966,22979] [2022-01-10 00:51:09,243 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/dll-rb-sentinel-1.i[23105,23118] [2022-01-10 00:51:09,243 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/dll-rb-sentinel-1.i[23179,23192] [2022-01-10 00:51:09,245 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 00:51:09,265 INFO L208 MainTranslator]: Completed translation [2022-01-10 00:51:09,266 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:51:09 WrapperNode [2022-01-10 00:51:09,266 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 00:51:09,267 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 00:51:09,267 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 00:51:09,267 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 00:51:09,273 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:51:09" (1/1) ... [2022-01-10 00:51:09,285 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:51:09" (1/1) ... [2022-01-10 00:51:09,314 INFO L137 Inliner]: procedures = 119, calls = 43, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 156 [2022-01-10 00:51:09,314 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 00:51:09,315 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 00:51:09,315 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 00:51:09,315 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 00:51:09,320 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:51:09" (1/1) ... [2022-01-10 00:51:09,320 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:51:09" (1/1) ... [2022-01-10 00:51:09,323 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:51:09" (1/1) ... [2022-01-10 00:51:09,323 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:51:09" (1/1) ... [2022-01-10 00:51:09,336 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:51:09" (1/1) ... [2022-01-10 00:51:09,339 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:51:09" (1/1) ... [2022-01-10 00:51:09,341 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:51:09" (1/1) ... [2022-01-10 00:51:09,342 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 00:51:09,343 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 00:51:09,343 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 00:51:09,344 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 00:51:09,354 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:51:09" (1/1) ... [2022-01-10 00:51:09,359 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 00:51:09,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 00:51:09,383 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-10 00:51:09,385 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-01-10 00:51:09,409 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-10 00:51:09,409 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-10 00:51:09,409 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-01-10 00:51:09,409 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 00:51:09,409 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-01-10 00:51:09,409 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-01-10 00:51:09,409 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-10 00:51:09,409 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-10 00:51:09,410 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 00:51:09,410 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 00:51:09,472 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 00:51:09,472 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 00:51:09,664 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 00:51:09,668 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 00:51:09,668 INFO L299 CfgBuilder]: Removed 17 assume(true) statements. [2022-01-10 00:51:09,669 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:51:09 BoogieIcfgContainer [2022-01-10 00:51:09,669 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 00:51:09,670 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 00:51:09,670 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 00:51:09,673 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 00:51:09,673 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 12:51:08" (1/3) ... [2022-01-10 00:51:09,673 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d6ceb55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:51:09, skipping insertion in model container [2022-01-10 00:51:09,673 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:51:09" (2/3) ... [2022-01-10 00:51:09,674 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d6ceb55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:51:09, skipping insertion in model container [2022-01-10 00:51:09,674 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:51:09" (3/3) ... [2022-01-10 00:51:09,675 INFO L111 eAbstractionObserver]: Analyzing ICFG dll-rb-sentinel-1.i [2022-01-10 00:51:09,678 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 00:51:09,678 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2022-01-10 00:51:09,709 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 00:51:09,713 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-01-10 00:51:09,714 INFO L340 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-01-10 00:51:09,723 INFO L276 IsEmpty]: Start isEmpty. Operand has 47 states, 39 states have (on average 1.9487179487179487) internal successors, (76), 46 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:51:09,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-01-10 00:51:09,727 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:51:09,727 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-01-10 00:51:09,727 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-01-10 00:51:09,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:51:09,731 INFO L85 PathProgramCache]: Analyzing trace with hash 891600134, now seen corresponding path program 1 times [2022-01-10 00:51:09,738 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:51:09,738 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410475318] [2022-01-10 00:51:09,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:51:09,739 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:51:09,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:51:09,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 00:51:09,941 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:51:09,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410475318] [2022-01-10 00:51:09,942 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410475318] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:51:09,943 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 00:51:09,944 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 00:51:09,945 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530330772] [2022-01-10 00:51:09,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:51:09,948 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-01-10 00:51:09,949 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:51:09,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-01-10 00:51:09,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-10 00:51:09,976 INFO L87 Difference]: Start difference. First operand has 47 states, 39 states have (on average 1.9487179487179487) internal successors, (76), 46 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:51:09,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:51:09,995 INFO L93 Difference]: Finished difference Result 92 states and 150 transitions. [2022-01-10 00:51:09,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-01-10 00:51:09,996 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-01-10 00:51:09,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:51:10,002 INFO L225 Difference]: With dead ends: 92 [2022-01-10 00:51:10,002 INFO L226 Difference]: Without dead ends: 41 [2022-01-10 00:51:10,004 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-10 00:51:10,009 INFO L933 BasicCegarLoop]: 52 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 00:51:10,010 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 00:51:10,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-01-10 00:51:10,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2022-01-10 00:51:10,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 40 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:51:10,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2022-01-10 00:51:10,038 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 6 [2022-01-10 00:51:10,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:51:10,039 INFO L470 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2022-01-10 00:51:10,039 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:51:10,039 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2022-01-10 00:51:10,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-01-10 00:51:10,039 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:51:10,039 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-01-10 00:51:10,040 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-10 00:51:10,040 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-01-10 00:51:10,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:51:10,043 INFO L85 PathProgramCache]: Analyzing trace with hash 1806905862, now seen corresponding path program 1 times [2022-01-10 00:51:10,043 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:51:10,043 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045188648] [2022-01-10 00:51:10,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:51:10,044 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:51:10,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:51:10,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 00:51:10,167 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:51:10,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045188648] [2022-01-10 00:51:10,170 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2045188648] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:51:10,170 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 00:51:10,170 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 00:51:10,170 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444613730] [2022-01-10 00:51:10,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:51:10,172 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 00:51:10,172 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:51:10,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 00:51:10,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 00:51:10,173 INFO L87 Difference]: Start difference. First operand 41 states and 44 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:51:10,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:51:10,243 INFO L93 Difference]: Finished difference Result 47 states and 52 transitions. [2022-01-10 00:51:10,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 00:51:10,243 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-01-10 00:51:10,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:51:10,244 INFO L225 Difference]: With dead ends: 47 [2022-01-10 00:51:10,244 INFO L226 Difference]: Without dead ends: 45 [2022-01-10 00:51:10,245 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-10 00:51:10,246 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 51 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 00:51:10,247 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [51 Valid, 47 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 00:51:10,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-01-10 00:51:10,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 39. [2022-01-10 00:51:10,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 38 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:51:10,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2022-01-10 00:51:10,257 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 7 [2022-01-10 00:51:10,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:51:10,259 INFO L470 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2022-01-10 00:51:10,262 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:51:10,263 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2022-01-10 00:51:10,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-01-10 00:51:10,263 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:51:10,263 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 00:51:10,263 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-10 00:51:10,264 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-01-10 00:51:10,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:51:10,264 INFO L85 PathProgramCache]: Analyzing trace with hash 179566605, now seen corresponding path program 1 times [2022-01-10 00:51:10,264 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:51:10,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299454310] [2022-01-10 00:51:10,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:51:10,265 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:51:10,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:51:10,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 00:51:10,405 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:51:10,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299454310] [2022-01-10 00:51:10,406 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299454310] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:51:10,406 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 00:51:10,406 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 00:51:10,406 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812051657] [2022-01-10 00:51:10,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:51:10,406 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 00:51:10,407 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:51:10,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 00:51:10,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 00:51:10,407 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:51:10,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:51:10,460 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2022-01-10 00:51:10,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 00:51:10,461 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-01-10 00:51:10,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:51:10,462 INFO L225 Difference]: With dead ends: 39 [2022-01-10 00:51:10,462 INFO L226 Difference]: Without dead ends: 37 [2022-01-10 00:51:10,462 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-10 00:51:10,463 INFO L933 BasicCegarLoop]: 34 mSDtfsCounter, 13 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 00:51:10,463 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 79 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 00:51:10,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-01-10 00:51:10,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2022-01-10 00:51:10,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 32 states have (on average 1.25) internal successors, (40), 36 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:51:10,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 40 transitions. [2022-01-10 00:51:10,466 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 40 transitions. Word has length 8 [2022-01-10 00:51:10,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:51:10,466 INFO L470 AbstractCegarLoop]: Abstraction has 37 states and 40 transitions. [2022-01-10 00:51:10,466 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:51:10,466 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2022-01-10 00:51:10,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-01-10 00:51:10,467 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:51:10,467 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 00:51:10,467 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-10 00:51:10,467 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-01-10 00:51:10,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:51:10,468 INFO L85 PathProgramCache]: Analyzing trace with hash 711412120, now seen corresponding path program 1 times [2022-01-10 00:51:10,468 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:51:10,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245153395] [2022-01-10 00:51:10,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:51:10,468 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:51:10,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:51:10,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 00:51:10,536 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:51:10,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245153395] [2022-01-10 00:51:10,536 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245153395] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:51:10,536 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 00:51:10,537 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 00:51:10,538 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942400532] [2022-01-10 00:51:10,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:51:10,539 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 00:51:10,539 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:51:10,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 00:51:10,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 00:51:10,539 INFO L87 Difference]: Start difference. First operand 37 states and 40 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:51:10,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:51:10,631 INFO L93 Difference]: Finished difference Result 62 states and 68 transitions. [2022-01-10 00:51:10,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 00:51:10,631 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-01-10 00:51:10,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:51:10,632 INFO L225 Difference]: With dead ends: 62 [2022-01-10 00:51:10,633 INFO L226 Difference]: Without dead ends: 60 [2022-01-10 00:51:10,634 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-10 00:51:10,639 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 39 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 00:51:10,640 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 91 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 00:51:10,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-01-10 00:51:10,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 44. [2022-01-10 00:51:10,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 43 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:51:10,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2022-01-10 00:51:10,651 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 10 [2022-01-10 00:51:10,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:51:10,651 INFO L470 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2022-01-10 00:51:10,651 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:51:10,651 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2022-01-10 00:51:10,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-01-10 00:51:10,651 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:51:10,652 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 00:51:10,652 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-10 00:51:10,652 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-01-10 00:51:10,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:51:10,652 INFO L85 PathProgramCache]: Analyzing trace with hash -2056579816, now seen corresponding path program 1 times [2022-01-10 00:51:10,652 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:51:10,652 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735146755] [2022-01-10 00:51:10,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:51:10,653 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:51:10,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:51:10,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 00:51:10,731 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:51:10,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735146755] [2022-01-10 00:51:10,731 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735146755] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:51:10,731 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 00:51:10,731 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 00:51:10,732 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118751826] [2022-01-10 00:51:10,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:51:10,732 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 00:51:10,732 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:51:10,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 00:51:10,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 00:51:10,732 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:51:10,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:51:10,785 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2022-01-10 00:51:10,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 00:51:10,785 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-01-10 00:51:10,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:51:10,786 INFO L225 Difference]: With dead ends: 44 [2022-01-10 00:51:10,786 INFO L226 Difference]: Without dead ends: 42 [2022-01-10 00:51:10,786 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-10 00:51:10,786 INFO L933 BasicCegarLoop]: 30 mSDtfsCounter, 8 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 00:51:10,786 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 68 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 00:51:10,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-01-10 00:51:10,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2022-01-10 00:51:10,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 38 states have (on average 1.2105263157894737) internal successors, (46), 41 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:51:10,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2022-01-10 00:51:10,789 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 11 [2022-01-10 00:51:10,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:51:10,789 INFO L470 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2022-01-10 00:51:10,789 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:51:10,789 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2022-01-10 00:51:10,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-01-10 00:51:10,790 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:51:10,790 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 00:51:10,790 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-10 00:51:10,790 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-01-10 00:51:10,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:51:10,790 INFO L85 PathProgramCache]: Analyzing trace with hash -688119236, now seen corresponding path program 1 times [2022-01-10 00:51:10,790 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:51:10,790 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764001983] [2022-01-10 00:51:10,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:51:10,791 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:51:10,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:51:10,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 00:51:10,858 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:51:10,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764001983] [2022-01-10 00:51:10,858 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764001983] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:51:10,858 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 00:51:10,858 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 00:51:10,858 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086931424] [2022-01-10 00:51:10,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:51:10,859 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 00:51:10,859 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:51:10,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 00:51:10,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 00:51:10,859 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:51:10,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:51:10,888 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2022-01-10 00:51:10,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 00:51:10,889 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-01-10 00:51:10,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:51:10,889 INFO L225 Difference]: With dead ends: 42 [2022-01-10 00:51:10,889 INFO L226 Difference]: Without dead ends: 40 [2022-01-10 00:51:10,890 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-10 00:51:10,890 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 36 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 00:51:10,890 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 38 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 00:51:10,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-01-10 00:51:10,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2022-01-10 00:51:10,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 37 states have (on average 1.1891891891891893) internal successors, (44), 39 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:51:10,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2022-01-10 00:51:10,893 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 13 [2022-01-10 00:51:10,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:51:10,893 INFO L470 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2022-01-10 00:51:10,893 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:51:10,893 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2022-01-10 00:51:10,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-01-10 00:51:10,894 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:51:10,894 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 00:51:10,894 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-10 00:51:10,894 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-01-10 00:51:10,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:51:10,894 INFO L85 PathProgramCache]: Analyzing trace with hash -1285114177, now seen corresponding path program 1 times [2022-01-10 00:51:10,894 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:51:10,894 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703131937] [2022-01-10 00:51:10,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:51:10,895 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:51:10,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:51:10,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 00:51:10,951 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:51:10,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703131937] [2022-01-10 00:51:10,951 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1703131937] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:51:10,951 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 00:51:10,952 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 00:51:10,952 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490074506] [2022-01-10 00:51:10,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:51:10,952 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 00:51:10,952 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:51:10,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 00:51:10,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 00:51:10,952 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:51:11,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:51:11,010 INFO L93 Difference]: Finished difference Result 55 states and 61 transitions. [2022-01-10 00:51:11,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 00:51:11,011 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-01-10 00:51:11,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:51:11,011 INFO L225 Difference]: With dead ends: 55 [2022-01-10 00:51:11,011 INFO L226 Difference]: Without dead ends: 43 [2022-01-10 00:51:11,011 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-01-10 00:51:11,012 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 11 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 00:51:11,012 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 77 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 00:51:11,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-01-10 00:51:11,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2022-01-10 00:51:11,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 39 states have (on average 1.1794871794871795) internal successors, (46), 41 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:51:11,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2022-01-10 00:51:11,014 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 14 [2022-01-10 00:51:11,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:51:11,014 INFO L470 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2022-01-10 00:51:11,014 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:51:11,015 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2022-01-10 00:51:11,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-01-10 00:51:11,015 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:51:11,015 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 00:51:11,015 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-10 00:51:11,015 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-01-10 00:51:11,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:51:11,015 INFO L85 PathProgramCache]: Analyzing trace with hash 1621160418, now seen corresponding path program 1 times [2022-01-10 00:51:11,016 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:51:11,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086429469] [2022-01-10 00:51:11,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:51:11,016 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:51:11,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:51:11,059 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 00:51:11,059 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:51:11,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086429469] [2022-01-10 00:51:11,059 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086429469] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 00:51:11,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [916133687] [2022-01-10 00:51:11,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:51:11,059 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 00:51:11,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 00:51:11,097 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 00:51:11,099 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-01-10 00:51:11,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:51:11,186 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 21 conjunts are in the unsatisfiable core [2022-01-10 00:51:11,189 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 00:51:11,226 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:51:11,226 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:51:11,227 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:51:11,229 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2022-01-10 00:51:11,234 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:51:11,235 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:51:11,235 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:51:11,236 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2022-01-10 00:51:11,354 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-01-10 00:51:11,357 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-01-10 00:51:11,369 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 00:51:11,370 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 00:51:11,439 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 00:51:11,439 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [916133687] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 00:51:11,439 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 00:51:11,439 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2022-01-10 00:51:11,440 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721693373] [2022-01-10 00:51:11,440 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 00:51:11,440 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-10 00:51:11,440 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:51:11,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-10 00:51:11,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-01-10 00:51:11,440 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:51:11,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:51:11,516 INFO L93 Difference]: Finished difference Result 59 states and 64 transitions. [2022-01-10 00:51:11,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 00:51:11,517 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-01-10 00:51:11,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:51:11,517 INFO L225 Difference]: With dead ends: 59 [2022-01-10 00:51:11,517 INFO L226 Difference]: Without dead ends: 37 [2022-01-10 00:51:11,517 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-01-10 00:51:11,518 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 39 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 00:51:11,518 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 77 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 00:51:11,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-01-10 00:51:11,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2022-01-10 00:51:11,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 36 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:51:11,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 40 transitions. [2022-01-10 00:51:11,520 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 40 transitions. Word has length 17 [2022-01-10 00:51:11,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:51:11,520 INFO L470 AbstractCegarLoop]: Abstraction has 37 states and 40 transitions. [2022-01-10 00:51:11,520 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:51:11,520 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2022-01-10 00:51:11,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-01-10 00:51:11,521 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:51:11,521 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 00:51:11,540 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-10 00:51:11,731 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 00:51:11,731 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-01-10 00:51:11,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:51:11,732 INFO L85 PathProgramCache]: Analyzing trace with hash 1036168340, now seen corresponding path program 1 times [2022-01-10 00:51:11,732 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:51:11,732 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246118593] [2022-01-10 00:51:11,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:51:11,733 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:51:11,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:51:11,920 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 00:51:11,921 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:51:11,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246118593] [2022-01-10 00:51:11,921 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246118593] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 00:51:11,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1085310101] [2022-01-10 00:51:11,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:51:11,921 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 00:51:11,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 00:51:11,936 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 00:51:11,937 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-01-10 00:51:12,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:51:12,055 INFO L263 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 46 conjunts are in the unsatisfiable core [2022-01-10 00:51:12,058 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 00:51:12,067 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-01-10 00:51:12,078 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-01-10 00:51:12,078 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2022-01-10 00:51:12,118 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:51:12,119 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 29 [2022-01-10 00:51:12,123 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 18 [2022-01-10 00:51:12,128 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 39 [2022-01-10 00:51:12,131 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:51:12,132 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:51:12,132 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 00:51:12,133 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2022-01-10 00:51:12,137 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2022-01-10 00:51:12,148 INFO L353 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-01-10 00:51:12,148 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-01-10 00:51:12,182 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:51:12,183 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:51:12,196 INFO L353 Elim1Store]: treesize reduction 137, result has 7.4 percent of original size [2022-01-10 00:51:12,197 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 38 [2022-01-10 00:51:12,206 INFO L353 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-01-10 00:51:12,207 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-01-10 00:51:12,243 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-01-10 00:51:12,245 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 00:51:12,245 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 00:51:12,299 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 00:51:12,299 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 34 [2022-01-10 00:51:12,301 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 51 [2022-01-10 00:51:12,304 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2022-01-10 00:51:12,453 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 00:51:12,453 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 125 treesize of output 101 [2022-01-10 00:51:12,457 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 198 treesize of output 178 [2022-01-10 00:51:12,461 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 178 treesize of output 170 [2022-01-10 00:51:18,360 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_932 (Array Int Int)) (v_ArrVal_935 (Array Int Int)) (v_arrayElimCell_17 Int) (v_arrayElimCell_14 Int) (v_ArrVal_927 (Array Int Int)) (v_arrayElimCell_16 Int) (v_ArrVal_930 Int)) (let ((.cse1 (= v_arrayElimCell_17 v_arrayElimCell_14)) (.cse0 (= |c_ULTIMATE.start_main_~end~0#1.base| v_arrayElimCell_16))) (or (not (= (select (store |c_#valid| v_arrayElimCell_16 1) v_arrayElimCell_14) 0)) (and .cse0 .cse1 (forall ((v_ArrVal_934 (Array Int Int)) (v_arrayElimCell_15 Int)) (= ~unnamed1~0~BLACK (select (select (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_930)) v_arrayElimCell_16 v_ArrVal_927) v_arrayElimCell_17 v_ArrVal_932) v_arrayElimCell_14 v_ArrVal_934) v_arrayElimCell_15 v_ArrVal_935) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 16))))) (let ((.cse4 (not .cse0))) (and (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_930))) (.cse3 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 16))) (or (and (= ~unnamed1~0~BLACK (select (select (store (store .cse2 v_arrayElimCell_16 v_ArrVal_932) v_arrayElimCell_14 v_ArrVal_935) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3)) .cse4) (and (= ~unnamed1~0~BLACK (select (select (store (store (store .cse2 v_arrayElimCell_16 v_ArrVal_927) v_arrayElimCell_17 v_ArrVal_932) v_arrayElimCell_14 v_ArrVal_935) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3)) .cse0))) (or (not .cse1) .cse4))) (not (= (select |c_#valid| v_arrayElimCell_16) 0))))) is different from false [2022-01-10 00:51:22,782 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 00:51:22,787 INFO L353 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2022-01-10 00:51:22,787 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 121 treesize of output 1 [2022-01-10 00:51:22,788 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-01-10 00:51:22,788 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1085310101] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 00:51:22,788 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 00:51:22,788 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 13 [2022-01-10 00:51:22,788 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152126020] [2022-01-10 00:51:22,788 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 00:51:22,789 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-01-10 00:51:22,789 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:51:22,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-01-10 00:51:22,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=101, Unknown=1, NotChecked=20, Total=156 [2022-01-10 00:51:22,789 INFO L87 Difference]: Start difference. First operand 37 states and 40 transitions. Second operand has 13 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 13 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:51:23,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:51:23,032 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2022-01-10 00:51:23,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-10 00:51:23,033 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 13 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-01-10 00:51:23,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:51:23,033 INFO L225 Difference]: With dead ends: 49 [2022-01-10 00:51:23,033 INFO L226 Difference]: Without dead ends: 47 [2022-01-10 00:51:23,033 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=172, Unknown=2, NotChecked=28, Total=272 [2022-01-10 00:51:23,034 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 126 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 55 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 00:51:23,034 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [126 Valid, 93 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 88 Invalid, 0 Unknown, 55 Unchecked, 0.1s Time] [2022-01-10 00:51:23,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-01-10 00:51:23,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 35. [2022-01-10 00:51:23,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 34 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:51:23,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2022-01-10 00:51:23,039 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 21 [2022-01-10 00:51:23,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:51:23,039 INFO L470 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2022-01-10 00:51:23,039 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 13 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:51:23,039 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2022-01-10 00:51:23,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-01-10 00:51:23,039 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:51:23,039 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-01-10 00:51:23,056 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-10 00:51:23,250 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,SelfDestructingSolverStorable8 [2022-01-10 00:51:23,250 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-01-10 00:51:23,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:51:23,251 INFO L85 PathProgramCache]: Analyzing trace with hash 1438350182, now seen corresponding path program 1 times [2022-01-10 00:51:23,251 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:51:23,251 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547875005] [2022-01-10 00:51:23,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:51:23,251 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:51:23,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:51:23,455 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 00:51:23,456 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:51:23,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547875005] [2022-01-10 00:51:23,456 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547875005] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 00:51:23,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1910863108] [2022-01-10 00:51:23,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:51:23,456 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 00:51:23,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 00:51:23,457 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 00:51:23,475 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-01-10 00:51:23,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:51:23,625 INFO L263 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 83 conjunts are in the unsatisfiable core [2022-01-10 00:51:23,630 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 00:51:23,648 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-01-10 00:51:23,649 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2022-01-10 00:51:23,700 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 27 [2022-01-10 00:51:23,704 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 35 [2022-01-10 00:51:23,716 INFO L353 Elim1Store]: treesize reduction 50, result has 9.1 percent of original size [2022-01-10 00:51:23,716 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 90 treesize of output 78 [2022-01-10 00:51:23,719 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:51:23,721 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:51:23,721 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:51:23,722 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 00:51:23,723 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 25 [2022-01-10 00:51:23,726 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 28 [2022-01-10 00:51:23,736 INFO L353 Elim1Store]: treesize reduction 26, result has 35.0 percent of original size [2022-01-10 00:51:23,736 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 29 [2022-01-10 00:51:23,779 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:51:23,780 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:51:23,781 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:51:23,793 INFO L353 Elim1Store]: treesize reduction 59, result has 25.3 percent of original size [2022-01-10 00:51:23,794 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 89 treesize of output 82 [2022-01-10 00:51:23,800 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 51 [2022-01-10 00:51:23,803 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:51:23,822 INFO L353 Elim1Store]: treesize reduction 115, result has 8.7 percent of original size [2022-01-10 00:51:23,822 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 104 treesize of output 92 [2022-01-10 00:51:23,825 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 60 [2022-01-10 00:51:23,837 INFO L353 Elim1Store]: treesize reduction 8, result has 82.2 percent of original size [2022-01-10 00:51:23,837 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 46 [2022-01-10 00:51:23,840 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2022-01-10 00:51:24,149 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-01-10 00:51:24,150 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 82 treesize of output 53 [2022-01-10 00:51:24,189 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-10 00:51:24,189 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 23 [2022-01-10 00:51:24,192 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 00:51:24,192 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 00:51:24,283 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 00:51:24,283 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 125 treesize of output 125 [2022-01-10 00:51:24,287 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 00:51:24,287 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 119 treesize of output 107 [2022-01-10 00:51:24,701 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_10 (Array Int Int)) (v_ArrVal_1247 (Array Int Int)) (v_ArrVal_1246 (Array Int Int)) (v_ArrVal_1256 (Array Int Int)) (v_ArrVal_1243 (Array Int Int)) (v_ArrVal_1253 (Array Int Int)) (v_arrayElimArr_9 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base| v_arrayElimArr_10)) (.cse0 (select v_arrayElimArr_10 |c_ULTIMATE.start_main_~end~0#1.offset|))) (let ((.cse1 (select (select (store .cse3 .cse0 v_ArrVal_1253) |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (or (not (= (select |c_#valid| .cse0) 0)) (and (forall ((v_ArrVal_1241 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~end~0#1.base| v_arrayElimArr_9) (select v_arrayElimArr_10 |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_1241) |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) |c_ULTIMATE.start_main_~null~0#1.offset|)) (= |c_ULTIMATE.start_main_~null~0#1.base| .cse1)) (not (= (select v_arrayElimArr_9 |c_ULTIMATE.start_main_~end~0#1.offset|) 0)) (not (= |c_ULTIMATE.start_main_~null~0#1.base| (select (let ((.cse2 (store (store .cse3 .cse0 v_ArrVal_1247) .cse1 v_ArrVal_1243))) (select .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|))) (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~end~0#1.base| v_arrayElimArr_9) .cse0 v_ArrVal_1256) .cse1 v_ArrVal_1246) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|)))))))) is different from false [2022-01-10 00:51:24,719 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 00:51:24,719 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 642 treesize of output 514 [2022-01-10 00:51:24,725 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 00:51:24,725 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 514 treesize of output 370 [2022-01-10 00:51:28,821 INFO L353 Elim1Store]: treesize reduction 4447, result has 32.7 percent of original size [2022-01-10 00:51:28,825 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 20 select indices, 20 select index equivalence classes, 0 disjoint index pairs (out of 190 index pairs), introduced 23 new quantified variables, introduced 190 case distinctions, treesize of input 2295905 treesize of output 2172445 [2022-01-10 00:51:34,129 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 00:51:34,137 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 4678012 treesize of output 4197579