./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loop-invgen/heapsort.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e8d55036 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/loop-invgen/heapsort.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8e7c8e5dc2a9e8f11b25d1bb9948f05f37b9553e3dc9f8bd8213088dea43cb37 --- Real Ultimate output --- This is Ultimate 0.2.2-?-e8d5503-m [2023-02-15 20:04:32,963 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-15 20:04:32,965 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-15 20:04:32,990 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-15 20:04:32,993 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-15 20:04:32,995 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-15 20:04:32,996 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-15 20:04:32,998 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-15 20:04:33,001 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-15 20:04:33,004 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-15 20:04:33,005 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-15 20:04:33,006 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-15 20:04:33,007 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-15 20:04:33,009 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-15 20:04:33,010 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-15 20:04:33,012 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-15 20:04:33,012 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-15 20:04:33,013 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-15 20:04:33,014 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-15 20:04:33,018 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-15 20:04:33,019 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-15 20:04:33,020 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-15 20:04:33,020 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-15 20:04:33,021 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-15 20:04:33,027 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-15 20:04:33,027 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-15 20:04:33,027 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-15 20:04:33,028 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-15 20:04:33,028 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-15 20:04:33,029 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-15 20:04:33,029 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-15 20:04:33,029 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-15 20:04:33,030 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-15 20:04:33,031 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-15 20:04:33,032 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-15 20:04:33,032 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-15 20:04:33,033 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-15 20:04:33,033 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-15 20:04:33,033 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-15 20:04:33,034 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-15 20:04:33,035 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-15 20:04:33,037 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-02-15 20:04:33,059 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-15 20:04:33,060 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-15 20:04:33,060 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-15 20:04:33,060 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-15 20:04:33,061 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-15 20:04:33,061 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-15 20:04:33,061 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-15 20:04:33,061 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-15 20:04:33,061 INFO L138 SettingsManager]: * Use SBE=true [2023-02-15 20:04:33,062 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-15 20:04:33,062 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-15 20:04:33,062 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-15 20:04:33,063 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-15 20:04:33,063 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-15 20:04:33,063 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-15 20:04:33,063 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-15 20:04:33,063 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-15 20:04:33,063 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-15 20:04:33,063 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-15 20:04:33,063 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-15 20:04:33,064 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-15 20:04:33,064 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-15 20:04:33,064 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-15 20:04:33,064 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-15 20:04:33,064 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 20:04:33,064 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-15 20:04:33,064 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-15 20:04:33,065 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-15 20:04:33,065 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-15 20:04:33,065 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-15 20:04:33,065 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-15 20:04:33,065 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-15 20:04:33,066 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-15 20:04:33,066 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-15 20:04:33,066 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-15 20:04:33,066 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8e7c8e5dc2a9e8f11b25d1bb9948f05f37b9553e3dc9f8bd8213088dea43cb37 [2023-02-15 20:04:33,279 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-15 20:04:33,295 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-15 20:04:33,297 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-15 20:04:33,298 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-15 20:04:33,298 INFO L275 PluginConnector]: CDTParser initialized [2023-02-15 20:04:33,299 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-invgen/heapsort.i [2023-02-15 20:04:34,180 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-15 20:04:34,387 INFO L351 CDTParser]: Found 1 translation units. [2023-02-15 20:04:34,388 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/heapsort.i [2023-02-15 20:04:34,394 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a620f770/ed523b97e19946348910f7bcdd9550f0/FLAGaf8060771 [2023-02-15 20:04:34,782 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a620f770/ed523b97e19946348910f7bcdd9550f0 [2023-02-15 20:04:34,797 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-15 20:04:34,813 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-15 20:04:34,814 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-15 20:04:34,814 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-15 20:04:34,817 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-15 20:04:34,817 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 08:04:34" (1/1) ... [2023-02-15 20:04:34,819 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44f824fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 08:04:34, skipping insertion in model container [2023-02-15 20:04:34,820 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 08:04:34" (1/1) ... [2023-02-15 20:04:34,824 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-15 20:04:34,834 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 20:04:34,912 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/heapsort.i[893,906] [2023-02-15 20:04:34,923 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 20:04:34,928 INFO L203 MainTranslator]: Completed pre-run [2023-02-15 20:04:34,935 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/heapsort.i[893,906] [2023-02-15 20:04:34,940 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 20:04:34,948 INFO L208 MainTranslator]: Completed translation [2023-02-15 20:04:34,948 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 08:04:34 WrapperNode [2023-02-15 20:04:34,948 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-15 20:04:34,949 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-15 20:04:34,949 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-15 20:04:34,949 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-15 20:04:34,953 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 08:04:34" (1/1) ... [2023-02-15 20:04:34,958 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 08:04:34" (1/1) ... [2023-02-15 20:04:34,968 INFO L138 Inliner]: procedures = 16, calls = 20, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 77 [2023-02-15 20:04:34,969 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-15 20:04:34,969 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-15 20:04:34,969 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-15 20:04:34,969 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-15 20:04:34,974 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 08:04:34" (1/1) ... [2023-02-15 20:04:34,974 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 08:04:34" (1/1) ... [2023-02-15 20:04:34,975 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 08:04:34" (1/1) ... [2023-02-15 20:04:34,976 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 08:04:34" (1/1) ... [2023-02-15 20:04:34,978 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 08:04:34" (1/1) ... [2023-02-15 20:04:34,980 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 08:04:34" (1/1) ... [2023-02-15 20:04:34,980 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 08:04:34" (1/1) ... [2023-02-15 20:04:34,981 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 08:04:34" (1/1) ... [2023-02-15 20:04:34,982 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-15 20:04:34,983 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-15 20:04:34,983 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-15 20:04:34,983 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-15 20:04:34,983 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 08:04:34" (1/1) ... [2023-02-15 20:04:34,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 20:04:34,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 20:04:35,009 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) [2023-02-15 20:04:35,025 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 [2023-02-15 20:04:35,035 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-15 20:04:35,036 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-15 20:04:35,036 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-15 20:04:35,036 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-15 20:04:35,036 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-02-15 20:04:35,036 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-02-15 20:04:35,075 INFO L235 CfgBuilder]: Building ICFG [2023-02-15 20:04:35,076 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-15 20:04:35,217 INFO L276 CfgBuilder]: Performing block encoding [2023-02-15 20:04:35,231 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-15 20:04:35,231 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2023-02-15 20:04:35,233 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 08:04:35 BoogieIcfgContainer [2023-02-15 20:04:35,233 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-15 20:04:35,249 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-15 20:04:35,249 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-15 20:04:35,251 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-15 20:04:35,251 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.02 08:04:34" (1/3) ... [2023-02-15 20:04:35,252 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e91abdd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 08:04:35, skipping insertion in model container [2023-02-15 20:04:35,252 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 08:04:34" (2/3) ... [2023-02-15 20:04:35,252 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e91abdd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 08:04:35, skipping insertion in model container [2023-02-15 20:04:35,252 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 08:04:35" (3/3) ... [2023-02-15 20:04:35,253 INFO L112 eAbstractionObserver]: Analyzing ICFG heapsort.i [2023-02-15 20:04:35,264 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-15 20:04:35,264 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-15 20:04:35,315 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-15 20:04:35,321 INFO L357 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@2ef0bd45, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-15 20:04:35,322 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-15 20:04:35,324 INFO L276 IsEmpty]: Start isEmpty. Operand has 39 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 23 states have internal predecessors, (34), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2023-02-15 20:04:35,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-02-15 20:04:35,330 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 20:04:35,330 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 20:04:35,331 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 20:04:35,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 20:04:35,335 INFO L85 PathProgramCache]: Analyzing trace with hash -1754201352, now seen corresponding path program 1 times [2023-02-15 20:04:35,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 20:04:35,341 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246498495] [2023-02-15 20:04:35,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 20:04:35,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 20:04:35,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 20:04:35,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 20:04:35,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 20:04:35,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246498495] [2023-02-15 20:04:35,604 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246498495] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 20:04:35,605 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 20:04:35,605 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 20:04:35,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416974831] [2023-02-15 20:04:35,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 20:04:35,609 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 20:04:35,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 20:04:35,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 20:04:35,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 20:04:35,646 INFO L87 Difference]: Start difference. First operand has 39 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 23 states have internal predecessors, (34), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 20:04:35,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 20:04:35,756 INFO L93 Difference]: Finished difference Result 104 states and 193 transitions. [2023-02-15 20:04:35,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 20:04:35,760 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2023-02-15 20:04:35,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 20:04:35,766 INFO L225 Difference]: With dead ends: 104 [2023-02-15 20:04:35,766 INFO L226 Difference]: Without dead ends: 61 [2023-02-15 20:04:35,769 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-15 20:04:35,773 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 25 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 20:04:35,774 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 220 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 20:04:35,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2023-02-15 20:04:35,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 39. [2023-02-15 20:04:35,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 22 states have internal predecessors, (29), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2023-02-15 20:04:35,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 57 transitions. [2023-02-15 20:04:35,809 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 57 transitions. Word has length 11 [2023-02-15 20:04:35,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 20:04:35,810 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 57 transitions. [2023-02-15 20:04:35,810 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 20:04:35,810 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 57 transitions. [2023-02-15 20:04:35,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-02-15 20:04:35,811 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 20:04:35,811 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 20:04:35,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-15 20:04:35,811 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 20:04:35,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 20:04:35,812 INFO L85 PathProgramCache]: Analyzing trace with hash -1749464583, now seen corresponding path program 1 times [2023-02-15 20:04:35,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 20:04:35,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029486858] [2023-02-15 20:04:35,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 20:04:35,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 20:04:35,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 20:04:35,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 20:04:35,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 20:04:35,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029486858] [2023-02-15 20:04:35,897 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029486858] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 20:04:35,897 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 20:04:35,897 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 20:04:35,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275569073] [2023-02-15 20:04:35,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 20:04:35,908 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 20:04:35,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 20:04:35,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 20:04:35,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 20:04:35,910 INFO L87 Difference]: Start difference. First operand 39 states and 57 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 20:04:35,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 20:04:35,969 INFO L93 Difference]: Finished difference Result 46 states and 63 transitions. [2023-02-15 20:04:35,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 20:04:35,970 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2023-02-15 20:04:35,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 20:04:35,971 INFO L225 Difference]: With dead ends: 46 [2023-02-15 20:04:35,971 INFO L226 Difference]: Without dead ends: 44 [2023-02-15 20:04:35,971 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-15 20:04:35,972 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 17 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 20:04:35,973 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 137 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 20:04:35,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2023-02-15 20:04:35,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2023-02-15 20:04:35,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 25 states have (on average 1.28) internal successors, (32), 25 states have internal predecessors, (32), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2023-02-15 20:04:35,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 60 transitions. [2023-02-15 20:04:35,979 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 60 transitions. Word has length 11 [2023-02-15 20:04:35,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 20:04:35,979 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 60 transitions. [2023-02-15 20:04:35,979 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 20:04:35,979 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 60 transitions. [2023-02-15 20:04:35,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-02-15 20:04:35,980 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 20:04:35,980 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 20:04:35,980 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-15 20:04:35,980 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 20:04:35,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 20:04:35,981 INFO L85 PathProgramCache]: Analyzing trace with hash -1728015063, now seen corresponding path program 1 times [2023-02-15 20:04:35,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 20:04:35,981 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159409421] [2023-02-15 20:04:35,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 20:04:35,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 20:04:35,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 20:04:36,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 20:04:36,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 20:04:36,048 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159409421] [2023-02-15 20:04:36,049 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159409421] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 20:04:36,049 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 20:04:36,049 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-15 20:04:36,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128488369] [2023-02-15 20:04:36,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 20:04:36,050 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 20:04:36,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 20:04:36,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 20:04:36,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-15 20:04:36,051 INFO L87 Difference]: Start difference. First operand 43 states and 60 transitions. Second operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 20:04:36,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 20:04:36,155 INFO L93 Difference]: Finished difference Result 76 states and 111 transitions. [2023-02-15 20:04:36,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-15 20:04:36,155 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2023-02-15 20:04:36,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 20:04:36,157 INFO L225 Difference]: With dead ends: 76 [2023-02-15 20:04:36,157 INFO L226 Difference]: Without dead ends: 74 [2023-02-15 20:04:36,157 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-02-15 20:04:36,158 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 33 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 20:04:36,158 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 184 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 20:04:36,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2023-02-15 20:04:36,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 69. [2023-02-15 20:04:36,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 38 states have (on average 1.3157894736842106) internal successors, (50), 38 states have internal predecessors, (50), 26 states have call successors, (26), 4 states have call predecessors, (26), 4 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2023-02-15 20:04:36,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 102 transitions. [2023-02-15 20:04:36,167 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 102 transitions. Word has length 11 [2023-02-15 20:04:36,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 20:04:36,168 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 102 transitions. [2023-02-15 20:04:36,168 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 20:04:36,168 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 102 transitions. [2023-02-15 20:04:36,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-02-15 20:04:36,169 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 20:04:36,169 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 20:04:36,169 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-15 20:04:36,169 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 20:04:36,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 20:04:36,170 INFO L85 PathProgramCache]: Analyzing trace with hash -1885075524, now seen corresponding path program 1 times [2023-02-15 20:04:36,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 20:04:36,170 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596573206] [2023-02-15 20:04:36,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 20:04:36,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 20:04:36,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 20:04:36,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-02-15 20:04:36,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 20:04:36,271 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 20:04:36,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 20:04:36,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596573206] [2023-02-15 20:04:36,272 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596573206] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 20:04:36,272 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 20:04:36,272 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-15 20:04:36,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921269163] [2023-02-15 20:04:36,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 20:04:36,273 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-15 20:04:36,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 20:04:36,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-15 20:04:36,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-02-15 20:04:36,275 INFO L87 Difference]: Start difference. First operand 69 states and 102 transitions. Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 20:04:36,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 20:04:36,438 INFO L93 Difference]: Finished difference Result 102 states and 153 transitions. [2023-02-15 20:04:36,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-15 20:04:36,438 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2023-02-15 20:04:36,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 20:04:36,442 INFO L225 Difference]: With dead ends: 102 [2023-02-15 20:04:36,442 INFO L226 Difference]: Without dead ends: 100 [2023-02-15 20:04:36,443 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-02-15 20:04:36,449 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 44 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 20:04:36,451 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 217 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 20:04:36,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2023-02-15 20:04:36,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 97. [2023-02-15 20:04:36,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 51 states have (on average 1.3333333333333333) internal successors, (68), 52 states have internal predecessors, (68), 40 states have call successors, (40), 5 states have call predecessors, (40), 5 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) [2023-02-15 20:04:36,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 148 transitions. [2023-02-15 20:04:36,485 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 148 transitions. Word has length 16 [2023-02-15 20:04:36,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 20:04:36,486 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 148 transitions. [2023-02-15 20:04:36,486 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 20:04:36,486 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 148 transitions. [2023-02-15 20:04:36,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-02-15 20:04:36,487 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 20:04:36,487 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 20:04:36,487 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-02-15 20:04:36,487 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 20:04:36,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 20:04:36,488 INFO L85 PathProgramCache]: Analyzing trace with hash -1503713061, now seen corresponding path program 1 times [2023-02-15 20:04:36,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 20:04:36,489 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815508941] [2023-02-15 20:04:36,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 20:04:36,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 20:04:36,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 20:04:36,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-02-15 20:04:36,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 20:04:36,537 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 20:04:36,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 20:04:36,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815508941] [2023-02-15 20:04:36,537 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815508941] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 20:04:36,538 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 20:04:36,538 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 20:04:36,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967134560] [2023-02-15 20:04:36,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 20:04:36,538 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 20:04:36,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 20:04:36,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 20:04:36,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 20:04:36,539 INFO L87 Difference]: Start difference. First operand 97 states and 148 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 20:04:36,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 20:04:36,586 INFO L93 Difference]: Finished difference Result 103 states and 153 transitions. [2023-02-15 20:04:36,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 20:04:36,586 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2023-02-15 20:04:36,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 20:04:36,588 INFO L225 Difference]: With dead ends: 103 [2023-02-15 20:04:36,588 INFO L226 Difference]: Without dead ends: 101 [2023-02-15 20:04:36,588 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-15 20:04:36,589 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 16 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 20:04:36,589 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 125 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 20:04:36,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2023-02-15 20:04:36,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2023-02-15 20:04:36,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 54 states have (on average 1.3148148148148149) internal successors, (71), 55 states have internal predecessors, (71), 40 states have call successors, (40), 6 states have call predecessors, (40), 6 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) [2023-02-15 20:04:36,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 151 transitions. [2023-02-15 20:04:36,602 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 151 transitions. Word has length 16 [2023-02-15 20:04:36,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 20:04:36,602 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 151 transitions. [2023-02-15 20:04:36,602 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 20:04:36,602 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 151 transitions. [2023-02-15 20:04:36,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-02-15 20:04:36,603 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 20:04:36,603 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 20:04:36,603 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-02-15 20:04:36,604 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 20:04:36,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 20:04:36,604 INFO L85 PathProgramCache]: Analyzing trace with hash -1518715221, now seen corresponding path program 1 times [2023-02-15 20:04:36,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 20:04:36,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257063791] [2023-02-15 20:04:36,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 20:04:36,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 20:04:36,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 20:04:36,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-02-15 20:04:36,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 20:04:36,664 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 20:04:36,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 20:04:36,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257063791] [2023-02-15 20:04:36,665 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257063791] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 20:04:36,665 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 20:04:36,665 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-15 20:04:36,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65268959] [2023-02-15 20:04:36,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 20:04:36,665 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-15 20:04:36,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 20:04:36,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-15 20:04:36,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-02-15 20:04:36,666 INFO L87 Difference]: Start difference. First operand 101 states and 151 transitions. Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 20:04:36,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 20:04:36,829 INFO L93 Difference]: Finished difference Result 155 states and 240 transitions. [2023-02-15 20:04:36,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-15 20:04:36,829 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2023-02-15 20:04:36,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 20:04:36,831 INFO L225 Difference]: With dead ends: 155 [2023-02-15 20:04:36,831 INFO L226 Difference]: Without dead ends: 153 [2023-02-15 20:04:36,831 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-02-15 20:04:36,832 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 60 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 20:04:36,832 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 245 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 20:04:36,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2023-02-15 20:04:36,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 137. [2023-02-15 20:04:36,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 69 states have (on average 1.3623188405797102) internal successors, (94), 72 states have internal predecessors, (94), 60 states have call successors, (60), 7 states have call predecessors, (60), 7 states have return successors, (60), 57 states have call predecessors, (60), 60 states have call successors, (60) [2023-02-15 20:04:36,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 214 transitions. [2023-02-15 20:04:36,850 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 214 transitions. Word has length 16 [2023-02-15 20:04:36,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 20:04:36,850 INFO L495 AbstractCegarLoop]: Abstraction has 137 states and 214 transitions. [2023-02-15 20:04:36,850 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 20:04:36,850 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 214 transitions. [2023-02-15 20:04:36,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-02-15 20:04:36,851 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 20:04:36,851 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 20:04:36,851 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-02-15 20:04:36,851 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 20:04:36,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 20:04:36,852 INFO L85 PathProgramCache]: Analyzing trace with hash 1823085758, now seen corresponding path program 1 times [2023-02-15 20:04:36,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 20:04:36,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056209962] [2023-02-15 20:04:36,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 20:04:36,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 20:04:36,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 20:04:36,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-02-15 20:04:36,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 20:04:36,865 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 20:04:36,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 20:04:36,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056209962] [2023-02-15 20:04:36,866 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056209962] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 20:04:36,866 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 20:04:36,866 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 20:04:36,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138758598] [2023-02-15 20:04:36,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 20:04:36,866 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 20:04:36,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 20:04:36,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 20:04:36,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 20:04:36,867 INFO L87 Difference]: Start difference. First operand 137 states and 214 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 20:04:36,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 20:04:36,893 INFO L93 Difference]: Finished difference Result 274 states and 436 transitions. [2023-02-15 20:04:36,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 20:04:36,893 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2023-02-15 20:04:36,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 20:04:36,894 INFO L225 Difference]: With dead ends: 274 [2023-02-15 20:04:36,894 INFO L226 Difference]: Without dead ends: 205 [2023-02-15 20:04:36,895 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 20:04:36,896 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 11 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 20:04:36,896 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 115 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 20:04:36,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2023-02-15 20:04:36,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2023-02-15 20:04:36,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 99 states have (on average 1.404040404040404) internal successors, (139), 103 states have internal predecessors, (139), 98 states have call successors, (98), 7 states have call predecessors, (98), 7 states have return successors, (98), 94 states have call predecessors, (98), 98 states have call successors, (98) [2023-02-15 20:04:36,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 335 transitions. [2023-02-15 20:04:36,918 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 335 transitions. Word has length 16 [2023-02-15 20:04:36,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 20:04:36,918 INFO L495 AbstractCegarLoop]: Abstraction has 205 states and 335 transitions. [2023-02-15 20:04:36,918 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 20:04:36,918 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 335 transitions. [2023-02-15 20:04:36,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-02-15 20:04:36,919 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 20:04:36,919 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 20:04:36,919 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-02-15 20:04:36,919 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 20:04:36,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 20:04:36,920 INFO L85 PathProgramCache]: Analyzing trace with hash -2105521235, now seen corresponding path program 1 times [2023-02-15 20:04:36,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 20:04:36,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880918383] [2023-02-15 20:04:36,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 20:04:36,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 20:04:36,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 20:04:36,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-02-15 20:04:36,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 20:04:36,944 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 20:04:36,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 20:04:36,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880918383] [2023-02-15 20:04:36,945 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880918383] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 20:04:36,945 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 20:04:36,945 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 20:04:36,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978498213] [2023-02-15 20:04:36,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 20:04:36,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 20:04:36,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 20:04:36,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 20:04:36,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 20:04:36,946 INFO L87 Difference]: Start difference. First operand 205 states and 335 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 20:04:36,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 20:04:36,989 INFO L93 Difference]: Finished difference Result 224 states and 350 transitions. [2023-02-15 20:04:36,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 20:04:36,990 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), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2023-02-15 20:04:36,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 20:04:36,991 INFO L225 Difference]: With dead ends: 224 [2023-02-15 20:04:36,991 INFO L226 Difference]: Without dead ends: 183 [2023-02-15 20:04:36,992 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-15 20:04:36,992 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 0 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 20:04:36,992 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 131 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 20:04:36,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2023-02-15 20:04:37,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2023-02-15 20:04:37,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 89 states have (on average 1.3932584269662922) internal successors, (124), 93 states have internal predecessors, (124), 86 states have call successors, (86), 7 states have call predecessors, (86), 7 states have return successors, (86), 82 states have call predecessors, (86), 86 states have call successors, (86) [2023-02-15 20:04:37,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 296 transitions. [2023-02-15 20:04:37,010 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 296 transitions. Word has length 16 [2023-02-15 20:04:37,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 20:04:37,010 INFO L495 AbstractCegarLoop]: Abstraction has 183 states and 296 transitions. [2023-02-15 20:04:37,011 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 20:04:37,011 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 296 transitions. [2023-02-15 20:04:37,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-02-15 20:04:37,011 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 20:04:37,011 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 20:04:37,012 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-02-15 20:04:37,012 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 20:04:37,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 20:04:37,012 INFO L85 PathProgramCache]: Analyzing trace with hash 186914675, now seen corresponding path program 1 times [2023-02-15 20:04:37,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 20:04:37,012 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030458266] [2023-02-15 20:04:37,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 20:04:37,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 20:04:37,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 20:04:37,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-02-15 20:04:37,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 20:04:37,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-15 20:04:37,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 20:04:37,060 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-15 20:04:37,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 20:04:37,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030458266] [2023-02-15 20:04:37,061 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030458266] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 20:04:37,061 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 20:04:37,061 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-15 20:04:37,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194519095] [2023-02-15 20:04:37,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 20:04:37,061 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 20:04:37,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 20:04:37,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 20:04:37,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-15 20:04:37,062 INFO L87 Difference]: Start difference. First operand 183 states and 296 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-15 20:04:37,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 20:04:37,142 INFO L93 Difference]: Finished difference Result 217 states and 348 transitions. [2023-02-15 20:04:37,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-15 20:04:37,142 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 23 [2023-02-15 20:04:37,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 20:04:37,143 INFO L225 Difference]: With dead ends: 217 [2023-02-15 20:04:37,144 INFO L226 Difference]: Without dead ends: 215 [2023-02-15 20:04:37,144 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-02-15 20:04:37,144 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 44 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 20:04:37,145 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 293 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 20:04:37,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2023-02-15 20:04:37,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 197. [2023-02-15 20:04:37,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 96 states have (on average 1.3854166666666667) internal successors, (133), 102 states have internal predecessors, (133), 92 states have call successors, (92), 8 states have call predecessors, (92), 8 states have return successors, (92), 86 states have call predecessors, (92), 92 states have call successors, (92) [2023-02-15 20:04:37,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 317 transitions. [2023-02-15 20:04:37,163 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 317 transitions. Word has length 23 [2023-02-15 20:04:37,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 20:04:37,163 INFO L495 AbstractCegarLoop]: Abstraction has 197 states and 317 transitions. [2023-02-15 20:04:37,164 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-15 20:04:37,164 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 317 transitions. [2023-02-15 20:04:37,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-02-15 20:04:37,164 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 20:04:37,164 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 20:04:37,165 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-02-15 20:04:37,165 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 20:04:37,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 20:04:37,165 INFO L85 PathProgramCache]: Analyzing trace with hash 768784003, now seen corresponding path program 1 times [2023-02-15 20:04:37,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 20:04:37,165 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363447963] [2023-02-15 20:04:37,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 20:04:37,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 20:04:37,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 20:04:37,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-02-15 20:04:37,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 20:04:37,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-15 20:04:37,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 20:04:37,201 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-15 20:04:37,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 20:04:37,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363447963] [2023-02-15 20:04:37,201 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363447963] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 20:04:37,201 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 20:04:37,201 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 20:04:37,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773151097] [2023-02-15 20:04:37,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 20:04:37,202 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 20:04:37,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 20:04:37,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 20:04:37,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-02-15 20:04:37,203 INFO L87 Difference]: Start difference. First operand 197 states and 317 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-15 20:04:37,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 20:04:37,389 INFO L93 Difference]: Finished difference Result 520 states and 854 transitions. [2023-02-15 20:04:37,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 20:04:37,389 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 25 [2023-02-15 20:04:37,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 20:04:37,391 INFO L225 Difference]: With dead ends: 520 [2023-02-15 20:04:37,391 INFO L226 Difference]: Without dead ends: 366 [2023-02-15 20:04:37,392 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-02-15 20:04:37,392 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 65 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 20:04:37,393 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 152 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 20:04:37,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2023-02-15 20:04:37,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 197. [2023-02-15 20:04:37,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 96 states have (on average 1.3645833333333333) internal successors, (131), 102 states have internal predecessors, (131), 92 states have call successors, (92), 8 states have call predecessors, (92), 8 states have return successors, (92), 86 states have call predecessors, (92), 92 states have call successors, (92) [2023-02-15 20:04:37,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 315 transitions. [2023-02-15 20:04:37,417 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 315 transitions. Word has length 25 [2023-02-15 20:04:37,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 20:04:37,418 INFO L495 AbstractCegarLoop]: Abstraction has 197 states and 315 transitions. [2023-02-15 20:04:37,418 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-15 20:04:37,418 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 315 transitions. [2023-02-15 20:04:37,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-02-15 20:04:37,419 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 20:04:37,419 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 20:04:37,419 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-02-15 20:04:37,419 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 20:04:37,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 20:04:37,420 INFO L85 PathProgramCache]: Analyzing trace with hash -299150037, now seen corresponding path program 1 times [2023-02-15 20:04:37,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 20:04:37,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029425481] [2023-02-15 20:04:37,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 20:04:37,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 20:04:37,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 20:04:37,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-02-15 20:04:37,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 20:04:37,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-15 20:04:37,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 20:04:37,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-02-15 20:04:37,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 20:04:37,467 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-02-15 20:04:37,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 20:04:37,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029425481] [2023-02-15 20:04:37,468 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029425481] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 20:04:37,468 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 20:04:37,468 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-15 20:04:37,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564168535] [2023-02-15 20:04:37,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 20:04:37,468 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 20:04:37,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 20:04:37,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 20:04:37,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-15 20:04:37,469 INFO L87 Difference]: Start difference. First operand 197 states and 315 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-15 20:04:37,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 20:04:37,597 INFO L93 Difference]: Finished difference Result 291 states and 471 transitions. [2023-02-15 20:04:37,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 20:04:37,597 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 26 [2023-02-15 20:04:37,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 20:04:37,599 INFO L225 Difference]: With dead ends: 291 [2023-02-15 20:04:37,599 INFO L226 Difference]: Without dead ends: 289 [2023-02-15 20:04:37,599 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-02-15 20:04:37,600 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 26 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 20:04:37,600 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 183 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 20:04:37,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2023-02-15 20:04:37,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 269. [2023-02-15 20:04:37,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 118 states have (on average 1.3644067796610169) internal successors, (161), 132 states have internal predecessors, (161), 140 states have call successors, (140), 10 states have call predecessors, (140), 10 states have return successors, (140), 126 states have call predecessors, (140), 140 states have call successors, (140) [2023-02-15 20:04:37,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 441 transitions. [2023-02-15 20:04:37,629 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 441 transitions. Word has length 26 [2023-02-15 20:04:37,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 20:04:37,629 INFO L495 AbstractCegarLoop]: Abstraction has 269 states and 441 transitions. [2023-02-15 20:04:37,630 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-15 20:04:37,630 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 441 transitions. [2023-02-15 20:04:37,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-02-15 20:04:37,630 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 20:04:37,630 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 20:04:37,631 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-02-15 20:04:37,631 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 20:04:37,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 20:04:37,631 INFO L85 PathProgramCache]: Analyzing trace with hash 1714235681, now seen corresponding path program 1 times [2023-02-15 20:04:37,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 20:04:37,631 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093151463] [2023-02-15 20:04:37,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 20:04:37,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 20:04:37,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 20:04:37,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-02-15 20:04:37,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 20:04:37,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-15 20:04:37,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 20:04:37,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-02-15 20:04:37,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 20:04:37,687 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-02-15 20:04:37,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 20:04:37,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093151463] [2023-02-15 20:04:37,688 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2093151463] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 20:04:37,688 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 20:04:37,688 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-15 20:04:37,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316802442] [2023-02-15 20:04:37,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 20:04:37,689 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-15 20:04:37,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 20:04:37,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-15 20:04:37,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-02-15 20:04:37,689 INFO L87 Difference]: Start difference. First operand 269 states and 441 transitions. Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-15 20:04:37,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 20:04:37,851 INFO L93 Difference]: Finished difference Result 317 states and 516 transitions. [2023-02-15 20:04:37,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-15 20:04:37,852 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 28 [2023-02-15 20:04:37,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 20:04:37,853 INFO L225 Difference]: With dead ends: 317 [2023-02-15 20:04:37,853 INFO L226 Difference]: Without dead ends: 315 [2023-02-15 20:04:37,853 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2023-02-15 20:04:37,854 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 72 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 20:04:37,854 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 197 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 20:04:37,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2023-02-15 20:04:37,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 287. [2023-02-15 20:04:37,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 125 states have (on average 1.36) internal successors, (170), 141 states have internal predecessors, (170), 150 states have call successors, (150), 11 states have call predecessors, (150), 11 states have return successors, (150), 134 states have call predecessors, (150), 150 states have call successors, (150) [2023-02-15 20:04:37,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 470 transitions. [2023-02-15 20:04:37,884 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 470 transitions. Word has length 28 [2023-02-15 20:04:37,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 20:04:37,884 INFO L495 AbstractCegarLoop]: Abstraction has 287 states and 470 transitions. [2023-02-15 20:04:37,884 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-15 20:04:37,885 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 470 transitions. [2023-02-15 20:04:37,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-02-15 20:04:37,885 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 20:04:37,885 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 20:04:37,885 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-02-15 20:04:37,886 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 20:04:37,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 20:04:37,886 INFO L85 PathProgramCache]: Analyzing trace with hash 523331784, now seen corresponding path program 1 times [2023-02-15 20:04:37,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 20:04:37,886 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375092114] [2023-02-15 20:04:37,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 20:04:37,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 20:04:37,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 20:04:37,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-02-15 20:04:37,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 20:04:37,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-15 20:04:37,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 20:04:37,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-02-15 20:04:37,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 20:04:37,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-02-15 20:04:37,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 20:04:37,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-02-15 20:04:37,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 20:04:37,938 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2023-02-15 20:04:37,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 20:04:37,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375092114] [2023-02-15 20:04:37,938 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375092114] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 20:04:37,938 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 20:04:37,938 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-15 20:04:37,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336167149] [2023-02-15 20:04:37,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 20:04:37,939 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-15 20:04:37,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 20:04:37,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-15 20:04:37,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-02-15 20:04:37,940 INFO L87 Difference]: Start difference. First operand 287 states and 470 transitions. Second operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-02-15 20:04:38,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 20:04:38,096 INFO L93 Difference]: Finished difference Result 329 states and 527 transitions. [2023-02-15 20:04:38,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-15 20:04:38,097 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 38 [2023-02-15 20:04:38,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 20:04:38,098 INFO L225 Difference]: With dead ends: 329 [2023-02-15 20:04:38,098 INFO L226 Difference]: Without dead ends: 327 [2023-02-15 20:04:38,099 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2023-02-15 20:04:38,099 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 37 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 20:04:38,099 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 182 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 20:04:38,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2023-02-15 20:04:38,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 291. [2023-02-15 20:04:38,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 128 states have (on average 1.3515625) internal successors, (173), 144 states have internal predecessors, (173), 150 states have call successors, (150), 12 states have call predecessors, (150), 12 states have return successors, (150), 134 states have call predecessors, (150), 150 states have call successors, (150) [2023-02-15 20:04:38,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 473 transitions. [2023-02-15 20:04:38,132 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 473 transitions. Word has length 38 [2023-02-15 20:04:38,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 20:04:38,132 INFO L495 AbstractCegarLoop]: Abstraction has 291 states and 473 transitions. [2023-02-15 20:04:38,132 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-02-15 20:04:38,132 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 473 transitions. [2023-02-15 20:04:38,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-02-15 20:04:38,133 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 20:04:38,133 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 20:04:38,133 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-02-15 20:04:38,133 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 20:04:38,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 20:04:38,134 INFO L85 PathProgramCache]: Analyzing trace with hash 1856149802, now seen corresponding path program 1 times [2023-02-15 20:04:38,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 20:04:38,134 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185269385] [2023-02-15 20:04:38,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 20:04:38,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 20:04:38,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 20:04:38,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-02-15 20:04:38,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 20:04:38,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-15 20:04:38,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 20:04:38,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-02-15 20:04:38,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 20:04:38,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-02-15 20:04:38,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 20:04:38,180 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-02-15 20:04:38,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 20:04:38,181 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185269385] [2023-02-15 20:04:38,181 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185269385] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 20:04:38,181 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 20:04:38,181 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-15 20:04:38,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083406710] [2023-02-15 20:04:38,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 20:04:38,181 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-15 20:04:38,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 20:04:38,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-15 20:04:38,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-02-15 20:04:38,182 INFO L87 Difference]: Start difference. First operand 291 states and 473 transitions. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-15 20:04:38,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 20:04:38,302 INFO L93 Difference]: Finished difference Result 297 states and 478 transitions. [2023-02-15 20:04:38,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-15 20:04:38,302 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 38 [2023-02-15 20:04:38,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 20:04:38,304 INFO L225 Difference]: With dead ends: 297 [2023-02-15 20:04:38,304 INFO L226 Difference]: Without dead ends: 295 [2023-02-15 20:04:38,304 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2023-02-15 20:04:38,305 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 31 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 20:04:38,305 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 103 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 20:04:38,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2023-02-15 20:04:38,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 295. [2023-02-15 20:04:38,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 131 states have (on average 1.3435114503816794) internal successors, (176), 147 states have internal predecessors, (176), 150 states have call successors, (150), 13 states have call predecessors, (150), 13 states have return successors, (150), 134 states have call predecessors, (150), 150 states have call successors, (150) [2023-02-15 20:04:38,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 476 transitions. [2023-02-15 20:04:38,335 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 476 transitions. Word has length 38 [2023-02-15 20:04:38,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 20:04:38,335 INFO L495 AbstractCegarLoop]: Abstraction has 295 states and 476 transitions. [2023-02-15 20:04:38,335 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-15 20:04:38,335 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 476 transitions. [2023-02-15 20:04:38,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2023-02-15 20:04:38,336 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 20:04:38,336 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 20:04:38,336 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-02-15 20:04:38,336 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 20:04:38,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 20:04:38,337 INFO L85 PathProgramCache]: Analyzing trace with hash 2019762676, now seen corresponding path program 1 times [2023-02-15 20:04:38,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 20:04:38,337 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360456903] [2023-02-15 20:04:38,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 20:04:38,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 20:04:38,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 20:04:38,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-02-15 20:04:38,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 20:04:38,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-15 20:04:38,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 20:04:38,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-02-15 20:04:38,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 20:04:38,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-02-15 20:04:38,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 20:04:38,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-02-15 20:04:38,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 20:04:38,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-15 20:04:38,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 20:04:38,394 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-02-15 20:04:38,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 20:04:38,395 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360456903] [2023-02-15 20:04:38,395 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360456903] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 20:04:38,395 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 20:04:38,395 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-15 20:04:38,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209248823] [2023-02-15 20:04:38,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 20:04:38,396 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-15 20:04:38,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 20:04:38,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-15 20:04:38,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-02-15 20:04:38,396 INFO L87 Difference]: Start difference. First operand 295 states and 476 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2023-02-15 20:04:38,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 20:04:38,509 INFO L93 Difference]: Finished difference Result 329 states and 525 transitions. [2023-02-15 20:04:38,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-15 20:04:38,509 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 50 [2023-02-15 20:04:38,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 20:04:38,511 INFO L225 Difference]: With dead ends: 329 [2023-02-15 20:04:38,511 INFO L226 Difference]: Without dead ends: 327 [2023-02-15 20:04:38,511 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2023-02-15 20:04:38,512 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 41 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 20:04:38,512 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 243 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 20:04:38,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2023-02-15 20:04:38,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 174. [2023-02-15 20:04:38,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 85 states have (on average 1.2705882352941176) internal successors, (108), 93 states have internal predecessors, (108), 76 states have call successors, (76), 12 states have call predecessors, (76), 12 states have return successors, (76), 68 states have call predecessors, (76), 76 states have call successors, (76) [2023-02-15 20:04:38,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 260 transitions. [2023-02-15 20:04:38,533 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 260 transitions. Word has length 50 [2023-02-15 20:04:38,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 20:04:38,533 INFO L495 AbstractCegarLoop]: Abstraction has 174 states and 260 transitions. [2023-02-15 20:04:38,533 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2023-02-15 20:04:38,533 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 260 transitions. [2023-02-15 20:04:38,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-02-15 20:04:38,534 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 20:04:38,534 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 20:04:38,534 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-02-15 20:04:38,534 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 20:04:38,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 20:04:38,534 INFO L85 PathProgramCache]: Analyzing trace with hash -2077570128, now seen corresponding path program 1 times [2023-02-15 20:04:38,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 20:04:38,535 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891614759] [2023-02-15 20:04:38,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 20:04:38,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 20:04:38,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 20:04:38,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-02-15 20:04:38,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 20:04:38,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-15 20:04:38,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 20:04:38,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-02-15 20:04:38,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 20:04:38,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-02-15 20:04:38,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 20:04:38,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-02-15 20:04:38,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 20:04:38,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-02-15 20:04:38,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 20:04:38,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-02-15 20:04:38,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 20:04:38,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-02-15 20:04:38,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 20:04:38,595 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 16 proven. 7 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-02-15 20:04:38,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 20:04:38,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891614759] [2023-02-15 20:04:38,596 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891614759] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 20:04:38,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1412681414] [2023-02-15 20:04:38,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 20:04:38,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 20:04:38,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 20:04:38,598 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) [2023-02-15 20:04:38,616 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-02-15 20:04:38,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 20:04:38,654 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-15 20:04:38,658 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 20:04:38,760 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2023-02-15 20:04:38,760 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 20:04:38,760 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1412681414] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 20:04:38,760 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-15 20:04:38,760 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 9 [2023-02-15 20:04:38,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507553165] [2023-02-15 20:04:38,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 20:04:38,761 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 20:04:38,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 20:04:38,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 20:04:38,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2023-02-15 20:04:38,762 INFO L87 Difference]: Start difference. First operand 174 states and 260 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-02-15 20:04:38,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 20:04:38,929 INFO L93 Difference]: Finished difference Result 505 states and 801 transitions. [2023-02-15 20:04:38,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-15 20:04:38,929 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 58 [2023-02-15 20:04:38,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 20:04:38,931 INFO L225 Difference]: With dead ends: 505 [2023-02-15 20:04:38,931 INFO L226 Difference]: Without dead ends: 335 [2023-02-15 20:04:38,931 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2023-02-15 20:04:38,932 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 39 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 20:04:38,932 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 171 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 20:04:38,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2023-02-15 20:04:38,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 311. [2023-02-15 20:04:38,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 311 states, 136 states have (on average 1.3455882352941178) internal successors, (183), 152 states have internal predecessors, (183), 162 states have call successors, (162), 12 states have call predecessors, (162), 12 states have return successors, (162), 146 states have call predecessors, (162), 162 states have call successors, (162) [2023-02-15 20:04:38,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 507 transitions. [2023-02-15 20:04:38,973 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 507 transitions. Word has length 58 [2023-02-15 20:04:38,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 20:04:38,973 INFO L495 AbstractCegarLoop]: Abstraction has 311 states and 507 transitions. [2023-02-15 20:04:38,973 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-02-15 20:04:38,973 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 507 transitions. [2023-02-15 20:04:38,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2023-02-15 20:04:38,974 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 20:04:38,974 INFO L195 NwaCegarLoop]: trace histogram [13, 12, 12, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 20:04:38,981 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-02-15 20:04:39,179 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-02-15 20:04:39,180 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 20:04:39,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 20:04:39,180 INFO L85 PathProgramCache]: Analyzing trace with hash -1244619342, now seen corresponding path program 1 times [2023-02-15 20:04:39,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 20:04:39,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102256376] [2023-02-15 20:04:39,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 20:04:39,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 20:04:39,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 20:04:39,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-02-15 20:04:39,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 20:04:39,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-15 20:04:39,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 20:04:39,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-02-15 20:04:39,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 20:04:39,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-02-15 20:04:39,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 20:04:39,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-02-15 20:04:39,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 20:04:39,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-02-15 20:04:39,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 20:04:39,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-02-15 20:04:39,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 20:04:39,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-02-15 20:04:39,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 20:04:39,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-15 20:04:39,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 20:04:39,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-02-15 20:04:39,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 20:04:39,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-15 20:04:39,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 20:04:39,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-02-15 20:04:39,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 20:04:39,269 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 24 proven. 7 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-02-15 20:04:39,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 20:04:39,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102256376] [2023-02-15 20:04:39,269 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [102256376] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 20:04:39,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1998832879] [2023-02-15 20:04:39,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 20:04:39,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 20:04:39,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 20:04:39,270 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) [2023-02-15 20:04:39,272 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-02-15 20:04:39,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 20:04:39,310 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 11 conjunts are in the unsatisfiable core [2023-02-15 20:04:39,312 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 20:04:39,382 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 24 proven. 7 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-02-15 20:04:39,382 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 20:04:39,453 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 24 proven. 7 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-02-15 20:04:39,454 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1998832879] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 20:04:39,454 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 20:04:39,454 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2023-02-15 20:04:39,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64124031] [2023-02-15 20:04:39,454 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 20:04:39,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-15 20:04:39,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 20:04:39,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-15 20:04:39,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2023-02-15 20:04:39,455 INFO L87 Difference]: Start difference. First operand 311 states and 507 transitions. Second operand has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 12 states have internal predecessors, (37), 6 states have call successors, (27), 3 states have call predecessors, (27), 1 states have return successors, (24), 6 states have call predecessors, (24), 6 states have call successors, (24) [2023-02-15 20:04:40,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 20:04:40,137 INFO L93 Difference]: Finished difference Result 619 states and 1034 transitions. [2023-02-15 20:04:40,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-02-15 20:04:40,138 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 12 states have internal predecessors, (37), 6 states have call successors, (27), 3 states have call predecessors, (27), 1 states have return successors, (24), 6 states have call predecessors, (24), 6 states have call successors, (24) Word has length 80 [2023-02-15 20:04:40,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 20:04:40,140 INFO L225 Difference]: With dead ends: 619 [2023-02-15 20:04:40,140 INFO L226 Difference]: Without dead ends: 617 [2023-02-15 20:04:40,141 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=147, Invalid=453, Unknown=0, NotChecked=0, Total=600 [2023-02-15 20:04:40,141 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 147 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 701 mSolverCounterSat, 408 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 435 SdHoareTripleChecker+Invalid, 1109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 408 IncrementalHoareTripleChecker+Valid, 701 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-15 20:04:40,141 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 435 Invalid, 1109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [408 Valid, 701 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-15 20:04:40,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2023-02-15 20:04:40,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 383. [2023-02-15 20:04:40,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 383 states, 167 states have (on average 1.3532934131736527) internal successors, (226), 187 states have internal predecessors, (226), 200 states have call successors, (200), 15 states have call predecessors, (200), 15 states have return successors, (200), 180 states have call predecessors, (200), 200 states have call successors, (200) [2023-02-15 20:04:40,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 626 transitions. [2023-02-15 20:04:40,197 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 626 transitions. Word has length 80 [2023-02-15 20:04:40,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 20:04:40,197 INFO L495 AbstractCegarLoop]: Abstraction has 383 states and 626 transitions. [2023-02-15 20:04:40,197 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 12 states have internal predecessors, (37), 6 states have call successors, (27), 3 states have call predecessors, (27), 1 states have return successors, (24), 6 states have call predecessors, (24), 6 states have call successors, (24) [2023-02-15 20:04:40,197 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 626 transitions. [2023-02-15 20:04:40,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2023-02-15 20:04:40,198 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 20:04:40,199 INFO L195 NwaCegarLoop]: trace histogram [14, 13, 13, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 20:04:40,221 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-02-15 20:04:40,403 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-02-15 20:04:40,403 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 20:04:40,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 20:04:40,403 INFO L85 PathProgramCache]: Analyzing trace with hash -1679445438, now seen corresponding path program 2 times [2023-02-15 20:04:40,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 20:04:40,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462867000] [2023-02-15 20:04:40,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 20:04:40,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 20:04:40,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 20:04:40,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-02-15 20:04:40,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 20:04:40,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-15 20:04:40,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 20:04:40,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-02-15 20:04:40,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 20:04:40,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-02-15 20:04:40,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 20:04:40,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-02-15 20:04:40,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 20:04:40,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-02-15 20:04:40,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 20:04:40,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-02-15 20:04:40,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 20:04:40,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-02-15 20:04:40,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 20:04:40,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-15 20:04:40,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 20:04:40,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-02-15 20:04:40,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 20:04:40,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-15 20:04:40,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 20:04:40,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-02-15 20:04:40,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 20:04:40,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-02-15 20:04:40,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 20:04:40,514 INFO L134 CoverageAnalysis]: Checked inductivity of 346 backedges. 26 proven. 8 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2023-02-15 20:04:40,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 20:04:40,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462867000] [2023-02-15 20:04:40,514 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462867000] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 20:04:40,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1866505998] [2023-02-15 20:04:40,515 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 20:04:40,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 20:04:40,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 20:04:40,516 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) [2023-02-15 20:04:40,518 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-02-15 20:04:40,557 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-15 20:04:40,557 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 20:04:40,558 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 11 conjunts are in the unsatisfiable core [2023-02-15 20:04:40,560 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 20:04:40,690 INFO L134 CoverageAnalysis]: Checked inductivity of 346 backedges. 27 proven. 7 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2023-02-15 20:04:40,690 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 20:04:40,792 INFO L134 CoverageAnalysis]: Checked inductivity of 346 backedges. 26 proven. 8 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2023-02-15 20:04:40,792 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1866505998] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 20:04:40,792 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 20:04:40,793 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 18 [2023-02-15 20:04:40,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721801626] [2023-02-15 20:04:40,793 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 20:04:40,793 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-02-15 20:04:40,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 20:04:40,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-02-15 20:04:40,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306 [2023-02-15 20:04:40,794 INFO L87 Difference]: Start difference. First operand 383 states and 626 transitions. Second operand has 18 states, 18 states have (on average 2.888888888888889) internal successors, (52), 16 states have internal predecessors, (52), 6 states have call successors, (42), 3 states have call predecessors, (42), 1 states have return successors, (39), 6 states have call predecessors, (39), 6 states have call successors, (39) [2023-02-15 20:04:41,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 20:04:41,133 INFO L93 Difference]: Finished difference Result 415 states and 669 transitions. [2023-02-15 20:04:41,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-15 20:04:41,134 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.888888888888889) internal successors, (52), 16 states have internal predecessors, (52), 6 states have call successors, (42), 3 states have call predecessors, (42), 1 states have return successors, (39), 6 states have call predecessors, (39), 6 states have call successors, (39) Word has length 85 [2023-02-15 20:04:41,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 20:04:41,135 INFO L225 Difference]: With dead ends: 415 [2023-02-15 20:04:41,135 INFO L226 Difference]: Without dead ends: 333 [2023-02-15 20:04:41,136 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=169, Invalid=533, Unknown=0, NotChecked=0, Total=702 [2023-02-15 20:04:41,136 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 55 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 20:04:41,137 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 182 Invalid, 426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 345 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 20:04:41,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2023-02-15 20:04:41,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 317. [2023-02-15 20:04:41,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 317 states, 144 states have (on average 1.3194444444444444) internal successors, (190), 160 states have internal predecessors, (190), 156 states have call successors, (156), 16 states have call predecessors, (156), 16 states have return successors, (156), 140 states have call predecessors, (156), 156 states have call successors, (156) [2023-02-15 20:04:41,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 502 transitions. [2023-02-15 20:04:41,187 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 502 transitions. Word has length 85 [2023-02-15 20:04:41,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 20:04:41,187 INFO L495 AbstractCegarLoop]: Abstraction has 317 states and 502 transitions. [2023-02-15 20:04:41,187 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.888888888888889) internal successors, (52), 16 states have internal predecessors, (52), 6 states have call successors, (42), 3 states have call predecessors, (42), 1 states have return successors, (39), 6 states have call predecessors, (39), 6 states have call successors, (39) [2023-02-15 20:04:41,187 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 502 transitions. [2023-02-15 20:04:41,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2023-02-15 20:04:41,190 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 20:04:41,190 INFO L195 NwaCegarLoop]: trace histogram [13, 12, 12, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 20:04:41,203 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-02-15 20:04:41,394 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-02-15 20:04:41,395 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 20:04:41,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 20:04:41,395 INFO L85 PathProgramCache]: Analyzing trace with hash -493164145, now seen corresponding path program 1 times [2023-02-15 20:04:41,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 20:04:41,395 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597410701] [2023-02-15 20:04:41,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 20:04:41,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 20:04:41,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 20:04:41,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-02-15 20:04:41,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 20:04:41,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-15 20:04:41,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 20:04:41,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-02-15 20:04:41,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 20:04:41,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-02-15 20:04:41,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 20:04:41,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-02-15 20:04:41,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 20:04:41,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-15 20:04:41,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 20:04:41,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-02-15 20:04:41,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 20:04:41,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-15 20:04:41,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 20:04:41,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-02-15 20:04:41,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 20:04:41,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-02-15 20:04:41,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 20:04:41,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-02-15 20:04:41,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 20:04:41,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-02-15 20:04:41,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 20:04:41,509 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 37 proven. 7 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-02-15 20:04:41,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 20:04:41,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597410701] [2023-02-15 20:04:41,509 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597410701] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 20:04:41,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1287855309] [2023-02-15 20:04:41,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 20:04:41,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 20:04:41,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 20:04:41,527 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 20:04:41,527 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-02-15 20:04:41,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 20:04:41,565 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-15 20:04:41,569 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 20:04:41,618 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 149 proven. 2 refuted. 0 times theorem prover too weak. 157 trivial. 0 not checked. [2023-02-15 20:04:41,618 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 20:04:41,684 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 37 proven. 2 refuted. 0 times theorem prover too weak. 269 trivial. 0 not checked. [2023-02-15 20:04:41,685 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1287855309] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 20:04:41,685 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 20:04:41,685 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 16 [2023-02-15 20:04:41,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423355307] [2023-02-15 20:04:41,685 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 20:04:41,686 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-02-15 20:04:41,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 20:04:41,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-02-15 20:04:41,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2023-02-15 20:04:41,687 INFO L87 Difference]: Start difference. First operand 317 states and 502 transitions. Second operand has 16 states, 16 states have (on average 3.5) internal successors, (56), 15 states have internal predecessors, (56), 7 states have call successors, (33), 3 states have call predecessors, (33), 2 states have return successors, (32), 7 states have call predecessors, (32), 7 states have call successors, (32) [2023-02-15 20:04:43,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 20:04:43,048 INFO L93 Difference]: Finished difference Result 674 states and 1047 transitions. [2023-02-15 20:04:43,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-02-15 20:04:43,048 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.5) internal successors, (56), 15 states have internal predecessors, (56), 7 states have call successors, (33), 3 states have call predecessors, (33), 2 states have return successors, (32), 7 states have call predecessors, (32), 7 states have call successors, (32) Word has length 85 [2023-02-15 20:04:43,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 20:04:43,049 INFO L225 Difference]: With dead ends: 674 [2023-02-15 20:04:43,049 INFO L226 Difference]: Without dead ends: 0 [2023-02-15 20:04:43,051 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 198 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 245 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=457, Invalid=1183, Unknown=0, NotChecked=0, Total=1640 [2023-02-15 20:04:43,051 INFO L413 NwaCegarLoop]: 201 mSDtfsCounter, 206 mSDsluCounter, 427 mSDsCounter, 0 mSdLazyCounter, 1539 mSolverCounterSat, 815 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 628 SdHoareTripleChecker+Invalid, 2354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 815 IncrementalHoareTripleChecker+Valid, 1539 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-02-15 20:04:43,051 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 628 Invalid, 2354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [815 Valid, 1539 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-02-15 20:04:43,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-02-15 20:04:43,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-02-15 20:04:43,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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) [2023-02-15 20:04:43,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-02-15 20:04:43,053 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 85 [2023-02-15 20:04:43,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 20:04:43,053 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-02-15 20:04:43,053 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.5) internal successors, (56), 15 states have internal predecessors, (56), 7 states have call successors, (33), 3 states have call predecessors, (33), 2 states have return successors, (32), 7 states have call predecessors, (32), 7 states have call successors, (32) [2023-02-15 20:04:43,053 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-02-15 20:04:43,053 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-02-15 20:04:43,055 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-02-15 20:04:43,063 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-02-15 20:04:43,259 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 20:04:43,261 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-02-15 20:05:02,313 WARN L233 SmtUtils]: Spent 18.08s on a formula simplification that was a NOOP. DAG size: 145 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2023-02-15 20:05:11,399 WARN L233 SmtUtils]: Spent 9.09s on a formula simplification that was a NOOP. DAG size: 108 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2023-02-15 20:05:29,658 WARN L233 SmtUtils]: Spent 17.91s on a formula simplification that was a NOOP. DAG size: 145 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2023-02-15 20:05:38,727 WARN L233 SmtUtils]: Spent 8.94s on a formula simplification that was a NOOP. DAG size: 108 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2023-02-15 20:07:25,925 WARN L233 SmtUtils]: Spent 1.79m on a formula simplification. DAG size of input: 186 DAG size of output: 182 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2023-02-15 20:07:31,166 INFO L895 garLoopResultBuilder]: At program point L64(line 64) the Hoare annotation is: (and (<= 1 |ULTIMATE.start_main_~l~0#1|) (< 1 |ULTIMATE.start_main_~r~0#1|) (<= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~l~0#1| 1) (<= 2 |ULTIMATE.start_main_~j~0#1|) (<= (* 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~j~0#1|)) [2023-02-15 20:07:31,167 INFO L895 garLoopResultBuilder]: At program point L64-1(line 64) the Hoare annotation is: (and (< 1 |ULTIMATE.start_main_~r~0#1|) (<= 1 |ULTIMATE.start_main_~l~0#1|) (<= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~l~0#1| 1) (<= (* 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~j~0#1|) (<= 2 |ULTIMATE.start_main_~j~0#1|)) [2023-02-15 20:07:31,167 INFO L895 garLoopResultBuilder]: At program point L60(line 60) the Hoare annotation is: (let ((.cse0 (* 2 |ULTIMATE.start_main_~l~0#1|))) (and (<= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~n~0#1|) (<= 2 |ULTIMATE.start_main_~l~0#1|) (<= (* 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~j~0#1|) (<= .cse0 |ULTIMATE.start_main_~r~0#1|) (<= .cse0 |ULTIMATE.start_main_~j~0#1|))) [2023-02-15 20:07:31,167 INFO L899 garLoopResultBuilder]: For program point L27(line 27) no Hoare annotation was computed. [2023-02-15 20:07:31,167 INFO L895 garLoopResultBuilder]: At program point L60-1(line 60) the Hoare annotation is: (let ((.cse0 (* 2 |ULTIMATE.start_main_~l~0#1|))) (and (<= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~n~0#1|) (<= 2 |ULTIMATE.start_main_~l~0#1|) (<= (* 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~j~0#1|) (<= .cse0 |ULTIMATE.start_main_~r~0#1|) (<= .cse0 |ULTIMATE.start_main_~j~0#1|))) [2023-02-15 20:07:31,167 INFO L895 garLoopResultBuilder]: At program point L52(line 52) the Hoare annotation is: (let ((.cse6 (* 2 |ULTIMATE.start_main_~l~0#1|))) (let ((.cse0 (<= 1 |ULTIMATE.start_main_~l~0#1|)) (.cse1 (<= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~n~0#1|)) (.cse2 (<= (* 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~j~0#1|)) (.cse3 (<= .cse6 |ULTIMATE.start_main_~j~0#1|)) (.cse4 (<= 1 |ULTIMATE.start_main_~i~0#1|)) (.cse5 (<= |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~n~0#1|))) (or (and .cse0 .cse1 (<= |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~r~0#1|) .cse2 .cse3 .cse4) (and .cse0 (< 1 |ULTIMATE.start_main_~r~0#1|) .cse1 (<= |ULTIMATE.start_main_~l~0#1| 1) .cse2 .cse4 .cse5) (and .cse0 .cse1 (< .cse6 |ULTIMATE.start_main_~r~0#1|) .cse2 .cse3 .cse4 .cse5)))) [2023-02-15 20:07:31,167 INFO L895 garLoopResultBuilder]: At program point L52-1(line 52) the Hoare annotation is: (let ((.cse6 (* 2 |ULTIMATE.start_main_~l~0#1|))) (let ((.cse0 (<= 1 |ULTIMATE.start_main_~l~0#1|)) (.cse1 (<= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~n~0#1|)) (.cse2 (<= (* 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~j~0#1|)) (.cse5 (<= .cse6 |ULTIMATE.start_main_~j~0#1|)) (.cse3 (<= 1 |ULTIMATE.start_main_~i~0#1|)) (.cse4 (<= |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~n~0#1|))) (or (and (< 1 |ULTIMATE.start_main_~r~0#1|) .cse0 .cse1 (<= |ULTIMATE.start_main_~l~0#1| 1) .cse2 .cse3 .cse4) (and .cse0 .cse1 (<= |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~r~0#1|) .cse2 .cse5 .cse3) (and .cse0 .cse1 (< .cse6 |ULTIMATE.start_main_~r~0#1|) .cse2 .cse5 .cse3 .cse4)))) [2023-02-15 20:07:31,167 INFO L899 garLoopResultBuilder]: For program point L48(line 48) no Hoare annotation was computed. [2023-02-15 20:07:31,167 INFO L899 garLoopResultBuilder]: For program point L44(lines 44 45) no Hoare annotation was computed. [2023-02-15 20:07:31,167 INFO L902 garLoopResultBuilder]: At program point main_returnLabel#1(lines 24 70) the Hoare annotation is: true [2023-02-15 20:07:31,167 INFO L895 garLoopResultBuilder]: At program point L40(line 40) the Hoare annotation is: (let ((.cse0 (<= 1 |ULTIMATE.start_main_~l~0#1|)) (.cse1 (<= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~n~0#1|)) (.cse2 (<= (* 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~j~0#1|)) (.cse3 (<= 1 |ULTIMATE.start_main_~i~0#1|))) (or (and (<= (+ |ULTIMATE.start_main_~j~0#1| 1) |ULTIMATE.start_main_~n~0#1|) .cse0 .cse1 (<= |ULTIMATE.start_main_~l~0#1| 1) (<= |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~r~0#1|) .cse2 .cse3) (and .cse0 (< |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~r~0#1|) .cse1 .cse2 (<= (* 2 |ULTIMATE.start_main_~l~0#1|) |ULTIMATE.start_main_~j~0#1|) .cse3))) [2023-02-15 20:07:31,167 INFO L895 garLoopResultBuilder]: At program point L40-1(line 40) the Hoare annotation is: (let ((.cse0 (<= 1 |ULTIMATE.start_main_~l~0#1|)) (.cse1 (<= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~n~0#1|)) (.cse2 (<= (* 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~j~0#1|)) (.cse3 (<= 1 |ULTIMATE.start_main_~i~0#1|))) (or (and (<= (+ |ULTIMATE.start_main_~j~0#1| 1) |ULTIMATE.start_main_~n~0#1|) .cse0 .cse1 (<= |ULTIMATE.start_main_~l~0#1| 1) (<= |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~r~0#1|) .cse2 .cse3) (and .cse0 (< |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~r~0#1|) .cse1 .cse2 (<= (* 2 |ULTIMATE.start_main_~l~0#1|) |ULTIMATE.start_main_~j~0#1|) .cse3))) [2023-02-15 20:07:31,167 INFO L899 garLoopResultBuilder]: For program point L65(line 65) no Hoare annotation was computed. [2023-02-15 20:07:31,167 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2023-02-15 20:07:31,167 INFO L899 garLoopResultBuilder]: For program point L61(line 61) no Hoare annotation was computed. [2023-02-15 20:07:31,167 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2023-02-15 20:07:31,167 INFO L895 garLoopResultBuilder]: At program point L53(line 53) the Hoare annotation is: (let ((.cse3 (* 2 |ULTIMATE.start_main_~l~0#1|))) (let ((.cse6 (< .cse3 |ULTIMATE.start_main_~r~0#1|)) (.cse4 (<= .cse3 |ULTIMATE.start_main_~j~0#1|)) (.cse0 (<= 1 |ULTIMATE.start_main_~l~0#1|)) (.cse1 (<= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~n~0#1|)) (.cse7 (<= 1 |ULTIMATE.start_main_~r~0#1|)) (.cse8 (<= |ULTIMATE.start_main_~l~0#1| 1)) (.cse9 (<= 2 |ULTIMATE.start_main_~j~0#1|)) (.cse2 (<= (* 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~j~0#1|)) (.cse5 (<= 1 |ULTIMATE.start_main_~i~0#1|)) (.cse10 (<= |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~n~0#1|))) (or (and .cse0 (< |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~r~0#1|) .cse1 .cse2 (<= (+ .cse3 2) |ULTIMATE.start_main_~r~0#1|) .cse4) (and .cse0 .cse1 (<= |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~r~0#1|) .cse2 .cse4 .cse5) (and .cse0 .cse1 .cse6 .cse7 .cse8 .cse9 .cse2 .cse10) (and .cse0 .cse1 .cse6 .cse2 .cse4 .cse5 .cse10) (and (< 1 |ULTIMATE.start_main_~r~0#1|) .cse0 .cse1 .cse7 .cse8 .cse9 .cse2 .cse5 .cse10)))) [2023-02-15 20:07:31,167 INFO L899 garLoopResultBuilder]: For program point L49(lines 49 51) no Hoare annotation was computed. [2023-02-15 20:07:31,168 INFO L895 garLoopResultBuilder]: At program point L41(line 41) the Hoare annotation is: (let ((.cse0 (<= 1 |ULTIMATE.start_main_~l~0#1|)) (.cse1 (<= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~n~0#1|)) (.cse2 (<= (* 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~j~0#1|)) (.cse3 (<= 1 |ULTIMATE.start_main_~i~0#1|))) (or (and (<= (+ |ULTIMATE.start_main_~j~0#1| 1) |ULTIMATE.start_main_~n~0#1|) .cse0 .cse1 (<= |ULTIMATE.start_main_~l~0#1| 1) (<= |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~r~0#1|) .cse2 .cse3) (and .cse0 (< |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~r~0#1|) .cse1 .cse2 (<= (* 2 |ULTIMATE.start_main_~l~0#1|) |ULTIMATE.start_main_~j~0#1|) .cse3))) [2023-02-15 20:07:31,168 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-02-15 20:07:31,168 INFO L895 garLoopResultBuilder]: At program point L54(line 54) the Hoare annotation is: (let ((.cse3 (* 2 |ULTIMATE.start_main_~l~0#1|))) (let ((.cse6 (< .cse3 |ULTIMATE.start_main_~r~0#1|)) (.cse4 (<= .cse3 |ULTIMATE.start_main_~j~0#1|)) (.cse0 (<= 1 |ULTIMATE.start_main_~l~0#1|)) (.cse1 (<= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~n~0#1|)) (.cse7 (<= 1 |ULTIMATE.start_main_~r~0#1|)) (.cse8 (<= |ULTIMATE.start_main_~l~0#1| 1)) (.cse2 (<= (* 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~j~0#1|)) (.cse9 (<= 2 |ULTIMATE.start_main_~j~0#1|)) (.cse5 (<= 1 |ULTIMATE.start_main_~i~0#1|)) (.cse10 (<= |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~n~0#1|))) (or (and .cse0 (< |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~r~0#1|) .cse1 .cse2 (<= (+ .cse3 2) |ULTIMATE.start_main_~r~0#1|) .cse4) (and .cse0 .cse1 (<= |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~r~0#1|) .cse2 .cse4 .cse5) (and .cse0 .cse1 .cse6 .cse7 .cse8 .cse9 .cse2 .cse10) (and .cse0 .cse1 .cse6 .cse2 .cse4 .cse5 .cse10) (and (< 1 |ULTIMATE.start_main_~r~0#1|) .cse0 .cse1 .cse7 .cse8 .cse2 .cse9 .cse5 .cse10)))) [2023-02-15 20:07:31,168 INFO L895 garLoopResultBuilder]: At program point L42(line 42) the Hoare annotation is: (let ((.cse0 (<= 1 |ULTIMATE.start_main_~l~0#1|)) (.cse1 (<= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~n~0#1|)) (.cse2 (<= (* 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~j~0#1|)) (.cse3 (<= 1 |ULTIMATE.start_main_~i~0#1|))) (or (and (<= (+ |ULTIMATE.start_main_~j~0#1| 1) |ULTIMATE.start_main_~n~0#1|) .cse0 .cse1 (<= |ULTIMATE.start_main_~l~0#1| 1) (<= |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~r~0#1|) .cse2 .cse3) (and .cse0 (< |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~r~0#1|) .cse1 .cse2 (<= (* 2 |ULTIMATE.start_main_~l~0#1|) |ULTIMATE.start_main_~j~0#1|) .cse3))) [2023-02-15 20:07:31,168 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-02-15 20:07:31,168 INFO L895 garLoopResultBuilder]: At program point L38-2(lines 38 58) the Hoare annotation is: (let ((.cse5 (* 2 |ULTIMATE.start_main_~l~0#1|))) (let ((.cse3 (<= .cse5 |ULTIMATE.start_main_~j~0#1|)) (.cse4 (<= 1 |ULTIMATE.start_main_~i~0#1|)) (.cse0 (<= 1 |ULTIMATE.start_main_~l~0#1|)) (.cse1 (<= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~n~0#1|)) (.cse2 (<= (* 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~j~0#1|)) (.cse6 (<= 2 |ULTIMATE.start_main_~i~0#1|))) (or (and .cse0 .cse1 (<= |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~r~0#1|) .cse2 .cse3 .cse4) (and .cse0 (< .cse5 |ULTIMATE.start_main_~r~0#1|) .cse1 .cse2 .cse3 .cse6) (and .cse0 (< 1 |ULTIMATE.start_main_~r~0#1|) .cse1 (<= |ULTIMATE.start_main_~l~0#1| 1) .cse2 .cse4) (and .cse0 .cse1 .cse2 (<= (* 2 |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~j~0#1|) (<= .cse5 |ULTIMATE.start_main_~r~0#1|) .cse6)))) [2023-02-15 20:07:31,168 INFO L899 garLoopResultBuilder]: For program point L38-3(lines 35 68) no Hoare annotation was computed. [2023-02-15 20:07:31,168 INFO L899 garLoopResultBuilder]: For program point L30(lines 30 34) no Hoare annotation was computed. [2023-02-15 20:07:31,168 INFO L895 garLoopResultBuilder]: At program point L59-1(lines 35 68) the Hoare annotation is: (let ((.cse3 (* 2 |ULTIMATE.start_main_~l~0#1|))) (let ((.cse0 (<= .cse3 |ULTIMATE.start_main_~n~0#1|)) (.cse1 (<= 1 |ULTIMATE.start_main_~l~0#1|)) (.cse2 (<= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~n~0#1|)) (.cse4 (<= |ULTIMATE.start_main_~l~0#1| 1))) (or (and .cse0 .cse1 .cse2 (<= .cse3 |ULTIMATE.start_main_~r~0#1|)) (and .cse1 .cse4 (<= |ULTIMATE.start_main_~r~0#1| 0) (<= .cse3 (+ |ULTIMATE.start_main_~n~0#1| 2))) (and .cse0 .cse1 .cse2 .cse4 (<= 2 |ULTIMATE.start_main_~j~0#1|) (<= (+ (* 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~r~0#1| 2) (+ |ULTIMATE.start_main_~j~0#1| (* 2 |ULTIMATE.start_main_~n~0#1|))))))) [2023-02-15 20:07:31,168 INFO L899 garLoopResultBuilder]: For program point L55(line 55) no Hoare annotation was computed. [2023-02-15 20:07:31,168 INFO L895 garLoopResultBuilder]: At program point L47(line 47) the Hoare annotation is: (let ((.cse6 (* 2 |ULTIMATE.start_main_~l~0#1|))) (let ((.cse0 (<= 1 |ULTIMATE.start_main_~l~0#1|)) (.cse1 (<= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~n~0#1|)) (.cse2 (<= (* 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~j~0#1|)) (.cse5 (<= .cse6 |ULTIMATE.start_main_~j~0#1|)) (.cse3 (<= 1 |ULTIMATE.start_main_~i~0#1|)) (.cse4 (<= |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~n~0#1|))) (or (and (< 1 |ULTIMATE.start_main_~r~0#1|) .cse0 .cse1 (<= |ULTIMATE.start_main_~l~0#1| 1) .cse2 .cse3 .cse4) (and .cse0 .cse1 (<= |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~r~0#1|) .cse2 .cse5 .cse3) (and .cse0 .cse1 (< .cse6 |ULTIMATE.start_main_~r~0#1|) .cse2 .cse5 .cse3 .cse4)))) [2023-02-15 20:07:31,168 INFO L899 garLoopResultBuilder]: For program point L43(line 43) no Hoare annotation was computed. [2023-02-15 20:07:31,168 INFO L899 garLoopResultBuilder]: For program point L39(lines 39 46) no Hoare annotation was computed. [2023-02-15 20:07:31,168 INFO L895 garLoopResultBuilder]: At program point L39-1(lines 39 46) the Hoare annotation is: (let ((.cse6 (* 2 |ULTIMATE.start_main_~l~0#1|))) (let ((.cse0 (<= 1 |ULTIMATE.start_main_~l~0#1|)) (.cse1 (<= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~n~0#1|)) (.cse2 (<= (* 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~j~0#1|)) (.cse5 (<= .cse6 |ULTIMATE.start_main_~j~0#1|)) (.cse3 (<= 1 |ULTIMATE.start_main_~i~0#1|)) (.cse4 (<= |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~n~0#1|))) (or (and (< 1 |ULTIMATE.start_main_~r~0#1|) .cse0 .cse1 (<= |ULTIMATE.start_main_~l~0#1| 1) .cse2 .cse3 .cse4) (and .cse0 .cse1 (<= |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~r~0#1|) .cse2 .cse5 .cse3) (and .cse0 .cse1 (< .cse6 |ULTIMATE.start_main_~r~0#1|) .cse2 .cse5 .cse3 .cse4)))) [2023-02-15 20:07:31,168 INFO L899 garLoopResultBuilder]: For program point L35-1(lines 35 68) no Hoare annotation was computed. [2023-02-15 20:07:31,168 INFO L899 garLoopResultBuilder]: For program point L18-2(lines 17 22) no Hoare annotation was computed. [2023-02-15 20:07:31,168 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 17 22) no Hoare annotation was computed. [2023-02-15 20:07:31,168 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 17 22) the Hoare annotation is: true [2023-02-15 20:07:31,168 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2023-02-15 20:07:31,169 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2023-02-15 20:07:31,169 INFO L899 garLoopResultBuilder]: For program point L18(lines 18 20) no Hoare annotation was computed. [2023-02-15 20:07:31,173 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 20:07:31,174 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-15 20:07:31,184 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.02 08:07:31 BoogieIcfgContainer [2023-02-15 20:07:31,184 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-15 20:07:31,184 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-15 20:07:31,184 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-15 20:07:31,184 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-15 20:07:31,185 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 08:04:35" (3/4) ... [2023-02-15 20:07:31,186 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-02-15 20:07:31,190 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2023-02-15 20:07:31,192 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2023-02-15 20:07:31,192 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2023-02-15 20:07:31,193 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2023-02-15 20:07:31,193 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-02-15 20:07:31,193 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-02-15 20:07:31,217 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-02-15 20:07:31,217 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-15 20:07:31,217 INFO L158 Benchmark]: Toolchain (without parser) took 176419.65ms. Allocated memory was 155.2MB in the beginning and 755.0MB in the end (delta: 599.8MB). Free memory was 120.6MB in the beginning and 535.7MB in the end (delta: -415.0MB). Peak memory consumption was 185.9MB. Max. memory is 16.1GB. [2023-02-15 20:07:31,218 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 155.2MB. Free memory is still 123.2MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-15 20:07:31,218 INFO L158 Benchmark]: CACSL2BoogieTranslator took 134.42ms. Allocated memory is still 155.2MB. Free memory was 120.6MB in the beginning and 109.8MB in the end (delta: 10.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-15 20:07:31,218 INFO L158 Benchmark]: Boogie Procedure Inliner took 20.00ms. Allocated memory is still 155.2MB. Free memory was 109.8MB in the beginning and 108.1MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-15 20:07:31,219 INFO L158 Benchmark]: Boogie Preprocessor took 12.98ms. Allocated memory is still 155.2MB. Free memory was 108.1MB in the beginning and 107.1MB in the end (delta: 994.2kB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-15 20:07:31,219 INFO L158 Benchmark]: RCFGBuilder took 250.03ms. Allocated memory is still 155.2MB. Free memory was 107.1MB in the beginning and 95.2MB in the end (delta: 12.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-02-15 20:07:31,219 INFO L158 Benchmark]: TraceAbstraction took 175935.17ms. Allocated memory was 155.2MB in the beginning and 755.0MB in the end (delta: 599.8MB). Free memory was 94.5MB in the beginning and 538.8MB in the end (delta: -444.3MB). Peak memory consumption was 427.1MB. Max. memory is 16.1GB. [2023-02-15 20:07:31,220 INFO L158 Benchmark]: Witness Printer took 32.74ms. Allocated memory is still 755.0MB. Free memory was 538.8MB in the beginning and 535.7MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-15 20:07:31,222 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 155.2MB. Free memory is still 123.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 134.42ms. Allocated memory is still 155.2MB. Free memory was 120.6MB in the beginning and 109.8MB in the end (delta: 10.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 20.00ms. Allocated memory is still 155.2MB. Free memory was 109.8MB in the beginning and 108.1MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 12.98ms. Allocated memory is still 155.2MB. Free memory was 108.1MB in the beginning and 107.1MB in the end (delta: 994.2kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 250.03ms. Allocated memory is still 155.2MB. Free memory was 107.1MB in the beginning and 95.2MB in the end (delta: 12.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 175935.17ms. Allocated memory was 155.2MB in the beginning and 755.0MB in the end (delta: 599.8MB). Free memory was 94.5MB in the beginning and 538.8MB in the end (delta: -444.3MB). Peak memory consumption was 427.1MB. Max. memory is 16.1GB. * Witness Printer took 32.74ms. Allocated memory is still 755.0MB. Free memory was 538.8MB in the beginning and 535.7MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 39 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 175.9s, OverallIterations: 19, TraceHistogramMax: 14, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 4.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 167.9s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1138 SdHoareTripleChecker+Valid, 2.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 969 mSDsluCounter, 4143 SdHoareTripleChecker+Invalid, 2.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2785 mSDsCounter, 1813 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4316 IncrementalHoareTripleChecker+Invalid, 6129 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1813 mSolverCounterUnsat, 1358 mSDtfsCounter, 4316 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 912 GetRequests, 730 SyntacticMatches, 0 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 470 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=383occurred in iteration=17, InterpolantAutomatonStates: 172, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 19 MinimizatonAttempts, 745 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 18 LocationsWithAnnotation, 578 PreInvPairs, 865 NumberOfFragments, 1028 HoareAnnotationTreeSize, 578 FomulaSimplifications, 1307429 FormulaSimplificationTreeSizeReduction, 163.8s HoareSimplificationTime, 18 FomulaSimplificationsInter, 24548216 FormulaSimplificationTreeSizeReductionInter, 4.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 957 NumberOfCodeBlocks, 957 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 1181 ConstructedInterpolants, 0 QuantifiedInterpolants, 2495 SizeOfPredicates, 14 NumberOfNonLiveVariables, 724 ConjunctsInSsa, 33 ConjunctsInUnsatCore, 26 InterpolantComputations, 16 PerfectInterpolantSequences, 3283/3345 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 24]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 35]: Loop Invariant Derived loop invariant: ((((2 * l <= n && 1 <= l) && r <= n) && 2 * l <= r) || (((1 <= l && l <= 1) && r <= 0) && 2 * l <= n + 2)) || (((((2 * l <= n && 1 <= l) && r <= n) && l <= 1) && 2 <= j) && 2 * i + r + 2 <= j + 2 * n) - InvariantResult [Line: 38]: Loop Invariant Derived loop invariant: (((((((1 <= l && r <= n) && j <= r) && 2 * i <= j) && 2 * l <= j) && 1 <= i) || (((((1 <= l && 2 * l < r) && r <= n) && 2 * i <= j) && 2 * l <= j) && 2 <= i)) || (((((1 <= l && 1 < r) && r <= n) && l <= 1) && 2 * i <= j) && 1 <= i)) || (((((1 <= l && r <= n) && 2 * i <= j) && 2 * r <= j) && 2 * l <= r) && 2 <= i) RESULT: Ultimate proved your program to be correct! [2023-02-15 20:07:31,254 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE