./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/bitvector/soft_float_1-3a.c.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f4b24e32 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/bitvector/soft_float_1-3a.c.cil.c -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 2e6e06de31959e386aafc2fb45c848364ae9fea32df4ba40928c607f134f313f --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-13 11:26:05,052 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 11:26:05,054 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 11:26:05,087 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 11:26:05,087 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 11:26:05,088 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 11:26:05,089 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 11:26:05,091 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 11:26:05,092 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 11:26:05,095 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 11:26:05,096 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 11:26:05,097 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 11:26:05,098 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 11:26:05,099 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 11:26:05,100 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 11:26:05,102 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 11:26:05,102 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 11:26:05,103 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 11:26:05,104 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 11:26:05,108 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 11:26:05,110 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 11:26:05,110 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 11:26:05,111 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 11:26:05,112 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 11:26:05,113 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 11:26:05,117 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 11:26:05,118 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 11:26:05,118 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 11:26:05,119 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 11:26:05,119 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 11:26:05,120 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 11:26:05,120 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 11:26:05,121 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 11:26:05,121 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 11:26:05,122 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 11:26:05,123 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 11:26:05,123 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 11:26:05,123 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 11:26:05,124 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 11:26:05,124 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 11:26:05,124 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 11:26:05,125 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 11:26:05,126 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-13 11:26:05,146 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 11:26:05,147 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 11:26:05,147 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 11:26:05,147 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 11:26:05,148 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 11:26:05,148 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 11:26:05,148 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 11:26:05,148 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 11:26:05,149 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 11:26:05,149 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 11:26:05,149 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-13 11:26:05,149 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 11:26:05,150 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-13 11:26:05,150 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 11:26:05,150 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-13 11:26:05,150 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 11:26:05,150 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-13 11:26:05,150 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-13 11:26:05,150 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 11:26:05,151 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 11:26:05,151 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-13 11:26:05,152 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 11:26:05,152 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 11:26:05,152 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 11:26:05,152 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 11:26:05,152 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 11:26:05,152 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 11:26:05,152 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-13 11:26:05,153 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 11:26:05,153 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-13 11:26:05,153 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-13 11:26:05,153 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-13 11:26:05,153 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-13 11:26:05,153 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.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 -> 2e6e06de31959e386aafc2fb45c848364ae9fea32df4ba40928c607f134f313f [2022-07-13 11:26:05,344 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 11:26:05,370 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 11:26:05,372 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 11:26:05,372 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 11:26:05,373 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 11:26:05,374 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/soft_float_1-3a.c.cil.c [2022-07-13 11:26:05,426 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ac01f041/37ff949c51f745f89b42fa75bff964e9/FLAGde50bdf5a [2022-07-13 11:26:05,782 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 11:26:05,783 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_1-3a.c.cil.c [2022-07-13 11:26:05,787 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ac01f041/37ff949c51f745f89b42fa75bff964e9/FLAGde50bdf5a [2022-07-13 11:26:05,795 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ac01f041/37ff949c51f745f89b42fa75bff964e9 [2022-07-13 11:26:05,797 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 11:26:05,798 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 11:26:05,801 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 11:26:05,801 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 11:26:05,803 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 11:26:05,804 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 11:26:05" (1/1) ... [2022-07-13 11:26:05,804 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3cccfb38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:26:05, skipping insertion in model container [2022-07-13 11:26:05,804 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 11:26:05" (1/1) ... [2022-07-13 11:26:05,808 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 11:26:05,821 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 11:26:05,939 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_1-3a.c.cil.c[730,743] [2022-07-13 11:26:05,988 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 11:26:05,993 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 11:26:06,001 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_1-3a.c.cil.c[730,743] [2022-07-13 11:26:06,034 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 11:26:06,058 INFO L208 MainTranslator]: Completed translation [2022-07-13 11:26:06,062 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:26:06 WrapperNode [2022-07-13 11:26:06,062 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 11:26:06,065 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 11:26:06,065 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 11:26:06,065 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 11:26:06,083 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:26:06" (1/1) ... [2022-07-13 11:26:06,100 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:26:06" (1/1) ... [2022-07-13 11:26:06,119 INFO L137 Inliner]: procedures = 17, calls = 19, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 213 [2022-07-13 11:26:06,124 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 11:26:06,125 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 11:26:06,125 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 11:26:06,125 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 11:26:06,130 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:26:06" (1/1) ... [2022-07-13 11:26:06,130 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:26:06" (1/1) ... [2022-07-13 11:26:06,133 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:26:06" (1/1) ... [2022-07-13 11:26:06,134 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:26:06" (1/1) ... [2022-07-13 11:26:06,139 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:26:06" (1/1) ... [2022-07-13 11:26:06,149 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:26:06" (1/1) ... [2022-07-13 11:26:06,155 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:26:06" (1/1) ... [2022-07-13 11:26:06,157 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 11:26:06,158 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 11:26:06,158 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 11:26:06,158 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 11:26:06,173 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:26:06" (1/1) ... [2022-07-13 11:26:06,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 11:26:06,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:26:06,229 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-13 11:26:06,245 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-13 11:26:06,256 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 11:26:06,257 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-13 11:26:06,257 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2022-07-13 11:26:06,257 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2022-07-13 11:26:06,257 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 11:26:06,257 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 11:26:06,259 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-07-13 11:26:06,259 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-07-13 11:26:06,335 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 11:26:06,336 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 11:26:06,624 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 11:26:06,629 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 11:26:06,629 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-13 11:26:06,631 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 11:26:06 BoogieIcfgContainer [2022-07-13 11:26:06,631 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 11:26:06,632 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-13 11:26:06,632 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-13 11:26:06,634 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-13 11:26:06,635 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 11:26:05" (1/3) ... [2022-07-13 11:26:06,635 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50c75a06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 11:26:06, skipping insertion in model container [2022-07-13 11:26:06,635 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:26:06" (2/3) ... [2022-07-13 11:26:06,636 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50c75a06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 11:26:06, skipping insertion in model container [2022-07-13 11:26:06,636 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 11:26:06" (3/3) ... [2022-07-13 11:26:06,637 INFO L111 eAbstractionObserver]: Analyzing ICFG soft_float_1-3a.c.cil.c [2022-07-13 11:26:06,646 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-13 11:26:06,646 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-13 11:26:06,676 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 11:26:06,681 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=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@7f8bf747, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@718a12bd [2022-07-13 11:26:06,681 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-13 11:26:06,685 INFO L276 IsEmpty]: Start isEmpty. Operand has 106 states, 93 states have (on average 1.7204301075268817) internal successors, (160), 96 states have internal predecessors, (160), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-07-13 11:26:06,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-13 11:26:06,691 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:26:06,692 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:26:06,692 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:26:06,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:26:06,695 INFO L85 PathProgramCache]: Analyzing trace with hash 814386124, now seen corresponding path program 1 times [2022-07-13 11:26:06,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:26:06,701 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375472155] [2022-07-13 11:26:06,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:26:06,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:26:06,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:06,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 11:26:06,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:06,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 11:26:06,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:06,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-13 11:26:06,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:06,943 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-13 11:26:06,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:26:06,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375472155] [2022-07-13 11:26:06,945 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375472155] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:26:06,945 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:26:06,945 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:26:06,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590696689] [2022-07-13 11:26:06,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:26:06,950 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:26:06,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:26:06,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:26:06,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:26:06,973 INFO L87 Difference]: Start difference. First operand has 106 states, 93 states have (on average 1.7204301075268817) internal successors, (160), 96 states have internal predecessors, (160), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 2 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) [2022-07-13 11:26:07,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:26:07,087 INFO L93 Difference]: Finished difference Result 276 states and 481 transitions. [2022-07-13 11:26:07,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:26:07,091 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 2 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 37 [2022-07-13 11:26:07,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:26:07,103 INFO L225 Difference]: With dead ends: 276 [2022-07-13 11:26:07,103 INFO L226 Difference]: Without dead ends: 165 [2022-07-13 11:26:07,107 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:26:07,109 INFO L413 NwaCegarLoop]: 164 mSDtfsCounter, 110 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:26:07,110 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 419 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 11:26:07,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2022-07-13 11:26:07,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 147. [2022-07-13 11:26:07,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 132 states have (on average 1.5) internal successors, (198), 134 states have internal predecessors, (198), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-07-13 11:26:07,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 221 transitions. [2022-07-13 11:26:07,173 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 221 transitions. Word has length 37 [2022-07-13 11:26:07,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:26:07,174 INFO L495 AbstractCegarLoop]: Abstraction has 147 states and 221 transitions. [2022-07-13 11:26:07,174 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 2 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) [2022-07-13 11:26:07,174 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 221 transitions. [2022-07-13 11:26:07,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-13 11:26:07,176 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:26:07,177 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:26:07,177 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-13 11:26:07,177 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:26:07,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:26:07,181 INFO L85 PathProgramCache]: Analyzing trace with hash -2116308935, now seen corresponding path program 1 times [2022-07-13 11:26:07,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:26:07,182 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904008227] [2022-07-13 11:26:07,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:26:07,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:26:07,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:07,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 11:26:07,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:07,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 11:26:07,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:07,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-13 11:26:07,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:07,255 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-13 11:26:07,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:26:07,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904008227] [2022-07-13 11:26:07,256 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904008227] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:26:07,256 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:26:07,256 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:26:07,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133421144] [2022-07-13 11:26:07,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:26:07,257 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:26:07,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:26:07,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:26:07,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:26:07,258 INFO L87 Difference]: Start difference. First operand 147 states and 221 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 2 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) [2022-07-13 11:26:07,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:26:07,306 INFO L93 Difference]: Finished difference Result 275 states and 414 transitions. [2022-07-13 11:26:07,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:26:07,307 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 2 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 39 [2022-07-13 11:26:07,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:26:07,308 INFO L225 Difference]: With dead ends: 275 [2022-07-13 11:26:07,308 INFO L226 Difference]: Without dead ends: 236 [2022-07-13 11:26:07,309 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:26:07,310 INFO L413 NwaCegarLoop]: 173 mSDtfsCounter, 102 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 11:26:07,310 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 436 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 11:26:07,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2022-07-13 11:26:07,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 219. [2022-07-13 11:26:07,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 198 states have (on average 1.4595959595959596) internal successors, (289), 201 states have internal predecessors, (289), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-07-13 11:26:07,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 323 transitions. [2022-07-13 11:26:07,323 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 323 transitions. Word has length 39 [2022-07-13 11:26:07,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:26:07,324 INFO L495 AbstractCegarLoop]: Abstraction has 219 states and 323 transitions. [2022-07-13 11:26:07,324 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 2 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) [2022-07-13 11:26:07,324 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 323 transitions. [2022-07-13 11:26:07,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-07-13 11:26:07,325 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:26:07,325 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:26:07,325 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-13 11:26:07,326 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:26:07,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:26:07,326 INFO L85 PathProgramCache]: Analyzing trace with hash 1123536244, now seen corresponding path program 1 times [2022-07-13 11:26:07,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:26:07,326 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088078828] [2022-07-13 11:26:07,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:26:07,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:26:07,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:07,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 11:26:07,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:07,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 11:26:07,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:07,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-13 11:26:07,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:07,399 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-13 11:26:07,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:26:07,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088078828] [2022-07-13 11:26:07,402 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088078828] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:26:07,402 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:26:07,402 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 11:26:07,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964791117] [2022-07-13 11:26:07,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:26:07,403 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 11:26:07,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:26:07,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 11:26:07,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 11:26:07,405 INFO L87 Difference]: Start difference. First operand 219 states and 323 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 2 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) [2022-07-13 11:26:07,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:26:07,503 INFO L93 Difference]: Finished difference Result 353 states and 525 transitions. [2022-07-13 11:26:07,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 11:26:07,504 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 2 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 40 [2022-07-13 11:26:07,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:26:07,508 INFO L225 Difference]: With dead ends: 353 [2022-07-13 11:26:07,508 INFO L226 Difference]: Without dead ends: 321 [2022-07-13 11:26:07,509 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-13 11:26:07,514 INFO L413 NwaCegarLoop]: 235 mSDtfsCounter, 206 mSDsluCounter, 467 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 702 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:26:07,515 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 702 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 11:26:07,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2022-07-13 11:26:07,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 273. [2022-07-13 11:26:07,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 247 states have (on average 1.4615384615384615) internal successors, (361), 251 states have internal predecessors, (361), 23 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2022-07-13 11:26:07,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 405 transitions. [2022-07-13 11:26:07,541 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 405 transitions. Word has length 40 [2022-07-13 11:26:07,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:26:07,542 INFO L495 AbstractCegarLoop]: Abstraction has 273 states and 405 transitions. [2022-07-13 11:26:07,542 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 2 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) [2022-07-13 11:26:07,542 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 405 transitions. [2022-07-13 11:26:07,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-07-13 11:26:07,548 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:26:07,548 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:26:07,548 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-13 11:26:07,549 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:26:07,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:26:07,550 INFO L85 PathProgramCache]: Analyzing trace with hash 102467890, now seen corresponding path program 1 times [2022-07-13 11:26:07,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:26:07,550 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183869789] [2022-07-13 11:26:07,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:26:07,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:26:07,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:07,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 11:26:07,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:07,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 11:26:07,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:07,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-13 11:26:07,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:07,640 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-13 11:26:07,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:26:07,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183869789] [2022-07-13 11:26:07,641 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183869789] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:26:07,641 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:26:07,641 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:26:07,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052035230] [2022-07-13 11:26:07,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:26:07,642 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:26:07,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:26:07,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:26:07,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:26:07,643 INFO L87 Difference]: Start difference. First operand 273 states and 405 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 2 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) [2022-07-13 11:26:07,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:26:07,682 INFO L93 Difference]: Finished difference Result 294 states and 435 transitions. [2022-07-13 11:26:07,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:26:07,682 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 2 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 40 [2022-07-13 11:26:07,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:26:07,685 INFO L225 Difference]: With dead ends: 294 [2022-07-13 11:26:07,685 INFO L226 Difference]: Without dead ends: 287 [2022-07-13 11:26:07,685 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:26:07,694 INFO L413 NwaCegarLoop]: 154 mSDtfsCounter, 45 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 11:26:07,695 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 402 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 11:26:07,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2022-07-13 11:26:07,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 274. [2022-07-13 11:26:07,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 248 states have (on average 1.4596774193548387) internal successors, (362), 252 states have internal predecessors, (362), 23 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2022-07-13 11:26:07,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 406 transitions. [2022-07-13 11:26:07,718 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 406 transitions. Word has length 40 [2022-07-13 11:26:07,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:26:07,719 INFO L495 AbstractCegarLoop]: Abstraction has 274 states and 406 transitions. [2022-07-13 11:26:07,719 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 2 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) [2022-07-13 11:26:07,720 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 406 transitions. [2022-07-13 11:26:07,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-13 11:26:07,721 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:26:07,721 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:26:07,721 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-13 11:26:07,721 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:26:07,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:26:07,723 INFO L85 PathProgramCache]: Analyzing trace with hash 991244780, now seen corresponding path program 1 times [2022-07-13 11:26:07,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:26:07,723 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277357377] [2022-07-13 11:26:07,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:26:07,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:26:07,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:07,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 11:26:07,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:07,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 11:26:07,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:07,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-13 11:26:07,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:07,904 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-13 11:26:07,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:26:07,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277357377] [2022-07-13 11:26:07,904 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277357377] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 11:26:07,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [553711723] [2022-07-13 11:26:07,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:26:07,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:26:07,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:26:07,924 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 11:26:07,980 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-13 11:26:08,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:08,011 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-13 11:26:08,018 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:26:08,197 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-13 11:26:08,197 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:26:08,286 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-13 11:26:08,286 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [553711723] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:26:08,286 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 11:26:08,286 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 6] total 17 [2022-07-13 11:26:08,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749700166] [2022-07-13 11:26:08,287 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 11:26:08,287 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-13 11:26:08,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:26:08,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-13 11:26:08,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2022-07-13 11:26:08,288 INFO L87 Difference]: Start difference. First operand 274 states and 406 transitions. Second operand has 17 states, 16 states have (on average 2.875) internal successors, (46), 12 states have internal predecessors, (46), 6 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (9), 8 states have call predecessors, (9), 5 states have call successors, (9) [2022-07-13 11:26:08,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:26:08,793 INFO L93 Difference]: Finished difference Result 561 states and 855 transitions. [2022-07-13 11:26:08,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-13 11:26:08,794 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.875) internal successors, (46), 12 states have internal predecessors, (46), 6 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (9), 8 states have call predecessors, (9), 5 states have call successors, (9) Word has length 41 [2022-07-13 11:26:08,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:26:08,795 INFO L225 Difference]: With dead ends: 561 [2022-07-13 11:26:08,795 INFO L226 Difference]: Without dead ends: 290 [2022-07-13 11:26:08,797 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 86 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=130, Invalid=626, Unknown=0, NotChecked=0, Total=756 [2022-07-13 11:26:08,797 INFO L413 NwaCegarLoop]: 162 mSDtfsCounter, 467 mSDsluCounter, 1383 mSDsCounter, 0 mSdLazyCounter, 694 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 486 SdHoareTripleChecker+Valid, 1545 SdHoareTripleChecker+Invalid, 749 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 694 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-13 11:26:08,797 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [486 Valid, 1545 Invalid, 749 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 694 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-13 11:26:08,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2022-07-13 11:26:08,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 173. [2022-07-13 11:26:08,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 153 states have (on average 1.4379084967320261) internal successors, (220), 156 states have internal predecessors, (220), 15 states have call successors, (15), 3 states have call predecessors, (15), 4 states have return successors, (20), 15 states have call predecessors, (20), 14 states have call successors, (20) [2022-07-13 11:26:08,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 255 transitions. [2022-07-13 11:26:08,808 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 255 transitions. Word has length 41 [2022-07-13 11:26:08,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:26:08,808 INFO L495 AbstractCegarLoop]: Abstraction has 173 states and 255 transitions. [2022-07-13 11:26:08,808 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.875) internal successors, (46), 12 states have internal predecessors, (46), 6 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (9), 8 states have call predecessors, (9), 5 states have call successors, (9) [2022-07-13 11:26:08,808 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 255 transitions. [2022-07-13 11:26:08,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-13 11:26:08,809 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:26:08,809 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:26:08,826 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-07-13 11:26:09,027 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:26:09,027 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:26:09,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:26:09,028 INFO L85 PathProgramCache]: Analyzing trace with hash 493844178, now seen corresponding path program 1 times [2022-07-13 11:26:09,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:26:09,028 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675970983] [2022-07-13 11:26:09,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:26:09,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:26:09,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:09,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 11:26:09,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:09,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 11:26:09,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:09,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-13 11:26:09,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:09,104 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-13 11:26:09,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:26:09,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675970983] [2022-07-13 11:26:09,104 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675970983] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:26:09,105 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:26:09,105 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 11:26:09,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491895019] [2022-07-13 11:26:09,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:26:09,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 11:26:09,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:26:09,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 11:26:09,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 11:26:09,106 INFO L87 Difference]: Start difference. First operand 173 states and 255 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 4 states have internal predecessors, (28), 2 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) [2022-07-13 11:26:09,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:26:09,156 INFO L93 Difference]: Finished difference Result 205 states and 303 transitions. [2022-07-13 11:26:09,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 11:26:09,157 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 4 states have internal predecessors, (28), 2 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 43 [2022-07-13 11:26:09,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:26:09,159 INFO L225 Difference]: With dead ends: 205 [2022-07-13 11:26:09,159 INFO L226 Difference]: Without dead ends: 179 [2022-07-13 11:26:09,160 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-13 11:26:09,161 INFO L413 NwaCegarLoop]: 175 mSDtfsCounter, 174 mSDsluCounter, 401 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 576 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 11:26:09,162 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 576 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 11:26:09,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2022-07-13 11:26:09,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 163. [2022-07-13 11:26:09,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 145 states have (on average 1.4206896551724137) internal successors, (206), 147 states have internal predecessors, (206), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (18), 13 states have call predecessors, (18), 12 states have call successors, (18) [2022-07-13 11:26:09,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 237 transitions. [2022-07-13 11:26:09,171 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 237 transitions. Word has length 43 [2022-07-13 11:26:09,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:26:09,171 INFO L495 AbstractCegarLoop]: Abstraction has 163 states and 237 transitions. [2022-07-13 11:26:09,171 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 4 states have internal predecessors, (28), 2 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) [2022-07-13 11:26:09,171 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 237 transitions. [2022-07-13 11:26:09,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-13 11:26:09,173 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:26:09,173 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:26:09,173 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-13 11:26:09,173 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:26:09,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:26:09,174 INFO L85 PathProgramCache]: Analyzing trace with hash -1964302618, now seen corresponding path program 1 times [2022-07-13 11:26:09,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:26:09,174 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89042362] [2022-07-13 11:26:09,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:26:09,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:26:09,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:09,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 11:26:09,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:09,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 11:26:09,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:09,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-13 11:26:09,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:09,204 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-13 11:26:09,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:26:09,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89042362] [2022-07-13 11:26:09,204 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89042362] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:26:09,204 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:26:09,204 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 11:26:09,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081232357] [2022-07-13 11:26:09,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:26:09,205 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 11:26:09,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:26:09,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 11:26:09,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 11:26:09,206 INFO L87 Difference]: Start difference. First operand 163 states and 237 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 2 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) [2022-07-13 11:26:09,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:26:09,242 INFO L93 Difference]: Finished difference Result 185 states and 268 transitions. [2022-07-13 11:26:09,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 11:26:09,242 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 2 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 44 [2022-07-13 11:26:09,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:26:09,243 INFO L225 Difference]: With dead ends: 185 [2022-07-13 11:26:09,243 INFO L226 Difference]: Without dead ends: 178 [2022-07-13 11:26:09,244 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-13 11:26:09,244 INFO L413 NwaCegarLoop]: 152 mSDtfsCounter, 54 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 536 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 11:26:09,244 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 536 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 11:26:09,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2022-07-13 11:26:09,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 164. [2022-07-13 11:26:09,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 146 states have (on average 1.417808219178082) internal successors, (207), 148 states have internal predecessors, (207), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (18), 13 states have call predecessors, (18), 12 states have call successors, (18) [2022-07-13 11:26:09,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 238 transitions. [2022-07-13 11:26:09,250 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 238 transitions. Word has length 44 [2022-07-13 11:26:09,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:26:09,250 INFO L495 AbstractCegarLoop]: Abstraction has 164 states and 238 transitions. [2022-07-13 11:26:09,250 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 2 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) [2022-07-13 11:26:09,250 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 238 transitions. [2022-07-13 11:26:09,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-13 11:26:09,251 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:26:09,251 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:26:09,251 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-13 11:26:09,251 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:26:09,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:26:09,252 INFO L85 PathProgramCache]: Analyzing trace with hash -189295256, now seen corresponding path program 1 times [2022-07-13 11:26:09,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:26:09,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161427450] [2022-07-13 11:26:09,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:26:09,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:26:09,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:09,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 11:26:09,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:09,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 11:26:09,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:09,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-13 11:26:09,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:09,282 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-13 11:26:09,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:26:09,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161427450] [2022-07-13 11:26:09,283 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161427450] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:26:09,283 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:26:09,283 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-13 11:26:09,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903247538] [2022-07-13 11:26:09,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:26:09,283 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 11:26:09,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:26:09,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 11:26:09,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-13 11:26:09,284 INFO L87 Difference]: Start difference. First operand 164 states and 238 transitions. Second operand has 6 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 2 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) [2022-07-13 11:26:09,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:26:09,329 INFO L93 Difference]: Finished difference Result 179 states and 258 transitions. [2022-07-13 11:26:09,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 11:26:09,330 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 2 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 44 [2022-07-13 11:26:09,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:26:09,331 INFO L225 Difference]: With dead ends: 179 [2022-07-13 11:26:09,331 INFO L226 Difference]: Without dead ends: 172 [2022-07-13 11:26:09,331 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-07-13 11:26:09,332 INFO L413 NwaCegarLoop]: 154 mSDtfsCounter, 42 mSDsluCounter, 524 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 678 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 11:26:09,332 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 678 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 11:26:09,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2022-07-13 11:26:09,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 162. [2022-07-13 11:26:09,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 144 states have (on average 1.4097222222222223) internal successors, (203), 146 states have internal predecessors, (203), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (18), 13 states have call predecessors, (18), 12 states have call successors, (18) [2022-07-13 11:26:09,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 234 transitions. [2022-07-13 11:26:09,337 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 234 transitions. Word has length 44 [2022-07-13 11:26:09,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:26:09,338 INFO L495 AbstractCegarLoop]: Abstraction has 162 states and 234 transitions. [2022-07-13 11:26:09,338 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 2 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) [2022-07-13 11:26:09,338 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 234 transitions. [2022-07-13 11:26:09,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-13 11:26:09,338 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:26:09,338 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:26:09,339 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-13 11:26:09,339 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:26:09,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:26:09,339 INFO L85 PathProgramCache]: Analyzing trace with hash 1232722459, now seen corresponding path program 1 times [2022-07-13 11:26:09,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:26:09,339 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629600242] [2022-07-13 11:26:09,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:26:09,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:26:09,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:09,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 11:26:09,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:09,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 11:26:09,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:09,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-13 11:26:09,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:09,420 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-13 11:26:09,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:26:09,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629600242] [2022-07-13 11:26:09,421 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629600242] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 11:26:09,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [555159745] [2022-07-13 11:26:09,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:26:09,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:26:09,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:26:09,422 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 11:26:09,423 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-13 11:26:09,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:09,466 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-13 11:26:09,467 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:26:09,532 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-13 11:26:09,533 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:26:09,612 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-13 11:26:09,612 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [555159745] provided 1 perfect and 1 imperfect interpolant sequences [2022-07-13 11:26:09,612 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-07-13 11:26:09,613 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9, 8] total 17 [2022-07-13 11:26:09,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985505015] [2022-07-13 11:26:09,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:26:09,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 11:26:09,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:26:09,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 11:26:09,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2022-07-13 11:26:09,614 INFO L87 Difference]: Start difference. First operand 162 states and 234 transitions. Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 5 states have internal predecessors, (34), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-13 11:26:09,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:26:09,678 INFO L93 Difference]: Finished difference Result 392 states and 564 transitions. [2022-07-13 11:26:09,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 11:26:09,679 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 5 states have internal predecessors, (34), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 45 [2022-07-13 11:26:09,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:26:09,680 INFO L225 Difference]: With dead ends: 392 [2022-07-13 11:26:09,680 INFO L226 Difference]: Without dead ends: 280 [2022-07-13 11:26:09,680 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 91 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2022-07-13 11:26:09,681 INFO L413 NwaCegarLoop]: 145 mSDtfsCounter, 85 mSDsluCounter, 562 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 707 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 11:26:09,681 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 707 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 11:26:09,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2022-07-13 11:26:09,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 276. [2022-07-13 11:26:09,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 250 states have (on average 1.392) internal successors, (348), 251 states have internal predecessors, (348), 21 states have call successors, (21), 3 states have call predecessors, (21), 4 states have return successors, (26), 23 states have call predecessors, (26), 20 states have call successors, (26) [2022-07-13 11:26:09,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 395 transitions. [2022-07-13 11:26:09,689 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 395 transitions. Word has length 45 [2022-07-13 11:26:09,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:26:09,689 INFO L495 AbstractCegarLoop]: Abstraction has 276 states and 395 transitions. [2022-07-13 11:26:09,689 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 5 states have internal predecessors, (34), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-13 11:26:09,689 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 395 transitions. [2022-07-13 11:26:09,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-13 11:26:09,690 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:26:09,690 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:26:09,710 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-13 11:26:09,910 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,SelfDestructingSolverStorable8 [2022-07-13 11:26:09,910 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:26:09,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:26:09,910 INFO L85 PathProgramCache]: Analyzing trace with hash 221605209, now seen corresponding path program 1 times [2022-07-13 11:26:09,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:26:09,910 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059128694] [2022-07-13 11:26:09,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:26:09,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:26:09,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:09,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 11:26:09,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:09,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 11:26:09,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:09,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-13 11:26:09,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:09,947 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-13 11:26:09,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:26:09,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059128694] [2022-07-13 11:26:09,948 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2059128694] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:26:09,948 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:26:09,948 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 11:26:09,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566857533] [2022-07-13 11:26:09,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:26:09,948 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 11:26:09,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:26:09,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 11:26:09,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 11:26:09,949 INFO L87 Difference]: Start difference. First operand 276 states and 395 transitions. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 2 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) [2022-07-13 11:26:10,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:26:10,000 INFO L93 Difference]: Finished difference Result 422 states and 604 transitions. [2022-07-13 11:26:10,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 11:26:10,001 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 2 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 45 [2022-07-13 11:26:10,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:26:10,004 INFO L225 Difference]: With dead ends: 422 [2022-07-13 11:26:10,004 INFO L226 Difference]: Without dead ends: 382 [2022-07-13 11:26:10,004 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-13 11:26:10,005 INFO L413 NwaCegarLoop]: 152 mSDtfsCounter, 186 mSDsluCounter, 386 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 538 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 11:26:10,005 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 538 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 11:26:10,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2022-07-13 11:26:10,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 311. [2022-07-13 11:26:10,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 311 states, 284 states have (on average 1.3873239436619718) internal successors, (394), 284 states have internal predecessors, (394), 22 states have call successors, (22), 3 states have call predecessors, (22), 4 states have return successors, (27), 24 states have call predecessors, (27), 21 states have call successors, (27) [2022-07-13 11:26:10,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 443 transitions. [2022-07-13 11:26:10,017 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 443 transitions. Word has length 45 [2022-07-13 11:26:10,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:26:10,018 INFO L495 AbstractCegarLoop]: Abstraction has 311 states and 443 transitions. [2022-07-13 11:26:10,018 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 2 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) [2022-07-13 11:26:10,018 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 443 transitions. [2022-07-13 11:26:10,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-07-13 11:26:10,019 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:26:10,019 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:26:10,019 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-13 11:26:10,020 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:26:10,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:26:10,020 INFO L85 PathProgramCache]: Analyzing trace with hash -2044635565, now seen corresponding path program 1 times [2022-07-13 11:26:10,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:26:10,020 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394610834] [2022-07-13 11:26:10,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:26:10,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:26:10,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:10,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 11:26:10,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:10,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 11:26:10,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:10,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-13 11:26:10,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:10,137 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-13 11:26:10,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:26:10,138 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394610834] [2022-07-13 11:26:10,138 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394610834] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 11:26:10,138 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [917359004] [2022-07-13 11:26:10,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:26:10,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:26:10,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:26:10,139 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 11:26:10,140 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-13 11:26:10,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:10,182 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-13 11:26:10,183 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:26:10,219 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-13 11:26:10,220 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 11:26:10,220 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [917359004] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:26:10,220 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 11:26:10,220 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11] total 15 [2022-07-13 11:26:10,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164196958] [2022-07-13 11:26:10,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:26:10,220 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 11:26:10,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:26:10,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 11:26:10,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2022-07-13 11:26:10,221 INFO L87 Difference]: Start difference. First operand 311 states and 443 transitions. Second operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 2 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) [2022-07-13 11:26:10,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:26:10,362 INFO L93 Difference]: Finished difference Result 613 states and 868 transitions. [2022-07-13 11:26:10,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 11:26:10,363 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 2 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 48 [2022-07-13 11:26:10,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:26:10,364 INFO L225 Difference]: With dead ends: 613 [2022-07-13 11:26:10,364 INFO L226 Difference]: Without dead ends: 587 [2022-07-13 11:26:10,365 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2022-07-13 11:26:10,365 INFO L413 NwaCegarLoop]: 154 mSDtfsCounter, 181 mSDsluCounter, 591 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 745 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:26:10,365 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 745 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 11:26:10,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2022-07-13 11:26:10,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 467. [2022-07-13 11:26:10,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 467 states, 428 states have (on average 1.3574766355140186) internal successors, (581), 429 states have internal predecessors, (581), 34 states have call successors, (34), 3 states have call predecessors, (34), 4 states have return successors, (39), 36 states have call predecessors, (39), 33 states have call successors, (39) [2022-07-13 11:26:10,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 467 states and 654 transitions. [2022-07-13 11:26:10,381 INFO L78 Accepts]: Start accepts. Automaton has 467 states and 654 transitions. Word has length 48 [2022-07-13 11:26:10,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:26:10,382 INFO L495 AbstractCegarLoop]: Abstraction has 467 states and 654 transitions. [2022-07-13 11:26:10,382 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 2 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) [2022-07-13 11:26:10,382 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 654 transitions. [2022-07-13 11:26:10,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-07-13 11:26:10,383 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:26:10,383 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:26:10,401 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-13 11:26:10,598 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:26:10,599 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:26:10,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:26:10,599 INFO L85 PathProgramCache]: Analyzing trace with hash -1343570987, now seen corresponding path program 1 times [2022-07-13 11:26:10,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:26:10,599 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595393531] [2022-07-13 11:26:10,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:26:10,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:26:10,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:10,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 11:26:10,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:10,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 11:26:10,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:10,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-13 11:26:10,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:10,625 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-13 11:26:10,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:26:10,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595393531] [2022-07-13 11:26:10,625 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595393531] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:26:10,625 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:26:10,625 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 11:26:10,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591349637] [2022-07-13 11:26:10,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:26:10,626 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 11:26:10,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:26:10,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 11:26:10,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 11:26:10,627 INFO L87 Difference]: Start difference. First operand 467 states and 654 transitions. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 4 states have internal predecessors, (33), 2 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) [2022-07-13 11:26:10,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:26:10,683 INFO L93 Difference]: Finished difference Result 491 states and 685 transitions. [2022-07-13 11:26:10,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 11:26:10,684 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 4 states have internal predecessors, (33), 2 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 48 [2022-07-13 11:26:10,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:26:10,685 INFO L225 Difference]: With dead ends: 491 [2022-07-13 11:26:10,685 INFO L226 Difference]: Without dead ends: 451 [2022-07-13 11:26:10,686 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-13 11:26:10,686 INFO L413 NwaCegarLoop]: 150 mSDtfsCounter, 38 mSDsluCounter, 378 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 528 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 11:26:10,686 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 528 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 11:26:10,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2022-07-13 11:26:10,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 443. [2022-07-13 11:26:10,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 443 states, 404 states have (on average 1.3514851485148516) internal successors, (546), 405 states have internal predecessors, (546), 34 states have call successors, (34), 3 states have call predecessors, (34), 4 states have return successors, (38), 35 states have call predecessors, (38), 32 states have call successors, (38) [2022-07-13 11:26:10,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 618 transitions. [2022-07-13 11:26:10,712 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 618 transitions. Word has length 48 [2022-07-13 11:26:10,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:26:10,713 INFO L495 AbstractCegarLoop]: Abstraction has 443 states and 618 transitions. [2022-07-13 11:26:10,713 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 4 states have internal predecessors, (33), 2 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) [2022-07-13 11:26:10,713 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 618 transitions. [2022-07-13 11:26:10,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-07-13 11:26:10,714 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:26:10,714 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:26:10,714 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-13 11:26:10,714 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:26:10,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:26:10,714 INFO L85 PathProgramCache]: Analyzing trace with hash 502143871, now seen corresponding path program 1 times [2022-07-13 11:26:10,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:26:10,715 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933090834] [2022-07-13 11:26:10,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:26:10,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:26:10,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:10,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 11:26:10,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:10,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 11:26:10,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:10,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-13 11:26:10,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:10,734 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-13 11:26:10,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:26:10,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933090834] [2022-07-13 11:26:10,735 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933090834] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:26:10,735 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:26:10,735 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:26:10,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103262585] [2022-07-13 11:26:10,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:26:10,736 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:26:10,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:26:10,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:26:10,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:26:10,736 INFO L87 Difference]: Start difference. First operand 443 states and 618 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 2 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) [2022-07-13 11:26:10,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:26:10,786 INFO L93 Difference]: Finished difference Result 840 states and 1171 transitions. [2022-07-13 11:26:10,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:26:10,787 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 2 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 48 [2022-07-13 11:26:10,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:26:10,789 INFO L225 Difference]: With dead ends: 840 [2022-07-13 11:26:10,789 INFO L226 Difference]: Without dead ends: 524 [2022-07-13 11:26:10,789 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:26:10,790 INFO L413 NwaCegarLoop]: 178 mSDtfsCounter, 75 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 11:26:10,790 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 426 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 11:26:10,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2022-07-13 11:26:10,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 448. [2022-07-13 11:26:10,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 448 states, 409 states have (on average 1.3227383863080684) internal successors, (541), 410 states have internal predecessors, (541), 34 states have call successors, (34), 3 states have call predecessors, (34), 4 states have return successors, (38), 35 states have call predecessors, (38), 32 states have call successors, (38) [2022-07-13 11:26:10,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 613 transitions. [2022-07-13 11:26:10,801 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 613 transitions. Word has length 48 [2022-07-13 11:26:10,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:26:10,801 INFO L495 AbstractCegarLoop]: Abstraction has 448 states and 613 transitions. [2022-07-13 11:26:10,801 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 2 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) [2022-07-13 11:26:10,801 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 613 transitions. [2022-07-13 11:26:10,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-07-13 11:26:10,802 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:26:10,802 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:26:10,802 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-13 11:26:10,802 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:26:10,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:26:10,802 INFO L85 PathProgramCache]: Analyzing trace with hash -50490859, now seen corresponding path program 1 times [2022-07-13 11:26:10,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:26:10,803 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360004848] [2022-07-13 11:26:10,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:26:10,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:26:10,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:10,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 11:26:10,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:10,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 11:26:10,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:10,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-13 11:26:10,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:10,869 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-13 11:26:10,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:26:10,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360004848] [2022-07-13 11:26:10,870 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360004848] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:26:10,870 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:26:10,870 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-13 11:26:10,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782853594] [2022-07-13 11:26:10,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:26:10,870 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-13 11:26:10,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:26:10,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-13 11:26:10,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-07-13 11:26:10,871 INFO L87 Difference]: Start difference. First operand 448 states and 613 transitions. Second operand has 10 states, 9 states have (on average 4.0) internal successors, (36), 7 states have internal predecessors, (36), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-13 11:26:11,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:26:11,045 INFO L93 Difference]: Finished difference Result 622 states and 846 transitions. [2022-07-13 11:26:11,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-13 11:26:11,046 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.0) internal successors, (36), 7 states have internal predecessors, (36), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 48 [2022-07-13 11:26:11,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:26:11,047 INFO L225 Difference]: With dead ends: 622 [2022-07-13 11:26:11,047 INFO L226 Difference]: Without dead ends: 533 [2022-07-13 11:26:11,048 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2022-07-13 11:26:11,048 INFO L413 NwaCegarLoop]: 218 mSDtfsCounter, 122 mSDsluCounter, 1442 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 1660 SdHoareTripleChecker+Invalid, 293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:26:11,048 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 1660 Invalid, 293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 283 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 11:26:11,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2022-07-13 11:26:11,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 445. [2022-07-13 11:26:11,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 445 states, 406 states have (on average 1.3251231527093597) internal successors, (538), 408 states have internal predecessors, (538), 34 states have call successors, (34), 3 states have call predecessors, (34), 4 states have return successors, (36), 34 states have call predecessors, (36), 32 states have call successors, (36) [2022-07-13 11:26:11,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 608 transitions. [2022-07-13 11:26:11,058 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 608 transitions. Word has length 48 [2022-07-13 11:26:11,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:26:11,059 INFO L495 AbstractCegarLoop]: Abstraction has 445 states and 608 transitions. [2022-07-13 11:26:11,059 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.0) internal successors, (36), 7 states have internal predecessors, (36), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-13 11:26:11,059 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 608 transitions. [2022-07-13 11:26:11,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-07-13 11:26:11,059 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:26:11,060 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1, 1] [2022-07-13 11:26:11,060 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-13 11:26:11,060 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:26:11,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:26:11,060 INFO L85 PathProgramCache]: Analyzing trace with hash -1297236278, now seen corresponding path program 1 times [2022-07-13 11:26:11,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:26:11,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864118565] [2022-07-13 11:26:11,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:26:11,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:26:11,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:11,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 11:26:11,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:11,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 11:26:11,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:11,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-13 11:26:11,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:11,129 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-07-13 11:26:11,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:26:11,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864118565] [2022-07-13 11:26:11,129 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864118565] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 11:26:11,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [313432664] [2022-07-13 11:26:11,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:26:11,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:26:11,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:26:11,131 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) [2022-07-13 11:26:11,189 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-13 11:26:11,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:11,202 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 17 conjunts are in the unsatisfiable core [2022-07-13 11:26:11,203 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:26:11,243 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-07-13 11:26:11,243 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:26:11,325 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-07-13 11:26:11,325 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [313432664] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:26:11,325 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 11:26:11,326 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 15 [2022-07-13 11:26:11,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458436150] [2022-07-13 11:26:11,326 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 11:26:11,326 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-13 11:26:11,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:26:11,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-13 11:26:11,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2022-07-13 11:26:11,327 INFO L87 Difference]: Start difference. First operand 445 states and 608 transitions. Second operand has 15 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 12 states have internal predecessors, (49), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2022-07-13 11:26:11,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:26:11,755 INFO L93 Difference]: Finished difference Result 1186 states and 1619 transitions. [2022-07-13 11:26:11,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-13 11:26:11,756 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 12 states have internal predecessors, (49), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 49 [2022-07-13 11:26:11,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:26:11,758 INFO L225 Difference]: With dead ends: 1186 [2022-07-13 11:26:11,758 INFO L226 Difference]: Without dead ends: 808 [2022-07-13 11:26:11,759 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 96 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=383, Unknown=0, NotChecked=0, Total=462 [2022-07-13 11:26:11,759 INFO L413 NwaCegarLoop]: 246 mSDtfsCounter, 551 mSDsluCounter, 1883 mSDsCounter, 0 mSdLazyCounter, 639 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 554 SdHoareTripleChecker+Valid, 2129 SdHoareTripleChecker+Invalid, 704 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 639 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-13 11:26:11,760 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [554 Valid, 2129 Invalid, 704 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 639 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-13 11:26:11,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 808 states. [2022-07-13 11:26:11,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 808 to 644. [2022-07-13 11:26:11,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 644 states, 589 states have (on average 1.2767402376910018) internal successors, (752), 592 states have internal predecessors, (752), 49 states have call successors, (49), 3 states have call predecessors, (49), 5 states have return successors, (56), 50 states have call predecessors, (56), 46 states have call successors, (56) [2022-07-13 11:26:11,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 644 states to 644 states and 857 transitions. [2022-07-13 11:26:11,779 INFO L78 Accepts]: Start accepts. Automaton has 644 states and 857 transitions. Word has length 49 [2022-07-13 11:26:11,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:26:11,779 INFO L495 AbstractCegarLoop]: Abstraction has 644 states and 857 transitions. [2022-07-13 11:26:11,779 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 12 states have internal predecessors, (49), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2022-07-13 11:26:11,779 INFO L276 IsEmpty]: Start isEmpty. Operand 644 states and 857 transitions. [2022-07-13 11:26:11,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-07-13 11:26:11,780 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:26:11,780 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:26:11,798 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-13 11:26:11,996 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-07-13 11:26:11,997 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:26:11,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:26:11,997 INFO L85 PathProgramCache]: Analyzing trace with hash -2012462520, now seen corresponding path program 1 times [2022-07-13 11:26:11,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:26:11,997 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588404163] [2022-07-13 11:26:11,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:26:11,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:26:12,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:12,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 11:26:12,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:12,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 11:26:12,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:12,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-13 11:26:12,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:12,218 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-13 11:26:12,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:26:12,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588404163] [2022-07-13 11:26:12,219 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588404163] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 11:26:12,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1748874194] [2022-07-13 11:26:12,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:26:12,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:26:12,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:26:12,220 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 11:26:12,245 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-13 11:26:12,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:12,333 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 15 conjunts are in the unsatisfiable core [2022-07-13 11:26:12,335 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:26:12,453 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-13 11:26:12,453 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 11:26:12,454 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1748874194] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:26:12,454 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 11:26:12,454 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [18] total 24 [2022-07-13 11:26:12,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462333939] [2022-07-13 11:26:12,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:26:12,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-13 11:26:12,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:26:12,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-13 11:26:12,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=493, Unknown=0, NotChecked=0, Total=552 [2022-07-13 11:26:12,455 INFO L87 Difference]: Start difference. First operand 644 states and 857 transitions. Second operand has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 2 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) [2022-07-13 11:26:12,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:26:12,660 INFO L93 Difference]: Finished difference Result 842 states and 1127 transitions. [2022-07-13 11:26:12,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-13 11:26:12,660 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 2 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 50 [2022-07-13 11:26:12,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:26:12,663 INFO L225 Difference]: With dead ends: 842 [2022-07-13 11:26:12,663 INFO L226 Difference]: Without dead ends: 823 [2022-07-13 11:26:12,663 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=102, Invalid=654, Unknown=0, NotChecked=0, Total=756 [2022-07-13 11:26:12,663 INFO L413 NwaCegarLoop]: 205 mSDtfsCounter, 284 mSDsluCounter, 962 mSDsCounter, 0 mSdLazyCounter, 350 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 1167 SdHoareTripleChecker+Invalid, 375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:26:12,664 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 1167 Invalid, 375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 350 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 11:26:12,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 823 states. [2022-07-13 11:26:12,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 823 to 673. [2022-07-13 11:26:12,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 673 states, 616 states have (on average 1.271103896103896) internal successors, (783), 620 states have internal predecessors, (783), 51 states have call successors, (51), 3 states have call predecessors, (51), 5 states have return successors, (58), 52 states have call predecessors, (58), 48 states have call successors, (58) [2022-07-13 11:26:12,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 673 states to 673 states and 892 transitions. [2022-07-13 11:26:12,684 INFO L78 Accepts]: Start accepts. Automaton has 673 states and 892 transitions. Word has length 50 [2022-07-13 11:26:12,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:26:12,684 INFO L495 AbstractCegarLoop]: Abstraction has 673 states and 892 transitions. [2022-07-13 11:26:12,684 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 2 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) [2022-07-13 11:26:12,684 INFO L276 IsEmpty]: Start isEmpty. Operand 673 states and 892 transitions. [2022-07-13 11:26:12,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-07-13 11:26:12,685 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:26:12,685 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1, 1, 1, 1] [2022-07-13 11:26:12,715 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-13 11:26:12,901 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-07-13 11:26:12,901 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:26:12,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:26:12,901 INFO L85 PathProgramCache]: Analyzing trace with hash 1388940720, now seen corresponding path program 1 times [2022-07-13 11:26:12,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:26:12,902 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428527451] [2022-07-13 11:26:12,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:26:12,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:26:12,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:12,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 11:26:12,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:12,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 11:26:12,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:12,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-13 11:26:12,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:12,934 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-07-13 11:26:12,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:26:12,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428527451] [2022-07-13 11:26:12,934 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428527451] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:26:12,934 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:26:12,934 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-13 11:26:12,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074527217] [2022-07-13 11:26:12,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:26:12,934 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 11:26:12,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:26:12,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 11:26:12,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-13 11:26:12,935 INFO L87 Difference]: Start difference. First operand 673 states and 892 transitions. Second operand has 7 states, 6 states have (on average 5.5) internal successors, (33), 5 states have internal predecessors, (33), 2 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) [2022-07-13 11:26:13,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:26:13,020 INFO L93 Difference]: Finished difference Result 726 states and 965 transitions. [2022-07-13 11:26:13,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-13 11:26:13,020 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.5) internal successors, (33), 5 states have internal predecessors, (33), 2 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 51 [2022-07-13 11:26:13,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:26:13,022 INFO L225 Difference]: With dead ends: 726 [2022-07-13 11:26:13,022 INFO L226 Difference]: Without dead ends: 724 [2022-07-13 11:26:13,023 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2022-07-13 11:26:13,023 INFO L413 NwaCegarLoop]: 163 mSDtfsCounter, 78 mSDsluCounter, 677 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 840 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 11:26:13,023 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 840 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 11:26:13,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 724 states. [2022-07-13 11:26:13,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 724 to 682. [2022-07-13 11:26:13,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 682 states, 621 states have (on average 1.2689210950080516) internal successors, (788), 628 states have internal predecessors, (788), 54 states have call successors, (54), 4 states have call predecessors, (54), 6 states have return successors, (61), 52 states have call predecessors, (61), 51 states have call successors, (61) [2022-07-13 11:26:13,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 682 states to 682 states and 903 transitions. [2022-07-13 11:26:13,049 INFO L78 Accepts]: Start accepts. Automaton has 682 states and 903 transitions. Word has length 51 [2022-07-13 11:26:13,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:26:13,050 INFO L495 AbstractCegarLoop]: Abstraction has 682 states and 903 transitions. [2022-07-13 11:26:13,050 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.5) internal successors, (33), 5 states have internal predecessors, (33), 2 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) [2022-07-13 11:26:13,050 INFO L276 IsEmpty]: Start isEmpty. Operand 682 states and 903 transitions. [2022-07-13 11:26:13,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-07-13 11:26:13,051 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:26:13,051 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:26:13,051 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-13 11:26:13,051 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:26:13,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:26:13,051 INFO L85 PathProgramCache]: Analyzing trace with hash -1800205628, now seen corresponding path program 1 times [2022-07-13 11:26:13,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:26:13,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267029608] [2022-07-13 11:26:13,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:26:13,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:26:13,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:13,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 11:26:13,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:13,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 11:26:13,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:13,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-13 11:26:13,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:13,080 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-13 11:26:13,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:26:13,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267029608] [2022-07-13 11:26:13,081 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267029608] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:26:13,081 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:26:13,081 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 11:26:13,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869517785] [2022-07-13 11:26:13,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:26:13,082 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 11:26:13,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:26:13,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 11:26:13,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 11:26:13,082 INFO L87 Difference]: Start difference. First operand 682 states and 903 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 2 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) [2022-07-13 11:26:13,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:26:13,125 INFO L93 Difference]: Finished difference Result 699 states and 926 transitions. [2022-07-13 11:26:13,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 11:26:13,126 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 2 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 52 [2022-07-13 11:26:13,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:26:13,128 INFO L225 Difference]: With dead ends: 699 [2022-07-13 11:26:13,128 INFO L226 Difference]: Without dead ends: 673 [2022-07-13 11:26:13,128 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-13 11:26:13,129 INFO L413 NwaCegarLoop]: 147 mSDtfsCounter, 38 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 516 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 11:26:13,129 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 516 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 11:26:13,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states. [2022-07-13 11:26:13,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 567. [2022-07-13 11:26:13,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 567 states, 515 states have (on average 1.2757281553398059) internal successors, (657), 521 states have internal predecessors, (657), 45 states have call successors, (45), 4 states have call predecessors, (45), 6 states have return successors, (52), 43 states have call predecessors, (52), 42 states have call successors, (52) [2022-07-13 11:26:13,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 754 transitions. [2022-07-13 11:26:13,147 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 754 transitions. Word has length 52 [2022-07-13 11:26:13,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:26:13,148 INFO L495 AbstractCegarLoop]: Abstraction has 567 states and 754 transitions. [2022-07-13 11:26:13,148 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 2 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) [2022-07-13 11:26:13,148 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 754 transitions. [2022-07-13 11:26:13,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-07-13 11:26:13,149 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:26:13,149 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:26:13,149 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-13 11:26:13,149 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:26:13,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:26:13,150 INFO L85 PathProgramCache]: Analyzing trace with hash 2067118233, now seen corresponding path program 1 times [2022-07-13 11:26:13,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:26:13,150 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274643684] [2022-07-13 11:26:13,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:26:13,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:26:13,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:13,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 11:26:13,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:13,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 11:26:13,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:13,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-13 11:26:13,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:13,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-13 11:26:13,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:13,222 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-07-13 11:26:13,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:26:13,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274643684] [2022-07-13 11:26:13,223 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274643684] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:26:13,223 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:26:13,223 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-13 11:26:13,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518812918] [2022-07-13 11:26:13,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:26:13,224 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-13 11:26:13,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:26:13,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-13 11:26:13,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-13 11:26:13,224 INFO L87 Difference]: Start difference. First operand 567 states and 754 transitions. Second operand has 8 states, 8 states have (on average 5.0) internal successors, (40), 6 states have internal predecessors, (40), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-13 11:26:13,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:26:13,388 INFO L93 Difference]: Finished difference Result 1253 states and 1690 transitions. [2022-07-13 11:26:13,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-13 11:26:13,389 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 6 states have internal predecessors, (40), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 57 [2022-07-13 11:26:13,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:26:13,392 INFO L225 Difference]: With dead ends: 1253 [2022-07-13 11:26:13,392 INFO L226 Difference]: Without dead ends: 1047 [2022-07-13 11:26:13,392 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-07-13 11:26:13,393 INFO L413 NwaCegarLoop]: 235 mSDtfsCounter, 184 mSDsluCounter, 1125 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 1360 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:26:13,393 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 1360 Invalid, 274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 11:26:13,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1047 states. [2022-07-13 11:26:13,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1047 to 916. [2022-07-13 11:26:13,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 916 states, 840 states have (on average 1.2642857142857142) internal successors, (1062), 847 states have internal predecessors, (1062), 69 states have call successors, (69), 4 states have call predecessors, (69), 6 states have return successors, (76), 68 states have call predecessors, (76), 66 states have call successors, (76) [2022-07-13 11:26:13,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 916 states to 916 states and 1207 transitions. [2022-07-13 11:26:13,434 INFO L78 Accepts]: Start accepts. Automaton has 916 states and 1207 transitions. Word has length 57 [2022-07-13 11:26:13,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:26:13,434 INFO L495 AbstractCegarLoop]: Abstraction has 916 states and 1207 transitions. [2022-07-13 11:26:13,435 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 6 states have internal predecessors, (40), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-13 11:26:13,435 INFO L276 IsEmpty]: Start isEmpty. Operand 916 states and 1207 transitions. [2022-07-13 11:26:13,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-07-13 11:26:13,436 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:26:13,436 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:26:13,436 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-13 11:26:13,436 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:26:13,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:26:13,436 INFO L85 PathProgramCache]: Analyzing trace with hash -1155927203, now seen corresponding path program 1 times [2022-07-13 11:26:13,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:26:13,437 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969753984] [2022-07-13 11:26:13,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:26:13,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:26:13,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:13,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 11:26:13,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:13,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 11:26:13,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:13,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-13 11:26:13,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:13,482 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-13 11:26:13,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:26:13,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969753984] [2022-07-13 11:26:13,482 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969753984] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 11:26:13,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [886534189] [2022-07-13 11:26:13,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:26:13,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:26:13,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:26:13,484 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 11:26:13,512 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-13 11:26:13,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:13,554 INFO L263 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-13 11:26:13,557 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:26:13,616 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-13 11:26:13,616 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:26:13,655 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-13 11:26:13,656 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [886534189] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:26:13,656 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 11:26:13,656 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2022-07-13 11:26:13,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14199683] [2022-07-13 11:26:13,656 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 11:26:13,656 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-13 11:26:13,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:26:13,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-13 11:26:13,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2022-07-13 11:26:13,657 INFO L87 Difference]: Start difference. First operand 916 states and 1207 transitions. Second operand has 14 states, 14 states have (on average 4.714285714285714) internal successors, (66), 11 states have internal predecessors, (66), 4 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2022-07-13 11:26:13,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:26:13,845 INFO L93 Difference]: Finished difference Result 1645 states and 2177 transitions. [2022-07-13 11:26:13,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-13 11:26:13,846 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.714285714285714) internal successors, (66), 11 states have internal predecessors, (66), 4 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 58 [2022-07-13 11:26:13,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:26:13,850 INFO L225 Difference]: With dead ends: 1645 [2022-07-13 11:26:13,850 INFO L226 Difference]: Without dead ends: 1543 [2022-07-13 11:26:13,850 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 115 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2022-07-13 11:26:13,851 INFO L413 NwaCegarLoop]: 308 mSDtfsCounter, 301 mSDsluCounter, 1946 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 309 SdHoareTripleChecker+Valid, 2254 SdHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:26:13,851 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [309 Valid, 2254 Invalid, 320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 296 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 11:26:13,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1543 states. [2022-07-13 11:26:13,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1543 to 928. [2022-07-13 11:26:13,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 928 states, 852 states have (on average 1.2629107981220657) internal successors, (1076), 859 states have internal predecessors, (1076), 69 states have call successors, (69), 4 states have call predecessors, (69), 6 states have return successors, (76), 68 states have call predecessors, (76), 66 states have call successors, (76) [2022-07-13 11:26:13,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 928 states to 928 states and 1221 transitions. [2022-07-13 11:26:13,898 INFO L78 Accepts]: Start accepts. Automaton has 928 states and 1221 transitions. Word has length 58 [2022-07-13 11:26:13,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:26:13,898 INFO L495 AbstractCegarLoop]: Abstraction has 928 states and 1221 transitions. [2022-07-13 11:26:13,899 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.714285714285714) internal successors, (66), 11 states have internal predecessors, (66), 4 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2022-07-13 11:26:13,899 INFO L276 IsEmpty]: Start isEmpty. Operand 928 states and 1221 transitions. [2022-07-13 11:26:13,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-07-13 11:26:13,900 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:26:13,900 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:26:13,918 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-13 11:26:14,115 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:26:14,116 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:26:14,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:26:14,116 INFO L85 PathProgramCache]: Analyzing trace with hash -1021913697, now seen corresponding path program 1 times [2022-07-13 11:26:14,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:26:14,116 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196488478] [2022-07-13 11:26:14,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:26:14,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:26:14,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:14,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 11:26:14,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:14,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 11:26:14,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:14,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-13 11:26:14,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:14,165 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-13 11:26:14,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:26:14,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196488478] [2022-07-13 11:26:14,166 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196488478] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 11:26:14,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1744686660] [2022-07-13 11:26:14,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:26:14,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:26:14,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:26:14,167 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 11:26:14,195 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-13 11:26:14,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:14,236 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-13 11:26:14,237 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:26:14,308 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-13 11:26:14,308 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:26:14,357 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-13 11:26:14,358 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1744686660] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:26:14,358 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 11:26:14,358 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2022-07-13 11:26:14,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514953158] [2022-07-13 11:26:14,358 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 11:26:14,358 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-13 11:26:14,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:26:14,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-13 11:26:14,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2022-07-13 11:26:14,359 INFO L87 Difference]: Start difference. First operand 928 states and 1221 transitions. Second operand has 16 states, 16 states have (on average 4.6875) internal successors, (75), 13 states have internal predecessors, (75), 4 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2022-07-13 11:26:14,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:26:14,674 INFO L93 Difference]: Finished difference Result 2168 states and 2928 transitions. [2022-07-13 11:26:14,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-13 11:26:14,674 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.6875) internal successors, (75), 13 states have internal predecessors, (75), 4 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 58 [2022-07-13 11:26:14,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:26:14,679 INFO L225 Difference]: With dead ends: 2168 [2022-07-13 11:26:14,679 INFO L226 Difference]: Without dead ends: 2046 [2022-07-13 11:26:14,680 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 114 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=354, Unknown=0, NotChecked=0, Total=420 [2022-07-13 11:26:14,680 INFO L413 NwaCegarLoop]: 329 mSDtfsCounter, 257 mSDsluCounter, 2911 mSDsCounter, 0 mSdLazyCounter, 452 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 3240 SdHoareTripleChecker+Invalid, 486 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 452 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 11:26:14,680 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [267 Valid, 3240 Invalid, 486 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 452 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 11:26:14,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2046 states. [2022-07-13 11:26:14,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2046 to 908. [2022-07-13 11:26:14,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 908 states, 833 states have (on average 1.2665066026410565) internal successors, (1055), 842 states have internal predecessors, (1055), 68 states have call successors, (68), 4 states have call predecessors, (68), 6 states have return successors, (72), 65 states have call predecessors, (72), 65 states have call successors, (72) [2022-07-13 11:26:14,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 908 states to 908 states and 1195 transitions. [2022-07-13 11:26:14,749 INFO L78 Accepts]: Start accepts. Automaton has 908 states and 1195 transitions. Word has length 58 [2022-07-13 11:26:14,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:26:14,749 INFO L495 AbstractCegarLoop]: Abstraction has 908 states and 1195 transitions. [2022-07-13 11:26:14,749 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.6875) internal successors, (75), 13 states have internal predecessors, (75), 4 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2022-07-13 11:26:14,749 INFO L276 IsEmpty]: Start isEmpty. Operand 908 states and 1195 transitions. [2022-07-13 11:26:14,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-07-13 11:26:14,750 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:26:14,750 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:26:14,765 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-07-13 11:26:14,963 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:26:14,963 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:26:14,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:26:14,964 INFO L85 PathProgramCache]: Analyzing trace with hash -1110635549, now seen corresponding path program 1 times [2022-07-13 11:26:14,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:26:14,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911041104] [2022-07-13 11:26:14,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:26:14,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:26:14,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:14,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 11:26:14,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:14,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 11:26:14,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:14,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-13 11:26:14,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:15,007 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-13 11:26:15,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:26:15,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911041104] [2022-07-13 11:26:15,007 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911041104] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:26:15,007 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:26:15,007 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-13 11:26:15,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994242014] [2022-07-13 11:26:15,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:26:15,008 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-13 11:26:15,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:26:15,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-13 11:26:15,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-13 11:26:15,008 INFO L87 Difference]: Start difference. First operand 908 states and 1195 transitions. Second operand has 8 states, 8 states have (on average 5.875) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-13 11:26:15,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:26:15,115 INFO L93 Difference]: Finished difference Result 958 states and 1256 transitions. [2022-07-13 11:26:15,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-13 11:26:15,115 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 58 [2022-07-13 11:26:15,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:26:15,117 INFO L225 Difference]: With dead ends: 958 [2022-07-13 11:26:15,117 INFO L226 Difference]: Without dead ends: 752 [2022-07-13 11:26:15,118 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-07-13 11:26:15,118 INFO L413 NwaCegarLoop]: 141 mSDtfsCounter, 44 mSDsluCounter, 728 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 869 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:26:15,118 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 869 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 11:26:15,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 752 states. [2022-07-13 11:26:15,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 752 to 744. [2022-07-13 11:26:15,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 744 states, 679 states have (on average 1.2709867452135493) internal successors, (863), 689 states have internal predecessors, (863), 59 states have call successors, (59), 4 states have call predecessors, (59), 5 states have return successors, (59), 54 states have call predecessors, (59), 56 states have call successors, (59) [2022-07-13 11:26:15,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 744 states to 744 states and 981 transitions. [2022-07-13 11:26:15,143 INFO L78 Accepts]: Start accepts. Automaton has 744 states and 981 transitions. Word has length 58 [2022-07-13 11:26:15,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:26:15,143 INFO L495 AbstractCegarLoop]: Abstraction has 744 states and 981 transitions. [2022-07-13 11:26:15,143 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-13 11:26:15,143 INFO L276 IsEmpty]: Start isEmpty. Operand 744 states and 981 transitions. [2022-07-13 11:26:15,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-07-13 11:26:15,144 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:26:15,144 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:26:15,144 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-07-13 11:26:15,144 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:26:15,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:26:15,144 INFO L85 PathProgramCache]: Analyzing trace with hash 1691045042, now seen corresponding path program 1 times [2022-07-13 11:26:15,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:26:15,144 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431133675] [2022-07-13 11:26:15,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:26:15,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:26:15,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:15,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 11:26:15,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:15,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 11:26:15,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:15,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-13 11:26:15,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:15,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-13 11:26:15,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:15,166 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-13 11:26:15,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:26:15,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431133675] [2022-07-13 11:26:15,167 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [431133675] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:26:15,167 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:26:15,167 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:26:15,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922381402] [2022-07-13 11:26:15,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:26:15,167 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:26:15,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:26:15,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:26:15,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:26:15,167 INFO L87 Difference]: Start difference. First operand 744 states and 981 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-13 11:26:15,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:26:15,245 INFO L93 Difference]: Finished difference Result 1373 states and 1824 transitions. [2022-07-13 11:26:15,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 11:26:15,245 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 59 [2022-07-13 11:26:15,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:26:15,247 INFO L225 Difference]: With dead ends: 1373 [2022-07-13 11:26:15,247 INFO L226 Difference]: Without dead ends: 764 [2022-07-13 11:26:15,248 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 11:26:15,248 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 55 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 11:26:15,249 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 355 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 11:26:15,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 764 states. [2022-07-13 11:26:15,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 764 to 745. [2022-07-13 11:26:15,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 745 states, 680 states have (on average 1.2705882352941176) internal successors, (864), 690 states have internal predecessors, (864), 59 states have call successors, (59), 4 states have call predecessors, (59), 5 states have return successors, (59), 54 states have call predecessors, (59), 56 states have call successors, (59) [2022-07-13 11:26:15,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 745 states to 745 states and 982 transitions. [2022-07-13 11:26:15,271 INFO L78 Accepts]: Start accepts. Automaton has 745 states and 982 transitions. Word has length 59 [2022-07-13 11:26:15,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:26:15,271 INFO L495 AbstractCegarLoop]: Abstraction has 745 states and 982 transitions. [2022-07-13 11:26:15,271 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-13 11:26:15,271 INFO L276 IsEmpty]: Start isEmpty. Operand 745 states and 982 transitions. [2022-07-13 11:26:15,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-07-13 11:26:15,272 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:26:15,272 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:26:15,272 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-07-13 11:26:15,272 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:26:15,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:26:15,272 INFO L85 PathProgramCache]: Analyzing trace with hash -1304426309, now seen corresponding path program 1 times [2022-07-13 11:26:15,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:26:15,272 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840049054] [2022-07-13 11:26:15,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:26:15,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:26:15,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:15,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 11:26:15,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:15,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 11:26:15,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:15,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-13 11:26:15,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:15,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-13 11:26:15,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:15,386 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-13 11:26:15,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:26:15,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840049054] [2022-07-13 11:26:15,386 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840049054] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 11:26:15,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [903730401] [2022-07-13 11:26:15,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:26:15,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:26:15,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:26:15,396 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 11:26:15,397 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-13 11:26:15,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:15,445 INFO L263 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 19 conjunts are in the unsatisfiable core [2022-07-13 11:26:15,448 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:26:15,732 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-13 11:26:15,732 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:26:16,016 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-13 11:26:16,017 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [903730401] provided 1 perfect and 1 imperfect interpolant sequences [2022-07-13 11:26:16,017 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-07-13 11:26:16,017 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [11, 11] total 26 [2022-07-13 11:26:16,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154975421] [2022-07-13 11:26:16,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:26:16,017 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-13 11:26:16,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:26:16,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-13 11:26:16,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=581, Unknown=0, NotChecked=0, Total=650 [2022-07-13 11:26:16,018 INFO L87 Difference]: Start difference. First operand 745 states and 982 transitions. Second operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 8 states have internal predecessors, (44), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-13 11:26:16,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:26:16,381 INFO L93 Difference]: Finished difference Result 1182 states and 1559 transitions. [2022-07-13 11:26:16,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-13 11:26:16,382 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 8 states have internal predecessors, (44), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 60 [2022-07-13 11:26:16,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:26:16,385 INFO L225 Difference]: With dead ends: 1182 [2022-07-13 11:26:16,385 INFO L226 Difference]: Without dead ends: 1147 [2022-07-13 11:26:16,386 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 111 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=116, Invalid=940, Unknown=0, NotChecked=0, Total=1056 [2022-07-13 11:26:16,387 INFO L413 NwaCegarLoop]: 238 mSDtfsCounter, 242 mSDsluCounter, 1469 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 1707 SdHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 11:26:16,387 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 1707 Invalid, 280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 11:26:16,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1147 states. [2022-07-13 11:26:16,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1147 to 1000. [2022-07-13 11:26:16,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1000 states, 912 states have (on average 1.2763157894736843) internal successors, (1164), 923 states have internal predecessors, (1164), 81 states have call successors, (81), 4 states have call predecessors, (81), 6 states have return successors, (84), 77 states have call predecessors, (84), 78 states have call successors, (84) [2022-07-13 11:26:16,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1000 states to 1000 states and 1329 transitions. [2022-07-13 11:26:16,442 INFO L78 Accepts]: Start accepts. Automaton has 1000 states and 1329 transitions. Word has length 60 [2022-07-13 11:26:16,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:26:16,442 INFO L495 AbstractCegarLoop]: Abstraction has 1000 states and 1329 transitions. [2022-07-13 11:26:16,442 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 8 states have internal predecessors, (44), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-13 11:26:16,442 INFO L276 IsEmpty]: Start isEmpty. Operand 1000 states and 1329 transitions. [2022-07-13 11:26:16,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-07-13 11:26:16,443 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:26:16,443 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:26:16,482 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-07-13 11:26:16,659 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-07-13 11:26:16,659 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:26:16,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:26:16,660 INFO L85 PathProgramCache]: Analyzing trace with hash -339625375, now seen corresponding path program 1 times [2022-07-13 11:26:16,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:26:16,661 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527254532] [2022-07-13 11:26:16,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:26:16,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:26:16,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:16,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 11:26:16,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:16,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 11:26:16,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:16,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-13 11:26:16,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:16,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-13 11:26:16,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:16,707 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-07-13 11:26:16,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:26:16,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527254532] [2022-07-13 11:26:16,707 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527254532] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:26:16,707 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:26:16,707 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-13 11:26:16,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668942465] [2022-07-13 11:26:16,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:26:16,708 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 11:26:16,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:26:16,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 11:26:16,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-13 11:26:16,709 INFO L87 Difference]: Start difference. First operand 1000 states and 1329 transitions. Second operand has 7 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-13 11:26:16,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:26:16,811 INFO L93 Difference]: Finished difference Result 1038 states and 1377 transitions. [2022-07-13 11:26:16,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-13 11:26:16,814 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 62 [2022-07-13 11:26:16,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:26:16,817 INFO L225 Difference]: With dead ends: 1038 [2022-07-13 11:26:16,817 INFO L226 Difference]: Without dead ends: 1034 [2022-07-13 11:26:16,817 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2022-07-13 11:26:16,818 INFO L413 NwaCegarLoop]: 158 mSDtfsCounter, 63 mSDsluCounter, 662 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 820 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 11:26:16,821 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 820 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 11:26:16,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1034 states. [2022-07-13 11:26:16,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1034 to 995. [2022-07-13 11:26:16,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 995 states, 906 states have (on average 1.2759381898454747) internal successors, (1156), 919 states have internal predecessors, (1156), 81 states have call successors, (81), 5 states have call predecessors, (81), 7 states have return successors, (84), 75 states have call predecessors, (84), 78 states have call successors, (84) [2022-07-13 11:26:16,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 995 states to 995 states and 1321 transitions. [2022-07-13 11:26:16,857 INFO L78 Accepts]: Start accepts. Automaton has 995 states and 1321 transitions. Word has length 62 [2022-07-13 11:26:16,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:26:16,858 INFO L495 AbstractCegarLoop]: Abstraction has 995 states and 1321 transitions. [2022-07-13 11:26:16,858 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-13 11:26:16,858 INFO L276 IsEmpty]: Start isEmpty. Operand 995 states and 1321 transitions. [2022-07-13 11:26:16,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-07-13 11:26:16,859 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:26:16,859 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:26:16,859 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-07-13 11:26:16,860 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:26:16,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:26:16,860 INFO L85 PathProgramCache]: Analyzing trace with hash -282367073, now seen corresponding path program 1 times [2022-07-13 11:26:16,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:26:16,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91820358] [2022-07-13 11:26:16,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:26:16,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:26:16,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:16,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 11:26:16,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:16,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 11:26:16,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:16,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-13 11:26:16,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:16,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-13 11:26:16,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:16,902 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-07-13 11:26:16,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:26:16,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91820358] [2022-07-13 11:26:16,902 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91820358] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:26:16,902 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:26:16,902 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-13 11:26:16,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196216435] [2022-07-13 11:26:16,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:26:16,903 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 11:26:16,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:26:16,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 11:26:16,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-13 11:26:16,904 INFO L87 Difference]: Start difference. First operand 995 states and 1321 transitions. Second operand has 7 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-13 11:26:16,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:26:16,994 INFO L93 Difference]: Finished difference Result 1028 states and 1362 transitions. [2022-07-13 11:26:16,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-13 11:26:16,994 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 62 [2022-07-13 11:26:16,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:26:16,997 INFO L225 Difference]: With dead ends: 1028 [2022-07-13 11:26:16,997 INFO L226 Difference]: Without dead ends: 1014 [2022-07-13 11:26:16,998 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2022-07-13 11:26:16,998 INFO L413 NwaCegarLoop]: 158 mSDtfsCounter, 63 mSDsluCounter, 662 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 820 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 11:26:16,999 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 820 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 11:26:17,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1014 states. [2022-07-13 11:26:17,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1014 to 980. [2022-07-13 11:26:17,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 980 states, 894 states have (on average 1.2706935123042506) internal successors, (1136), 905 states have internal predecessors, (1136), 78 states have call successors, (78), 5 states have call predecessors, (78), 7 states have return successors, (80), 74 states have call predecessors, (80), 74 states have call successors, (80) [2022-07-13 11:26:17,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 980 states to 980 states and 1294 transitions. [2022-07-13 11:26:17,048 INFO L78 Accepts]: Start accepts. Automaton has 980 states and 1294 transitions. Word has length 62 [2022-07-13 11:26:17,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:26:17,048 INFO L495 AbstractCegarLoop]: Abstraction has 980 states and 1294 transitions. [2022-07-13 11:26:17,049 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-13 11:26:17,049 INFO L276 IsEmpty]: Start isEmpty. Operand 980 states and 1294 transitions. [2022-07-13 11:26:17,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-07-13 11:26:17,051 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:26:17,051 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:26:17,051 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-07-13 11:26:17,051 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:26:17,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:26:17,052 INFO L85 PathProgramCache]: Analyzing trace with hash -1649289642, now seen corresponding path program 1 times [2022-07-13 11:26:17,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:26:17,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406558502] [2022-07-13 11:26:17,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:26:17,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:26:17,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:17,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 11:26:17,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:17,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 11:26:17,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:17,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-13 11:26:17,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:17,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-13 11:26:17,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:17,174 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-13 11:26:17,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:26:17,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406558502] [2022-07-13 11:26:17,174 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406558502] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 11:26:17,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [421432401] [2022-07-13 11:26:17,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:26:17,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:26:17,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:26:17,191 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 11:26:17,192 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-13 11:26:17,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:17,236 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 16 conjunts are in the unsatisfiable core [2022-07-13 11:26:17,237 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:26:17,334 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-07-13 11:26:17,334 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 11:26:17,334 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [421432401] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:26:17,334 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 11:26:17,335 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11] total 15 [2022-07-13 11:26:17,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281846471] [2022-07-13 11:26:17,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:26:17,335 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 11:26:17,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:26:17,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 11:26:17,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2022-07-13 11:26:17,336 INFO L87 Difference]: Start difference. First operand 980 states and 1294 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 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) [2022-07-13 11:26:17,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:26:17,482 INFO L93 Difference]: Finished difference Result 1229 states and 1635 transitions. [2022-07-13 11:26:17,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 11:26:17,483 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 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 62 [2022-07-13 11:26:17,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:26:17,486 INFO L225 Difference]: With dead ends: 1229 [2022-07-13 11:26:17,486 INFO L226 Difference]: Without dead ends: 1213 [2022-07-13 11:26:17,486 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 66 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2022-07-13 11:26:17,487 INFO L413 NwaCegarLoop]: 155 mSDtfsCounter, 218 mSDsluCounter, 372 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 527 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:26:17,487 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 527 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 11:26:17,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1213 states. [2022-07-13 11:26:17,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1213 to 980. [2022-07-13 11:26:17,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 980 states, 894 states have (on average 1.2684563758389262) internal successors, (1134), 905 states have internal predecessors, (1134), 78 states have call successors, (78), 5 states have call predecessors, (78), 7 states have return successors, (80), 74 states have call predecessors, (80), 74 states have call successors, (80) [2022-07-13 11:26:17,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 980 states to 980 states and 1292 transitions. [2022-07-13 11:26:17,534 INFO L78 Accepts]: Start accepts. Automaton has 980 states and 1292 transitions. Word has length 62 [2022-07-13 11:26:17,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:26:17,534 INFO L495 AbstractCegarLoop]: Abstraction has 980 states and 1292 transitions. [2022-07-13 11:26:17,534 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 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) [2022-07-13 11:26:17,535 INFO L276 IsEmpty]: Start isEmpty. Operand 980 states and 1292 transitions. [2022-07-13 11:26:17,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-07-13 11:26:17,535 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:26:17,536 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:26:17,567 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-07-13 11:26:17,770 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-07-13 11:26:17,770 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:26:17,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:26:17,771 INFO L85 PathProgramCache]: Analyzing trace with hash -1828096048, now seen corresponding path program 1 times [2022-07-13 11:26:17,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:26:17,771 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680120218] [2022-07-13 11:26:17,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:26:17,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:26:17,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:17,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 11:26:17,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:17,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 11:26:17,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:17,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-13 11:26:17,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:17,823 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-07-13 11:26:17,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:26:17,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680120218] [2022-07-13 11:26:17,824 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680120218] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:26:17,824 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:26:17,824 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-13 11:26:17,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871935967] [2022-07-13 11:26:17,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:26:17,824 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-13 11:26:17,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:26:17,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-13 11:26:17,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-13 11:26:17,825 INFO L87 Difference]: Start difference. First operand 980 states and 1292 transitions. Second operand has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 7 states have internal predecessors, (47), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-13 11:26:18,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:26:18,021 INFO L93 Difference]: Finished difference Result 1643 states and 2220 transitions. [2022-07-13 11:26:18,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-13 11:26:18,021 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 7 states have internal predecessors, (47), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 62 [2022-07-13 11:26:18,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:26:18,024 INFO L225 Difference]: With dead ends: 1643 [2022-07-13 11:26:18,024 INFO L226 Difference]: Without dead ends: 1189 [2022-07-13 11:26:18,025 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2022-07-13 11:26:18,026 INFO L413 NwaCegarLoop]: 161 mSDtfsCounter, 211 mSDsluCounter, 899 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 1060 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:26:18,026 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 1060 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 11:26:18,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1189 states. [2022-07-13 11:26:18,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1189 to 1055. [2022-07-13 11:26:18,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1055 states, 969 states have (on average 1.2445820433436532) internal successors, (1206), 980 states have internal predecessors, (1206), 78 states have call successors, (78), 5 states have call predecessors, (78), 7 states have return successors, (80), 74 states have call predecessors, (80), 74 states have call successors, (80) [2022-07-13 11:26:18,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1055 states to 1055 states and 1364 transitions. [2022-07-13 11:26:18,064 INFO L78 Accepts]: Start accepts. Automaton has 1055 states and 1364 transitions. Word has length 62 [2022-07-13 11:26:18,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:26:18,065 INFO L495 AbstractCegarLoop]: Abstraction has 1055 states and 1364 transitions. [2022-07-13 11:26:18,065 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 7 states have internal predecessors, (47), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-13 11:26:18,065 INFO L276 IsEmpty]: Start isEmpty. Operand 1055 states and 1364 transitions. [2022-07-13 11:26:18,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-07-13 11:26:18,066 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:26:18,066 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:26:18,066 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-07-13 11:26:18,066 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:26:18,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:26:18,067 INFO L85 PathProgramCache]: Analyzing trace with hash -1826249006, now seen corresponding path program 1 times [2022-07-13 11:26:18,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:26:18,067 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241742638] [2022-07-13 11:26:18,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:26:18,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:26:18,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:18,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 11:26:18,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:18,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 11:26:18,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:18,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-13 11:26:18,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:18,236 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-07-13 11:26:18,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:26:18,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241742638] [2022-07-13 11:26:18,236 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241742638] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:26:18,236 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:26:18,236 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-07-13 11:26:18,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821871415] [2022-07-13 11:26:18,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:26:18,237 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-13 11:26:18,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:26:18,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-13 11:26:18,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2022-07-13 11:26:18,238 INFO L87 Difference]: Start difference. First operand 1055 states and 1364 transitions. Second operand has 14 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 10 states have internal predecessors, (46), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-13 11:26:18,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:26:18,712 INFO L93 Difference]: Finished difference Result 1118 states and 1440 transitions. [2022-07-13 11:26:18,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-13 11:26:18,713 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 10 states have internal predecessors, (46), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 62 [2022-07-13 11:26:18,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:26:18,715 INFO L225 Difference]: With dead ends: 1118 [2022-07-13 11:26:18,716 INFO L226 Difference]: Without dead ends: 1116 [2022-07-13 11:26:18,716 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=389, Unknown=0, NotChecked=0, Total=462 [2022-07-13 11:26:18,716 INFO L413 NwaCegarLoop]: 205 mSDtfsCounter, 380 mSDsluCounter, 1793 mSDsCounter, 0 mSdLazyCounter, 702 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 388 SdHoareTripleChecker+Valid, 1998 SdHoareTripleChecker+Invalid, 741 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 702 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-13 11:26:18,716 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [388 Valid, 1998 Invalid, 741 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 702 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-13 11:26:18,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1116 states. [2022-07-13 11:26:18,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1116 to 1065. [2022-07-13 11:26:18,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1065 states, 977 states have (on average 1.2425793244626406) internal successors, (1214), 989 states have internal predecessors, (1214), 79 states have call successors, (79), 6 states have call predecessors, (79), 8 states have return successors, (81), 74 states have call predecessors, (81), 75 states have call successors, (81) [2022-07-13 11:26:18,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1065 states to 1065 states and 1374 transitions. [2022-07-13 11:26:18,766 INFO L78 Accepts]: Start accepts. Automaton has 1065 states and 1374 transitions. Word has length 62 [2022-07-13 11:26:18,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:26:18,767 INFO L495 AbstractCegarLoop]: Abstraction has 1065 states and 1374 transitions. [2022-07-13 11:26:18,767 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 10 states have internal predecessors, (46), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-13 11:26:18,767 INFO L276 IsEmpty]: Start isEmpty. Operand 1065 states and 1374 transitions. [2022-07-13 11:26:18,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-07-13 11:26:18,768 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:26:18,768 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:26:18,768 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-07-13 11:26:18,768 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:26:18,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:26:18,769 INFO L85 PathProgramCache]: Analyzing trace with hash -654456506, now seen corresponding path program 1 times [2022-07-13 11:26:18,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:26:18,769 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628685927] [2022-07-13 11:26:18,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:26:18,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:26:18,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:18,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 11:26:18,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:18,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 11:26:18,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:18,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 11:26:18,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:18,823 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-13 11:26:18,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:26:18,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628685927] [2022-07-13 11:26:18,823 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628685927] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 11:26:18,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [935501906] [2022-07-13 11:26:18,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:26:18,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:26:18,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:26:18,843 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 11:26:18,903 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-07-13 11:26:18,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:18,949 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-13 11:26:18,950 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:26:18,986 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-13 11:26:18,986 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:26:19,057 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-13 11:26:19,058 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [935501906] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:26:19,058 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 11:26:19,058 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 10 [2022-07-13 11:26:19,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279734971] [2022-07-13 11:26:19,058 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 11:26:19,059 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-13 11:26:19,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:26:19,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-13 11:26:19,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-07-13 11:26:19,060 INFO L87 Difference]: Start difference. First operand 1065 states and 1374 transitions. Second operand has 10 states, 10 states have (on average 5.2) internal successors, (52), 8 states have internal predecessors, (52), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-13 11:26:19,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:26:19,395 INFO L93 Difference]: Finished difference Result 3170 states and 4156 transitions. [2022-07-13 11:26:19,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-13 11:26:19,395 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.2) internal successors, (52), 8 states have internal predecessors, (52), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 65 [2022-07-13 11:26:19,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:26:19,402 INFO L225 Difference]: With dead ends: 3170 [2022-07-13 11:26:19,402 INFO L226 Difference]: Without dead ends: 2732 [2022-07-13 11:26:19,404 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 135 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=270, Unknown=0, NotChecked=0, Total=342 [2022-07-13 11:26:19,404 INFO L413 NwaCegarLoop]: 247 mSDtfsCounter, 286 mSDsluCounter, 1577 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 1824 SdHoareTripleChecker+Invalid, 415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 11:26:19,404 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [296 Valid, 1824 Invalid, 415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 388 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 11:26:19,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2732 states. [2022-07-13 11:26:19,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2732 to 1170. [2022-07-13 11:26:19,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1170 states, 1080 states have (on average 1.2361111111111112) internal successors, (1335), 1090 states have internal predecessors, (1335), 80 states have call successors, (80), 6 states have call predecessors, (80), 9 states have return successors, (88), 78 states have call predecessors, (88), 76 states have call successors, (88) [2022-07-13 11:26:19,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1170 states to 1170 states and 1503 transitions. [2022-07-13 11:26:19,457 INFO L78 Accepts]: Start accepts. Automaton has 1170 states and 1503 transitions. Word has length 65 [2022-07-13 11:26:19,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:26:19,457 INFO L495 AbstractCegarLoop]: Abstraction has 1170 states and 1503 transitions. [2022-07-13 11:26:19,457 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.2) internal successors, (52), 8 states have internal predecessors, (52), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-13 11:26:19,457 INFO L276 IsEmpty]: Start isEmpty. Operand 1170 states and 1503 transitions. [2022-07-13 11:26:19,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-07-13 11:26:19,459 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:26:19,459 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:26:19,477 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-07-13 11:26:19,678 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:26:19,678 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:26:19,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:26:19,679 INFO L85 PathProgramCache]: Analyzing trace with hash 1951567048, now seen corresponding path program 1 times [2022-07-13 11:26:19,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:26:19,679 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381561237] [2022-07-13 11:26:19,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:26:19,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:26:19,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:19,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 11:26:19,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:19,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 11:26:19,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:19,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 11:26:19,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:19,744 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-13 11:26:19,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:26:19,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381561237] [2022-07-13 11:26:19,745 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381561237] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 11:26:19,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [133974775] [2022-07-13 11:26:19,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:26:19,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:26:19,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:26:19,754 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 11:26:19,784 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-07-13 11:26:19,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:19,803 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-13 11:26:19,804 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:26:19,895 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-13 11:26:19,895 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:26:20,020 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-13 11:26:20,021 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [133974775] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:26:20,021 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 11:26:20,021 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 18 [2022-07-13 11:26:20,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984348723] [2022-07-13 11:26:20,022 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 11:26:20,022 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-07-13 11:26:20,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:26:20,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-07-13 11:26:20,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2022-07-13 11:26:20,023 INFO L87 Difference]: Start difference. First operand 1170 states and 1503 transitions. Second operand has 18 states, 18 states have (on average 4.222222222222222) internal successors, (76), 16 states have internal predecessors, (76), 4 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-13 11:26:20,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:26:20,728 INFO L93 Difference]: Finished difference Result 3318 states and 4373 transitions. [2022-07-13 11:26:20,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-07-13 11:26:20,729 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.222222222222222) internal successors, (76), 16 states have internal predecessors, (76), 4 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 65 [2022-07-13 11:26:20,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:26:20,736 INFO L225 Difference]: With dead ends: 3318 [2022-07-13 11:26:20,736 INFO L226 Difference]: Without dead ends: 2835 [2022-07-13 11:26:20,737 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 127 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=252, Invalid=1154, Unknown=0, NotChecked=0, Total=1406 [2022-07-13 11:26:20,738 INFO L413 NwaCegarLoop]: 214 mSDtfsCounter, 610 mSDsluCounter, 2086 mSDsCounter, 0 mSdLazyCounter, 829 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 631 SdHoareTripleChecker+Valid, 2300 SdHoareTripleChecker+Invalid, 929 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 829 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-13 11:26:20,738 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [631 Valid, 2300 Invalid, 929 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 829 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-13 11:26:20,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2835 states. [2022-07-13 11:26:20,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2835 to 1230. [2022-07-13 11:26:20,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1230 states, 1138 states have (on average 1.2319859402460458) internal successors, (1402), 1146 states have internal predecessors, (1402), 81 states have call successors, (81), 6 states have call predecessors, (81), 10 states have return successors, (97), 82 states have call predecessors, (97), 77 states have call successors, (97) [2022-07-13 11:26:20,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1230 states to 1230 states and 1580 transitions. [2022-07-13 11:26:20,791 INFO L78 Accepts]: Start accepts. Automaton has 1230 states and 1580 transitions. Word has length 65 [2022-07-13 11:26:20,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:26:20,791 INFO L495 AbstractCegarLoop]: Abstraction has 1230 states and 1580 transitions. [2022-07-13 11:26:20,792 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.222222222222222) internal successors, (76), 16 states have internal predecessors, (76), 4 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-13 11:26:20,792 INFO L276 IsEmpty]: Start isEmpty. Operand 1230 states and 1580 transitions. [2022-07-13 11:26:20,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-07-13 11:26:20,793 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:26:20,794 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:26:20,821 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-07-13 11:26:21,010 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2022-07-13 11:26:21,011 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:26:21,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:26:21,012 INFO L85 PathProgramCache]: Analyzing trace with hash -520443000, now seen corresponding path program 1 times [2022-07-13 11:26:21,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:26:21,012 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996337045] [2022-07-13 11:26:21,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:26:21,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:26:21,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:21,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 11:26:21,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:21,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 11:26:21,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:21,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 11:26:21,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:21,077 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-13 11:26:21,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:26:21,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996337045] [2022-07-13 11:26:21,077 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996337045] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 11:26:21,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [498219552] [2022-07-13 11:26:21,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:26:21,078 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:26:21,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:26:21,079 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 11:26:21,080 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-07-13 11:26:21,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:21,124 INFO L263 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-13 11:26:21,125 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:26:21,160 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-13 11:26:21,160 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:26:21,227 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-13 11:26:21,227 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [498219552] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:26:21,227 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 11:26:21,227 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 11 [2022-07-13 11:26:21,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769900587] [2022-07-13 11:26:21,228 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 11:26:21,229 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-13 11:26:21,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:26:21,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-13 11:26:21,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-07-13 11:26:21,229 INFO L87 Difference]: Start difference. First operand 1230 states and 1580 transitions. Second operand has 11 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 9 states have internal predecessors, (52), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-13 11:26:21,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:26:21,676 INFO L93 Difference]: Finished difference Result 3599 states and 4859 transitions. [2022-07-13 11:26:21,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-13 11:26:21,676 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 9 states have internal predecessors, (52), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 65 [2022-07-13 11:26:21,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:26:21,694 INFO L225 Difference]: With dead ends: 3599 [2022-07-13 11:26:21,694 INFO L226 Difference]: Without dead ends: 3274 [2022-07-13 11:26:21,697 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 135 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=413, Unknown=0, NotChecked=0, Total=506 [2022-07-13 11:26:21,697 INFO L413 NwaCegarLoop]: 337 mSDtfsCounter, 491 mSDsluCounter, 2102 mSDsCounter, 0 mSdLazyCounter, 519 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 501 SdHoareTripleChecker+Valid, 2439 SdHoareTripleChecker+Invalid, 589 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 519 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 11:26:21,697 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [501 Valid, 2439 Invalid, 589 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 519 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 11:26:21,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3274 states. [2022-07-13 11:26:21,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3274 to 1356. [2022-07-13 11:26:21,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1356 states, 1264 states have (on average 1.2231012658227849) internal successors, (1546), 1272 states have internal predecessors, (1546), 81 states have call successors, (81), 6 states have call predecessors, (81), 10 states have return successors, (97), 82 states have call predecessors, (97), 77 states have call successors, (97) [2022-07-13 11:26:21,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1356 states to 1356 states and 1724 transitions. [2022-07-13 11:26:21,782 INFO L78 Accepts]: Start accepts. Automaton has 1356 states and 1724 transitions. Word has length 65 [2022-07-13 11:26:21,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:26:21,782 INFO L495 AbstractCegarLoop]: Abstraction has 1356 states and 1724 transitions. [2022-07-13 11:26:21,782 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 9 states have internal predecessors, (52), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-13 11:26:21,782 INFO L276 IsEmpty]: Start isEmpty. Operand 1356 states and 1724 transitions. [2022-07-13 11:26:21,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-07-13 11:26:21,785 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:26:21,786 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:26:21,817 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-07-13 11:26:22,002 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2022-07-13 11:26:22,002 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:26:22,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:26:22,003 INFO L85 PathProgramCache]: Analyzing trace with hash -915317052, now seen corresponding path program 1 times [2022-07-13 11:26:22,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:26:22,003 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267249376] [2022-07-13 11:26:22,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:26:22,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:26:22,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:22,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 11:26:22,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:22,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 11:26:22,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:22,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 11:26:22,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:22,060 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-13 11:26:22,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:26:22,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267249376] [2022-07-13 11:26:22,061 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267249376] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 11:26:22,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1159630538] [2022-07-13 11:26:22,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:26:22,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:26:22,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:26:22,062 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 11:26:22,082 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-07-13 11:26:22,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:22,146 INFO L263 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-13 11:26:22,147 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:26:22,253 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-13 11:26:22,253 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:26:22,402 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-13 11:26:22,403 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1159630538] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:26:22,403 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 11:26:22,403 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 11] total 19 [2022-07-13 11:26:22,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393205681] [2022-07-13 11:26:22,403 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 11:26:22,403 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-13 11:26:22,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:26:22,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-13 11:26:22,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=300, Unknown=0, NotChecked=0, Total=342 [2022-07-13 11:26:22,404 INFO L87 Difference]: Start difference. First operand 1356 states and 1724 transitions. Second operand has 19 states, 19 states have (on average 4.0) internal successors, (76), 17 states have internal predecessors, (76), 4 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-13 11:26:23,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:26:23,420 INFO L93 Difference]: Finished difference Result 4186 states and 5617 transitions. [2022-07-13 11:26:23,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-07-13 11:26:23,420 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 4.0) internal successors, (76), 17 states have internal predecessors, (76), 4 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 65 [2022-07-13 11:26:23,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:26:23,426 INFO L225 Difference]: With dead ends: 4186 [2022-07-13 11:26:23,426 INFO L226 Difference]: Without dead ends: 3598 [2022-07-13 11:26:23,428 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 127 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 269 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=284, Invalid=1522, Unknown=0, NotChecked=0, Total=1806 [2022-07-13 11:26:23,428 INFO L413 NwaCegarLoop]: 215 mSDtfsCounter, 948 mSDsluCounter, 2347 mSDsCounter, 0 mSdLazyCounter, 1270 mSolverCounterSat, 156 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 969 SdHoareTripleChecker+Valid, 2562 SdHoareTripleChecker+Invalid, 1426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 156 IncrementalHoareTripleChecker+Valid, 1270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-13 11:26:23,428 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [969 Valid, 2562 Invalid, 1426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [156 Valid, 1270 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-13 11:26:23,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3598 states. [2022-07-13 11:26:23,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3598 to 1272. [2022-07-13 11:26:23,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1272 states, 1181 states have (on average 1.2277730736663843) internal successors, (1450), 1192 states have internal predecessors, (1450), 80 states have call successors, (80), 6 states have call predecessors, (80), 10 states have return successors, (91), 78 states have call predecessors, (91), 76 states have call successors, (91) [2022-07-13 11:26:23,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1272 states to 1272 states and 1621 transitions. [2022-07-13 11:26:23,489 INFO L78 Accepts]: Start accepts. Automaton has 1272 states and 1621 transitions. Word has length 65 [2022-07-13 11:26:23,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:26:23,489 INFO L495 AbstractCegarLoop]: Abstraction has 1272 states and 1621 transitions. [2022-07-13 11:26:23,489 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 4.0) internal successors, (76), 17 states have internal predecessors, (76), 4 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-13 11:26:23,489 INFO L276 IsEmpty]: Start isEmpty. Operand 1272 states and 1621 transitions. [2022-07-13 11:26:23,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-07-13 11:26:23,491 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:26:23,491 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:26:23,508 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-07-13 11:26:23,707 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2022-07-13 11:26:23,707 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:26:23,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:26:23,708 INFO L85 PathProgramCache]: Analyzing trace with hash -1548806121, now seen corresponding path program 1 times [2022-07-13 11:26:23,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:26:23,708 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993596318] [2022-07-13 11:26:23,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:26:23,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:26:23,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:23,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 11:26:23,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:23,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 11:26:23,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:23,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 11:26:23,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:23,760 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-13 11:26:23,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:26:23,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993596318] [2022-07-13 11:26:23,760 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993596318] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 11:26:23,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1030115462] [2022-07-13 11:26:23,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:26:23,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:26:23,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:26:23,762 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 11:26:23,763 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-07-13 11:26:23,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:23,808 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-13 11:26:23,809 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:26:23,851 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-13 11:26:23,851 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 11:26:23,851 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1030115462] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:26:23,852 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 11:26:23,852 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2022-07-13 11:26:23,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745703624] [2022-07-13 11:26:23,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:26:23,852 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:26:23,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:26:23,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:26:23,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-07-13 11:26:23,853 INFO L87 Difference]: Start difference. First operand 1272 states and 1621 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-13 11:26:23,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:26:23,954 INFO L93 Difference]: Finished difference Result 2435 states and 3135 transitions. [2022-07-13 11:26:23,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:26:23,955 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 65 [2022-07-13 11:26:23,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:26:23,957 INFO L225 Difference]: With dead ends: 2435 [2022-07-13 11:26:23,957 INFO L226 Difference]: Without dead ends: 1306 [2022-07-13 11:26:23,958 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-07-13 11:26:23,959 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 27 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:26:23,959 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 385 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 11:26:23,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1306 states. [2022-07-13 11:26:24,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1306 to 1281. [2022-07-13 11:26:24,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1281 states, 1190 states have (on average 1.2285714285714286) internal successors, (1462), 1201 states have internal predecessors, (1462), 80 states have call successors, (80), 6 states have call predecessors, (80), 10 states have return successors, (91), 78 states have call predecessors, (91), 76 states have call successors, (91) [2022-07-13 11:26:24,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1281 states to 1281 states and 1633 transitions. [2022-07-13 11:26:24,007 INFO L78 Accepts]: Start accepts. Automaton has 1281 states and 1633 transitions. Word has length 65 [2022-07-13 11:26:24,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:26:24,007 INFO L495 AbstractCegarLoop]: Abstraction has 1281 states and 1633 transitions. [2022-07-13 11:26:24,007 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-13 11:26:24,007 INFO L276 IsEmpty]: Start isEmpty. Operand 1281 states and 1633 transitions. [2022-07-13 11:26:24,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-07-13 11:26:24,009 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:26:24,009 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:26:24,039 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-07-13 11:26:24,239 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:26:24,239 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:26:24,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:26:24,239 INFO L85 PathProgramCache]: Analyzing trace with hash -267248656, now seen corresponding path program 2 times [2022-07-13 11:26:24,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:26:24,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713069687] [2022-07-13 11:26:24,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:26:24,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:26:24,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:24,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 11:26:24,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:24,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 11:26:24,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:24,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-13 11:26:24,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:24,294 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-13 11:26:24,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:26:24,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713069687] [2022-07-13 11:26:24,294 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713069687] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:26:24,294 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:26:24,294 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-13 11:26:24,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76849550] [2022-07-13 11:26:24,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:26:24,295 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-13 11:26:24,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:26:24,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-13 11:26:24,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-07-13 11:26:24,296 INFO L87 Difference]: Start difference. First operand 1281 states and 1633 transitions. Second operand has 10 states, 10 states have (on average 5.1) internal successors, (51), 8 states have internal predecessors, (51), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-13 11:26:24,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:26:24,621 INFO L93 Difference]: Finished difference Result 2456 states and 3239 transitions. [2022-07-13 11:26:24,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-13 11:26:24,621 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 8 states have internal predecessors, (51), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 65 [2022-07-13 11:26:24,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:26:24,624 INFO L225 Difference]: With dead ends: 2456 [2022-07-13 11:26:24,624 INFO L226 Difference]: Without dead ends: 2247 [2022-07-13 11:26:24,625 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=270, Unknown=0, NotChecked=0, Total=342 [2022-07-13 11:26:24,625 INFO L413 NwaCegarLoop]: 273 mSDtfsCounter, 319 mSDsluCounter, 1525 mSDsCounter, 0 mSdLazyCounter, 353 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 329 SdHoareTripleChecker+Valid, 1798 SdHoareTripleChecker+Invalid, 388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 11:26:24,626 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [329 Valid, 1798 Invalid, 388 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 353 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 11:26:24,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2247 states. [2022-07-13 11:26:24,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2247 to 1434. [2022-07-13 11:26:24,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1434 states, 1343 states have (on average 1.2204020848845867) internal successors, (1639), 1351 states have internal predecessors, (1639), 80 states have call successors, (80), 6 states have call predecessors, (80), 10 states have return successors, (91), 81 states have call predecessors, (91), 76 states have call successors, (91) [2022-07-13 11:26:24,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1434 states to 1434 states and 1810 transitions. [2022-07-13 11:26:24,678 INFO L78 Accepts]: Start accepts. Automaton has 1434 states and 1810 transitions. Word has length 65 [2022-07-13 11:26:24,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:26:24,679 INFO L495 AbstractCegarLoop]: Abstraction has 1434 states and 1810 transitions. [2022-07-13 11:26:24,679 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 8 states have internal predecessors, (51), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-13 11:26:24,679 INFO L276 IsEmpty]: Start isEmpty. Operand 1434 states and 1810 transitions. [2022-07-13 11:26:24,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-07-13 11:26:24,680 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:26:24,681 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:26:24,681 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-07-13 11:26:24,681 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:26:24,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:26:24,681 INFO L85 PathProgramCache]: Analyzing trace with hash -662122708, now seen corresponding path program 1 times [2022-07-13 11:26:24,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:26:24,681 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412537110] [2022-07-13 11:26:24,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:26:24,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:26:24,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:24,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 11:26:24,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:24,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 11:26:24,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:24,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-13 11:26:24,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:24,725 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-13 11:26:24,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:26:24,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412537110] [2022-07-13 11:26:24,726 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412537110] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:26:24,726 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:26:24,726 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-13 11:26:24,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298835711] [2022-07-13 11:26:24,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:26:24,727 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-13 11:26:24,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:26:24,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-13 11:26:24,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-13 11:26:24,728 INFO L87 Difference]: Start difference. First operand 1434 states and 1810 transitions. Second operand has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 7 states have internal predecessors, (51), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-13 11:26:25,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:26:25,069 INFO L93 Difference]: Finished difference Result 2768 states and 3629 transitions. [2022-07-13 11:26:25,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-13 11:26:25,070 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 7 states have internal predecessors, (51), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 65 [2022-07-13 11:26:25,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:26:25,073 INFO L225 Difference]: With dead ends: 2768 [2022-07-13 11:26:25,073 INFO L226 Difference]: Without dead ends: 2306 [2022-07-13 11:26:25,074 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2022-07-13 11:26:25,074 INFO L413 NwaCegarLoop]: 146 mSDtfsCounter, 312 mSDsluCounter, 796 mSDsCounter, 0 mSdLazyCounter, 330 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 322 SdHoareTripleChecker+Valid, 942 SdHoareTripleChecker+Invalid, 372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 11:26:25,074 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [322 Valid, 942 Invalid, 372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 330 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 11:26:25,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2306 states. [2022-07-13 11:26:25,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2306 to 1432. [2022-07-13 11:26:25,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1432 states, 1341 states have (on average 1.2192393736017897) internal successors, (1635), 1347 states have internal predecessors, (1635), 80 states have call successors, (80), 6 states have call predecessors, (80), 10 states have return successors, (90), 83 states have call predecessors, (90), 76 states have call successors, (90) [2022-07-13 11:26:25,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1432 states to 1432 states and 1805 transitions. [2022-07-13 11:26:25,139 INFO L78 Accepts]: Start accepts. Automaton has 1432 states and 1805 transitions. Word has length 65 [2022-07-13 11:26:25,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:26:25,140 INFO L495 AbstractCegarLoop]: Abstraction has 1432 states and 1805 transitions. [2022-07-13 11:26:25,140 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 7 states have internal predecessors, (51), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-13 11:26:25,140 INFO L276 IsEmpty]: Start isEmpty. Operand 1432 states and 1805 transitions. [2022-07-13 11:26:25,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-07-13 11:26:25,141 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:26:25,141 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:26:25,141 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-07-13 11:26:25,141 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:26:25,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:26:25,142 INFO L85 PathProgramCache]: Analyzing trace with hash -560142362, now seen corresponding path program 1 times [2022-07-13 11:26:25,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:26:25,142 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123701578] [2022-07-13 11:26:25,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:26:25,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:26:25,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:25,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 11:26:25,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:25,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 11:26:25,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:25,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-13 11:26:25,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:25,164 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-13 11:26:25,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:26:25,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123701578] [2022-07-13 11:26:25,165 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123701578] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 11:26:25,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1074195494] [2022-07-13 11:26:25,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:26:25,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:26:25,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:26:25,166 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 11:26:25,168 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-07-13 11:26:25,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:25,212 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-13 11:26:25,213 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:26:25,220 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-13 11:26:25,220 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 11:26:25,220 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1074195494] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:26:25,220 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 11:26:25,220 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2022-07-13 11:26:25,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312462486] [2022-07-13 11:26:25,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:26:25,221 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:26:25,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:26:25,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:26:25,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 11:26:25,222 INFO L87 Difference]: Start difference. First operand 1432 states and 1805 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-13 11:26:25,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:26:25,297 INFO L93 Difference]: Finished difference Result 2428 states and 3070 transitions. [2022-07-13 11:26:25,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 11:26:25,297 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 66 [2022-07-13 11:26:25,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:26:25,300 INFO L225 Difference]: With dead ends: 2428 [2022-07-13 11:26:25,300 INFO L226 Difference]: Without dead ends: 1443 [2022-07-13 11:26:25,302 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 73 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-13 11:26:25,302 INFO L413 NwaCegarLoop]: 149 mSDtfsCounter, 14 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 11:26:25,302 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 410 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 11:26:25,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1443 states. [2022-07-13 11:26:25,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1443 to 1433. [2022-07-13 11:26:25,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1433 states, 1342 states have (on average 1.2198211624441133) internal successors, (1637), 1348 states have internal predecessors, (1637), 80 states have call successors, (80), 6 states have call predecessors, (80), 10 states have return successors, (90), 83 states have call predecessors, (90), 76 states have call successors, (90) [2022-07-13 11:26:25,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1433 states to 1433 states and 1807 transitions. [2022-07-13 11:26:25,350 INFO L78 Accepts]: Start accepts. Automaton has 1433 states and 1807 transitions. Word has length 66 [2022-07-13 11:26:25,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:26:25,350 INFO L495 AbstractCegarLoop]: Abstraction has 1433 states and 1807 transitions. [2022-07-13 11:26:25,350 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-13 11:26:25,350 INFO L276 IsEmpty]: Start isEmpty. Operand 1433 states and 1807 transitions. [2022-07-13 11:26:25,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-07-13 11:26:25,352 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:26:25,352 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:26:25,385 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-07-13 11:26:25,586 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2022-07-13 11:26:25,586 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:26:25,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:26:25,586 INFO L85 PathProgramCache]: Analyzing trace with hash -1378433375, now seen corresponding path program 1 times [2022-07-13 11:26:25,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:26:25,586 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807908040] [2022-07-13 11:26:25,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:26:25,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:26:25,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 11:26:25,610 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 11:26:25,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 11:26:25,662 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 11:26:25,662 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-13 11:26:25,663 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-13 11:26:25,664 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-07-13 11:26:25,666 INFO L356 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:26:25,669 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-13 11:26:25,721 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.07 11:26:25 BoogieIcfgContainer [2022-07-13 11:26:25,722 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-13 11:26:25,722 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-13 11:26:25,722 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-13 11:26:25,722 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-13 11:26:25,722 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 11:26:06" (3/4) ... [2022-07-13 11:26:25,726 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-13 11:26:25,726 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-13 11:26:25,727 INFO L158 Benchmark]: Toolchain (without parser) took 19928.31ms. Allocated memory was 92.3MB in the beginning and 406.8MB in the end (delta: 314.6MB). Free memory was 56.7MB in the beginning and 139.1MB in the end (delta: -82.5MB). Peak memory consumption was 231.9MB. Max. memory is 16.1GB. [2022-07-13 11:26:25,730 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 92.3MB. Free memory was 64.3MB in the beginning and 64.2MB in the end (delta: 30.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 11:26:25,731 INFO L158 Benchmark]: CACSL2BoogieTranslator took 262.12ms. Allocated memory was 92.3MB in the beginning and 132.1MB in the end (delta: 39.8MB). Free memory was 56.4MB in the beginning and 103.4MB in the end (delta: -47.1MB). Peak memory consumption was 7.6MB. Max. memory is 16.1GB. [2022-07-13 11:26:25,731 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.82ms. Allocated memory is still 132.1MB. Free memory was 103.4MB in the beginning and 101.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 11:26:25,732 INFO L158 Benchmark]: Boogie Preprocessor took 32.66ms. Allocated memory is still 132.1MB. Free memory was 101.3MB in the beginning and 99.6MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 11:26:25,732 INFO L158 Benchmark]: RCFGBuilder took 472.79ms. Allocated memory is still 132.1MB. Free memory was 99.6MB in the beginning and 79.9MB in the end (delta: 19.7MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2022-07-13 11:26:25,732 INFO L158 Benchmark]: TraceAbstraction took 19089.47ms. Allocated memory was 132.1MB in the beginning and 406.8MB in the end (delta: 274.7MB). Free memory was 79.1MB in the beginning and 139.1MB in the end (delta: -60.1MB). Peak memory consumption was 213.8MB. Max. memory is 16.1GB. [2022-07-13 11:26:25,732 INFO L158 Benchmark]: Witness Printer took 3.78ms. Allocated memory is still 406.8MB. Free memory is still 139.1MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 11:26:25,734 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.09ms. Allocated memory is still 92.3MB. Free memory was 64.3MB in the beginning and 64.2MB in the end (delta: 30.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 262.12ms. Allocated memory was 92.3MB in the beginning and 132.1MB in the end (delta: 39.8MB). Free memory was 56.4MB in the beginning and 103.4MB in the end (delta: -47.1MB). Peak memory consumption was 7.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 59.82ms. Allocated memory is still 132.1MB. Free memory was 103.4MB in the beginning and 101.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 32.66ms. Allocated memory is still 132.1MB. Free memory was 101.3MB in the beginning and 99.6MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 472.79ms. Allocated memory is still 132.1MB. Free memory was 99.6MB in the beginning and 79.9MB in the end (delta: 19.7MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 19089.47ms. Allocated memory was 132.1MB in the beginning and 406.8MB in the end (delta: 274.7MB). Free memory was 79.1MB in the beginning and 139.1MB in the end (delta: -60.1MB). Peak memory consumption was 213.8MB. Max. memory is 16.1GB. * Witness Printer took 3.78ms. Allocated memory is still 406.8MB. Free memory is still 139.1MB. There was no memory consumed. 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 - UnprovableResult [Line: 17]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of bitwiseComplement at line 76. Possible FailurePath: [L226] unsigned int a ; [L227] unsigned int ma = __VERIFIER_nondet_uint(); [L228] signed char ea = __VERIFIER_nondet_char(); [L229] unsigned int b ; [L230] unsigned int mb = __VERIFIER_nondet_uint(); [L231] signed char eb = __VERIFIER_nondet_char(); [L232] unsigned int r_add ; [L233] unsigned int zero ; [L234] int sa ; [L235] int sb ; [L236] int tmp ; [L237] int tmp___0 ; [L238] int tmp___1 ; [L239] int tmp___2 ; [L240] int tmp___3 ; [L241] int tmp___4 ; [L242] int tmp___5 ; [L243] int tmp___6 ; [L244] int tmp___7 ; [L245] int tmp___8 ; [L246] int tmp___9 ; [L247] int __retres23 ; VAL [ea=-125, eb=127] [L251] CALL, EXPR base2flt(0, 0) VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=144115188075855872, \old(m)=0, \old(res = m | ((unsigned int )(e + 128) << 24U))=144115188075855873, m = m & ~ (1U << 24U)=144115188075855872, res = m | ((unsigned int )(e + 128) << 24U)=144115188075855873] [L25] unsigned int res ; [L26] unsigned int __retres4 ; VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=144115188075855872, \old(m)=0, \old(res = m | ((unsigned int )(e + 128) << 24U))=144115188075855873, e=0, m=0, m = m & ~ (1U << 24U)=144115188075855872, res = m | ((unsigned int )(e + 128) << 24U)=144115188075855873] [L29] COND TRUE ! m [L30] __retres4 = 0U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=144115188075855872, \old(m)=0, \old(res = m | ((unsigned int )(e + 128) << 24U))=144115188075855873, __retres4=0, e=0, m=0, m = m & ~ (1U << 24U)=144115188075855872, res = m | ((unsigned int )(e + 128) << 24U)=144115188075855873] [L80] return (__retres4); VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=144115188075855872, \old(m)=0, \old(res = m | ((unsigned int )(e + 128) << 24U))=144115188075855873, \result=0, __retres4=0, e=0, m=0, m = m & ~ (1U << 24U)=144115188075855872, res = m | ((unsigned int )(e + 128) << 24U)=144115188075855873] [L251] RET, EXPR base2flt(0, 0) VAL [base2flt(0, 0)=0, ea=-125, eb=127, m = m & ~ (1U << 24U)=144115188075855872, res = m | ((unsigned int )(e + 128) << 24U)=144115188075855873] [L251] zero = base2flt(0, 0) [L252] CALL, EXPR base2flt(ma, ea) VAL [\old(e)=-125, \old(m = m & ~ (1U << 24U))=144115188075855872, \old(m)=16777216, \old(res = m | ((unsigned int )(e + 128) << 24U))=144115188075855873, m = m & ~ (1U << 24U)=144115188075855872, res = m | ((unsigned int )(e + 128) << 24U)=144115188075855873] [L25] unsigned int res ; [L26] unsigned int __retres4 ; VAL [\old(e)=-125, \old(m = m & ~ (1U << 24U))=144115188075855872, \old(m)=16777216, \old(res = m | ((unsigned int )(e + 128) << 24U))=144115188075855873, e=-125, m=16777216, m = m & ~ (1U << 24U)=144115188075855872, res = m | ((unsigned int )(e + 128) << 24U)=144115188075855873] [L29] COND FALSE !(! m) VAL [\old(e)=-125, \old(m = m & ~ (1U << 24U))=144115188075855872, \old(m)=16777216, \old(res = m | ((unsigned int )(e + 128) << 24U))=144115188075855873, e=-125, m=16777216, m = m & ~ (1U << 24U)=144115188075855872, res = m | ((unsigned int )(e + 128) << 24U)=144115188075855873] [L35] COND FALSE !(m < 1U << 24U) VAL [\old(e)=-125, \old(m = m & ~ (1U << 24U))=144115188075855872, \old(m)=16777216, \old(res = m | ((unsigned int )(e + 128) << 24U))=144115188075855873, e=-125, m=16777216, m = m & ~ (1U << 24U)=144115188075855872, res = m | ((unsigned int )(e + 128) << 24U)=144115188075855873] [L57] COND TRUE 1 VAL [\old(e)=-125, \old(m = m & ~ (1U << 24U))=144115188075855872, \old(m)=16777216, \old(res = m | ((unsigned int )(e + 128) << 24U))=144115188075855873, e=-125, m=16777216, m = m & ~ (1U << 24U)=144115188075855872, res = m | ((unsigned int )(e + 128) << 24U)=144115188075855873] [L59] COND FALSE !(m >= 1U << 25U) VAL [\old(e)=-125, \old(m = m & ~ (1U << 24U))=144115188075855872, \old(m)=16777216, \old(res = m | ((unsigned int )(e + 128) << 24U))=144115188075855873, e=-125, m=16777216, m = m & ~ (1U << 24U)=144115188075855872, res = m | ((unsigned int )(e + 128) << 24U)=144115188075855873] [L76] m = m & ~ (1U << 24U) VAL [\old(e)=-125, \old(m = m & ~ (1U << 24U))=144115188075855872, \old(m)=16777216, \old(res = m | ((unsigned int )(e + 128) << 24U))=144115188075855873, e=-125, m=0, m = m & ~ (1U << 24U)=144115188075855872, res = m | ((unsigned int )(e + 128) << 24U)=144115188075855873] [L77] res = m | ((unsigned int )(e + 128) << 24U) VAL [\old(e)=-125, \old(m = m & ~ (1U << 24U))=144115188075855872, \old(m)=16777216, \old(res = m | ((unsigned int )(e + 128) << 24U))=144115188075855873, e=-125, m=0, m = m & ~ (1U << 24U)=144115188075855872, res=4294967295, res = m | ((unsigned int )(e + 128) << 24U)=50331648] [L78] __retres4 = res VAL [\old(e)=-125, \old(m = m & ~ (1U << 24U))=144115188075855872, \old(m)=16777216, \old(res = m | ((unsigned int )(e + 128) << 24U))=144115188075855873, __retres4=4294967295, e=-125, m=0, m = m & ~ (1U << 24U)=144115188075855872, res=4294967295, res = m | ((unsigned int )(e + 128) << 24U)=50331648] [L80] return (__retres4); VAL [\old(e)=-125, \old(m = m & ~ (1U << 24U))=144115188075855872, \old(m)=16777216, \old(res = m | ((unsigned int )(e + 128) << 24U))=144115188075855873, \result=144115188075855871, __retres4=4294967295, e=-125, m=0, m = m & ~ (1U << 24U)=144115188075855872, res=4294967295, res = m | ((unsigned int )(e + 128) << 24U)=50331648] [L252] RET, EXPR base2flt(ma, ea) VAL [base2flt(ma, ea)=144115188075855871, ea=-125, eb=127, m = m & ~ (1U << 24U)=144115188075855872, ma=16777216, res = m | ((unsigned int )(e + 128) << 24U)=50331648, zero=0] [L252] a = base2flt(ma, ea) [L253] CALL, EXPR base2flt(mb, eb) VAL [\old(e)=127, \old(m = m & ~ (1U << 24U))=144115188075855872, \old(m)=33554432, \old(res = m | ((unsigned int )(e + 128) << 24U))=50331648, m = m & ~ (1U << 24U)=144115188075855872, res = m | ((unsigned int )(e + 128) << 24U)=50331648] [L25] unsigned int res ; [L26] unsigned int __retres4 ; VAL [\old(e)=127, \old(m = m & ~ (1U << 24U))=144115188075855872, \old(m)=33554432, \old(res = m | ((unsigned int )(e + 128) << 24U))=50331648, e=127, m=33554432, m = m & ~ (1U << 24U)=144115188075855872, res = m | ((unsigned int )(e + 128) << 24U)=50331648] [L29] COND FALSE !(! m) VAL [\old(e)=127, \old(m = m & ~ (1U << 24U))=144115188075855872, \old(m)=33554432, \old(res = m | ((unsigned int )(e + 128) << 24U))=50331648, e=127, m=33554432, m = m & ~ (1U << 24U)=144115188075855872, res = m | ((unsigned int )(e + 128) << 24U)=50331648] [L35] COND FALSE !(m < 1U << 24U) VAL [\old(e)=127, \old(m = m & ~ (1U << 24U))=144115188075855872, \old(m)=33554432, \old(res = m | ((unsigned int )(e + 128) << 24U))=50331648, e=127, m=33554432, m = m & ~ (1U << 24U)=144115188075855872, res = m | ((unsigned int )(e + 128) << 24U)=50331648] [L57] COND TRUE 1 VAL [\old(e)=127, \old(m = m & ~ (1U << 24U))=144115188075855872, \old(m)=33554432, \old(res = m | ((unsigned int )(e + 128) << 24U))=50331648, e=127, m=33554432, m = m & ~ (1U << 24U)=144115188075855872, res = m | ((unsigned int )(e + 128) << 24U)=50331648] [L59] COND TRUE m >= 1U << 25U VAL [\old(e)=127, \old(m = m & ~ (1U << 24U))=144115188075855872, \old(m)=33554432, \old(res = m | ((unsigned int )(e + 128) << 24U))=50331648, e=127, m=33554432, m = m & ~ (1U << 24U)=144115188075855872, res = m | ((unsigned int )(e + 128) << 24U)=50331648] [L64] COND TRUE e >= 127 [L65] __retres4 = 4294967295U VAL [\old(e)=127, \old(m = m & ~ (1U << 24U))=144115188075855872, \old(m)=33554432, \old(res = m | ((unsigned int )(e + 128) << 24U))=50331648, __retres4=4294967295, e=127, m=33554432, m = m & ~ (1U << 24U)=144115188075855872, res = m | ((unsigned int )(e + 128) << 24U)=50331648] [L80] return (__retres4); VAL [\old(e)=127, \old(m = m & ~ (1U << 24U))=144115188075855872, \old(m)=33554432, \old(res = m | ((unsigned int )(e + 128) << 24U))=50331648, \result=4294967295, __retres4=4294967295, e=127, m=33554432, m = m & ~ (1U << 24U)=144115188075855872, res = m | ((unsigned int )(e + 128) << 24U)=50331648] [L253] RET, EXPR base2flt(mb, eb) VAL [a=4294967295, base2flt(mb, eb)=4294967295, ea=-125, eb=127, m = m & ~ (1U << 24U)=144115188075855872, ma=16777216, mb=33554432, res = m | ((unsigned int )(e + 128) << 24U)=50331648, zero=0] [L253] b = base2flt(mb, eb) [L255] COND FALSE !(a < zero) VAL [a=4294967295, b=4294967295, ea=-125, eb=127, m = m & ~ (1U << 24U)=144115188075855872, ma=16777216, mb=33554432, res = m | ((unsigned int )(e + 128) << 24U)=50331648, zero=0] [L258] COND TRUE a > zero [L259] tmp = 1 VAL [a=4294967295, b=4294967295, ea=-125, eb=127, m = m & ~ (1U << 24U)=144115188075855872, ma=16777216, mb=33554432, res = m | ((unsigned int )(e + 128) << 24U)=50331648, tmp=1, zero=0] [L263] sa = tmp VAL [a=4294967295, b=4294967295, ea=-125, eb=127, m = m & ~ (1U << 24U)=144115188075855872, ma=16777216, mb=33554432, res = m | ((unsigned int )(e + 128) << 24U)=50331648, sa=1, tmp=1, zero=0] [L265] COND FALSE !(b < zero) VAL [a=4294967295, b=4294967295, ea=-125, eb=127, m = m & ~ (1U << 24U)=144115188075855872, ma=16777216, mb=33554432, res = m | ((unsigned int )(e + 128) << 24U)=50331648, sa=1, tmp=1, zero=0] [L268] COND TRUE b > zero [L269] tmp___0 = 1 VAL [a=4294967295, b=4294967295, ea=-125, eb=127, m = m & ~ (1U << 24U)=144115188075855872, ma=16777216, mb=33554432, res = m | ((unsigned int )(e + 128) << 24U)=50331648, sa=1, tmp=1, tmp___0=1, zero=0] [L273] sb = tmp___0 VAL [a=4294967295, b=4294967295, ea=-125, eb=127, m = m & ~ (1U << 24U)=144115188075855872, ma=16777216, mb=33554432, res = m | ((unsigned int )(e + 128) << 24U)=50331648, sa=1, sb=1, tmp=1, tmp___0=1, zero=0] [L276] CALL addflt(a, b) [L84] unsigned int res ; [L85] unsigned int ma ; [L86] unsigned int mb ; [L87] unsigned int delta ; [L88] int ea ; [L89] int eb ; [L90] unsigned int tmp ; [L91] unsigned int __retres10 ; VAL [\old(a)=4294967295, \old(b)=4294967295, a=4294967295, b=4294967295, m = m & ~ (1U << 24U)=144115188075855872, res = m | ((unsigned int )(e + 128) << 24U)=50331648] [L94] COND FALSE !(a < b) VAL [\old(a)=4294967295, \old(b)=4294967295, a=4294967295, b=4294967295, m = m & ~ (1U << 24U)=144115188075855872, res = m | ((unsigned int )(e + 128) << 24U)=50331648] [L101] COND FALSE !(! b) VAL [\old(a)=4294967295, \old(b)=4294967295, a=4294967295, b=4294967295, m = m & ~ (1U << 24U)=144115188075855872, res = m | ((unsigned int )(e + 128) << 24U)=50331648] [L108] ma = a & ((1U << 24U) - 1U) VAL [\old(a)=4294967295, \old(b)=4294967295, a=4294967295, b=4294967295, m = m & ~ (1U << 24U)=144115188075855872, ma=4294967295, ma = a & ((1U << 24U) - 1U)=16777215, res = m | ((unsigned int )(e + 128) << 24U)=50331648] [L109] ea = (int )(a >> 24U) - 128 VAL [\old(a)=4294967295, \old(b)=4294967295, a=4294967295, b=4294967295, ea=-129, m = m & ~ (1U << 24U)=144115188075855872, ma=4294967295, ma = a & ((1U << 24U) - 1U)=16777215, res = m | ((unsigned int )(e + 128) << 24U)=50331648] [L110] ma = ma | (1U << 24U) VAL [\old(a)=4294967295, \old(b)=4294967295, a=4294967295, b=4294967295, ea=-129, m = m & ~ (1U << 24U)=144115188075855872, ma=3, ma = a & ((1U << 24U) - 1U)=16777215, res = m | ((unsigned int )(e + 128) << 24U)=50331648] [L111] mb = b & ((1U << 24U) - 1U) VAL [\old(a)=4294967295, \old(b)=4294967295, a=4294967295, b=4294967295, ea=-129, m = m & ~ (1U << 24U)=144115188075855872, ma=3, ma = a & ((1U << 24U) - 1U)=16777215, mb=4294967295, mb = b & ((1U << 24U) - 1U)=16777215, res = m | ((unsigned int )(e + 128) << 24U)=50331648] [L112] eb = (int )(b >> 24U) - 128 VAL [\old(a)=4294967295, \old(b)=4294967295, a=4294967295, b=4294967295, ea=-129, eb=127, m = m & ~ (1U << 24U)=144115188075855872, ma=3, ma = a & ((1U << 24U) - 1U)=16777215, mb=4294967295, mb = b & ((1U << 24U) - 1U)=16777215, res = m | ((unsigned int )(e + 128) << 24U)=50331648] [L113] mb = mb | (1U << 24U) VAL [\old(a)=4294967295, \old(b)=4294967295, a=4294967295, b=4294967295, ea=-129, eb=127, m = m & ~ (1U << 24U)=144115188075855872, ma=3, ma = a & ((1U << 24U) - 1U)=16777215, mb=2, mb = b & ((1U << 24U) - 1U)=16777215, res = m | ((unsigned int )(e + 128) << 24U)=50331648] [L114] CALL __VERIFIER_assert(ea >= eb) VAL [\old(cond)=0, m = m & ~ (1U << 24U)=144115188075855872, ma = a & ((1U << 24U) - 1U)=16777215, mb = b & ((1U << 24U) - 1U)=16777215, res = m | ((unsigned int )(e + 128) << 24U)=50331648] [L16] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, m = m & ~ (1U << 24U)=144115188075855872, ma = a & ((1U << 24U) - 1U)=16777215, mb = b & ((1U << 24U) - 1U)=16777215, res = m | ((unsigned int )(e + 128) << 24U)=50331648] [L17] reach_error() VAL [\old(cond)=0, cond=0, m = m & ~ (1U << 24U)=144115188075855872, ma = a & ((1U << 24U) - 1U)=16777215, mb = b & ((1U << 24U) - 1U)=16777215, res = m | ((unsigned int )(e + 128) << 24U)=50331648] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 106 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 19.0s, OverallIterations: 38, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 8.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 8057 SdHoareTripleChecker+Valid, 4.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 7863 mSDsluCounter, 42220 SdHoareTripleChecker+Invalid, 3.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 35138 mSDsCounter, 955 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9268 IncrementalHoareTripleChecker+Invalid, 10223 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 955 mSolverCounterUnsat, 7082 mSDtfsCounter, 9268 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2105 GetRequests, 1621 SyntacticMatches, 15 SemanticMatches, 469 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1283 ImplicationChecksByTransitivity, 3.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1434occurred in iteration=35, InterpolantAutomatonStates: 362, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.2s AutomataMinimizationTime, 37 MinimizatonAttempts, 12764 StatesRemovedByMinimization, 37 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 4.5s InterpolantComputationTime, 2922 NumberOfCodeBlocks, 2922 NumberOfCodeBlocksAsserted, 53 NumberOfCheckSat, 3364 ConstructedInterpolants, 0 QuantifiedInterpolants, 9323 SizeOfPredicates, 88 NumberOfNonLiveVariables, 2664 ConjunctsInSsa, 179 ConjunctsInUnsatCore, 62 InterpolantComputations, 29 PerfectInterpolantSequences, 916/1054 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-07-13 11:26:25,763 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 Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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/bitvector/soft_float_1-3a.c.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.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 2e6e06de31959e386aafc2fb45c848364ae9fea32df4ba40928c607f134f313f --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-13 11:26:27,605 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 11:26:27,607 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 11:26:27,638 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 11:26:27,638 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 11:26:27,639 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 11:26:27,642 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 11:26:27,644 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 11:26:27,645 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 11:26:27,649 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 11:26:27,649 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 11:26:27,652 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 11:26:27,653 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 11:26:27,654 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 11:26:27,655 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 11:26:27,657 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 11:26:27,657 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 11:26:27,658 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 11:26:27,659 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 11:26:27,663 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 11:26:27,664 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 11:26:27,665 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 11:26:27,666 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 11:26:27,667 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 11:26:27,668 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 11:26:27,673 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 11:26:27,673 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 11:26:27,673 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 11:26:27,673 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 11:26:27,674 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 11:26:27,674 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 11:26:27,674 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 11:26:27,676 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 11:26:27,676 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 11:26:27,677 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 11:26:27,677 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 11:26:27,677 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 11:26:27,678 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 11:26:27,678 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 11:26:27,678 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 11:26:27,678 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 11:26:27,680 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 11:26:27,683 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-07-13 11:26:27,710 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 11:26:27,711 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 11:26:27,711 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 11:26:27,711 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 11:26:27,712 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 11:26:27,712 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 11:26:27,712 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 11:26:27,712 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 11:26:27,713 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 11:26:27,713 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 11:26:27,713 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-13 11:26:27,713 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-13 11:26:27,713 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 11:26:27,714 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-13 11:26:27,714 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 11:26:27,714 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-13 11:26:27,714 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-13 11:26:27,714 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-13 11:26:27,714 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-13 11:26:27,714 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-13 11:26:27,714 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 11:26:27,714 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 11:26:27,715 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-13 11:26:27,715 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 11:26:27,715 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 11:26:27,715 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 11:26:27,715 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 11:26:27,715 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 11:26:27,715 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 11:26:27,715 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-13 11:26:27,716 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-13 11:26:27,716 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-13 11:26:27,716 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-13 11:26:27,716 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-13 11:26:27,716 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-13 11:26:27,716 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-13 11:26:27,716 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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 -> 2e6e06de31959e386aafc2fb45c848364ae9fea32df4ba40928c607f134f313f [2022-07-13 11:26:27,959 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 11:26:27,978 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 11:26:27,980 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 11:26:27,981 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 11:26:27,981 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 11:26:27,982 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/soft_float_1-3a.c.cil.c [2022-07-13 11:26:28,021 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/78cfb5831/be1f5a592b8349e78afb16ff55d333c3/FLAG70daeac15 [2022-07-13 11:26:28,401 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 11:26:28,401 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_1-3a.c.cil.c [2022-07-13 11:26:28,407 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/78cfb5831/be1f5a592b8349e78afb16ff55d333c3/FLAG70daeac15 [2022-07-13 11:26:28,417 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/78cfb5831/be1f5a592b8349e78afb16ff55d333c3 [2022-07-13 11:26:28,419 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 11:26:28,420 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 11:26:28,422 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 11:26:28,422 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 11:26:28,424 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 11:26:28,424 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 11:26:28" (1/1) ... [2022-07-13 11:26:28,425 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@725dd6fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:26:28, skipping insertion in model container [2022-07-13 11:26:28,425 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 11:26:28" (1/1) ... [2022-07-13 11:26:28,429 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 11:26:28,456 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 11:26:28,561 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_1-3a.c.cil.c[730,743] [2022-07-13 11:26:28,622 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 11:26:28,629 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 11:26:28,636 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_1-3a.c.cil.c[730,743] [2022-07-13 11:26:28,662 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 11:26:28,670 INFO L208 MainTranslator]: Completed translation [2022-07-13 11:26:28,670 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:26:28 WrapperNode [2022-07-13 11:26:28,670 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 11:26:28,671 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 11:26:28,671 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 11:26:28,671 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 11:26:28,675 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:26:28" (1/1) ... [2022-07-13 11:26:28,692 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:26:28" (1/1) ... [2022-07-13 11:26:28,709 INFO L137 Inliner]: procedures = 17, calls = 19, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 145 [2022-07-13 11:26:28,710 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 11:26:28,710 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 11:26:28,710 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 11:26:28,710 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 11:26:28,715 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:26:28" (1/1) ... [2022-07-13 11:26:28,716 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:26:28" (1/1) ... [2022-07-13 11:26:28,719 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:26:28" (1/1) ... [2022-07-13 11:26:28,719 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:26:28" (1/1) ... [2022-07-13 11:26:28,722 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:26:28" (1/1) ... [2022-07-13 11:26:28,725 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:26:28" (1/1) ... [2022-07-13 11:26:28,726 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:26:28" (1/1) ... [2022-07-13 11:26:28,728 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 11:26:28,729 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 11:26:28,729 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 11:26:28,729 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 11:26:28,729 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:26:28" (1/1) ... [2022-07-13 11:26:28,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 11:26:28,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:26:28,762 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-13 11:26:28,783 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-13 11:26:28,794 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 11:26:28,794 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-13 11:26:28,794 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2022-07-13 11:26:28,794 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2022-07-13 11:26:28,794 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 11:26:28,794 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 11:26:28,794 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-07-13 11:26:28,795 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-07-13 11:26:28,844 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 11:26:28,845 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 11:26:29,018 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 11:26:29,022 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 11:26:29,023 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-13 11:26:29,024 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 11:26:29 BoogieIcfgContainer [2022-07-13 11:26:29,024 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 11:26:29,025 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-13 11:26:29,025 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-13 11:26:29,027 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-13 11:26:29,028 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 11:26:28" (1/3) ... [2022-07-13 11:26:29,028 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36577962 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 11:26:29, skipping insertion in model container [2022-07-13 11:26:29,028 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:26:28" (2/3) ... [2022-07-13 11:26:29,029 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36577962 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 11:26:29, skipping insertion in model container [2022-07-13 11:26:29,029 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 11:26:29" (3/3) ... [2022-07-13 11:26:29,030 INFO L111 eAbstractionObserver]: Analyzing ICFG soft_float_1-3a.c.cil.c [2022-07-13 11:26:29,041 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-13 11:26:29,041 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-13 11:26:29,080 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 11:26:29,084 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=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@24638494, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@63f54d0d [2022-07-13 11:26:29,084 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-13 11:26:29,087 INFO L276 IsEmpty]: Start isEmpty. Operand has 72 states, 59 states have (on average 1.5932203389830508) internal successors, (94), 62 states have internal predecessors, (94), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-07-13 11:26:29,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-13 11:26:29,093 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:26:29,094 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:26:29,094 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:26:29,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:26:29,099 INFO L85 PathProgramCache]: Analyzing trace with hash -1607439287, now seen corresponding path program 1 times [2022-07-13 11:26:29,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 11:26:29,107 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [731371739] [2022-07-13 11:26:29,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:26:29,108 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 11:26:29,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 11:26:29,110 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 11:26:29,111 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-07-13 11:26:29,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:29,189 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-13 11:26:29,193 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:26:29,277 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-13 11:26:29,277 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:26:29,348 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-13 11:26:29,349 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 11:26:29,349 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [731371739] [2022-07-13 11:26:29,349 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [731371739] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:26:29,349 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 11:26:29,349 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2022-07-13 11:26:29,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539286164] [2022-07-13 11:26:29,351 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 11:26:29,356 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 11:26:29,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 11:26:29,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 11:26:29,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-13 11:26:29,390 INFO L87 Difference]: Start difference. First operand has 72 states, 59 states have (on average 1.5932203389830508) internal successors, (94), 62 states have internal predecessors, (94), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-13 11:26:29,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:26:29,509 INFO L93 Difference]: Finished difference Result 194 states and 324 transitions. [2022-07-13 11:26:29,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 11:26:29,514 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 32 [2022-07-13 11:26:29,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:26:29,523 INFO L225 Difference]: With dead ends: 194 [2022-07-13 11:26:29,523 INFO L226 Difference]: Without dead ends: 117 [2022-07-13 11:26:29,526 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-13 11:26:29,529 INFO L413 NwaCegarLoop]: 162 mSDtfsCounter, 61 mSDsluCounter, 576 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 738 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:26:29,530 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 738 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 11:26:29,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2022-07-13 11:26:29,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 80. [2022-07-13 11:26:29,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 65 states have (on average 1.4615384615384615) internal successors, (95), 67 states have internal predecessors, (95), 11 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (15), 11 states have call predecessors, (15), 10 states have call successors, (15) [2022-07-13 11:26:29,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 121 transitions. [2022-07-13 11:26:29,576 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 121 transitions. Word has length 32 [2022-07-13 11:26:29,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:26:29,576 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 121 transitions. [2022-07-13 11:26:29,577 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-13 11:26:29,577 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 121 transitions. [2022-07-13 11:26:29,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-13 11:26:29,579 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:26:29,579 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:26:29,607 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-07-13 11:26:29,785 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 11:26:29,786 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:26:29,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:26:29,787 INFO L85 PathProgramCache]: Analyzing trace with hash 861184615, now seen corresponding path program 1 times [2022-07-13 11:26:29,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 11:26:29,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [654383742] [2022-07-13 11:26:29,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:26:29,788 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 11:26:29,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 11:26:29,789 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 11:26:29,791 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-07-13 11:26:29,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:29,860 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-13 11:26:29,862 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:26:29,910 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-13 11:26:29,910 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 11:26:29,911 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 11:26:29,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [654383742] [2022-07-13 11:26:29,911 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [654383742] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:26:29,911 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:26:29,911 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-13 11:26:29,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984749487] [2022-07-13 11:26:29,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:26:29,912 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 11:26:29,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 11:26:29,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 11:26:29,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-13 11:26:29,913 INFO L87 Difference]: Start difference. First operand 80 states and 121 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-13 11:26:29,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:26:29,983 INFO L93 Difference]: Finished difference Result 169 states and 260 transitions. [2022-07-13 11:26:29,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 11:26:29,983 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 36 [2022-07-13 11:26:29,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:26:29,985 INFO L225 Difference]: With dead ends: 169 [2022-07-13 11:26:29,985 INFO L226 Difference]: Without dead ends: 127 [2022-07-13 11:26:29,985 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-13 11:26:29,986 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 52 mSDsluCounter, 362 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 457 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:26:29,986 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 457 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 11:26:29,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2022-07-13 11:26:29,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 123. [2022-07-13 11:26:29,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 103 states have (on average 1.4660194174757282) internal successors, (151), 104 states have internal predecessors, (151), 16 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (20), 18 states have call predecessors, (20), 15 states have call successors, (20) [2022-07-13 11:26:29,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 187 transitions. [2022-07-13 11:26:29,995 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 187 transitions. Word has length 36 [2022-07-13 11:26:29,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:26:29,995 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 187 transitions. [2022-07-13 11:26:29,996 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-13 11:26:29,996 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 187 transitions. [2022-07-13 11:26:29,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-13 11:26:29,997 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:26:29,997 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:26:30,005 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-07-13 11:26:30,203 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 11:26:30,204 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:26:30,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:26:30,204 INFO L85 PathProgramCache]: Analyzing trace with hash 1541242985, now seen corresponding path program 1 times [2022-07-13 11:26:30,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 11:26:30,205 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1136686670] [2022-07-13 11:26:30,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:26:30,205 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 11:26:30,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 11:26:30,206 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 11:26:30,207 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-07-13 11:26:30,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:30,276 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-13 11:26:30,279 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:26:30,321 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-13 11:26:30,322 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 11:26:30,322 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 11:26:30,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1136686670] [2022-07-13 11:26:30,322 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1136686670] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:26:30,322 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:26:30,322 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-13 11:26:30,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812801820] [2022-07-13 11:26:30,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:26:30,323 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 11:26:30,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 11:26:30,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 11:26:30,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-13 11:26:30,324 INFO L87 Difference]: Start difference. First operand 123 states and 187 transitions. Second operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-13 11:26:30,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:26:30,410 INFO L93 Difference]: Finished difference Result 180 states and 274 transitions. [2022-07-13 11:26:30,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-13 11:26:30,410 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 36 [2022-07-13 11:26:30,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:26:30,411 INFO L225 Difference]: With dead ends: 180 [2022-07-13 11:26:30,411 INFO L226 Difference]: Without dead ends: 141 [2022-07-13 11:26:30,412 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-07-13 11:26:30,413 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 105 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 539 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:26:30,413 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 539 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 11:26:30,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2022-07-13 11:26:30,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 114. [2022-07-13 11:26:30,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 97 states have (on average 1.443298969072165) internal successors, (140), 98 states have internal predecessors, (140), 13 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (17), 15 states have call predecessors, (17), 12 states have call successors, (17) [2022-07-13 11:26:30,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 170 transitions. [2022-07-13 11:26:30,421 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 170 transitions. Word has length 36 [2022-07-13 11:26:30,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:26:30,421 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 170 transitions. [2022-07-13 11:26:30,421 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-13 11:26:30,422 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 170 transitions. [2022-07-13 11:26:30,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-07-13 11:26:30,423 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:26:30,423 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:26:30,431 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Ended with exit code 0 [2022-07-13 11:26:30,629 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 11:26:30,629 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:26:30,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:26:30,630 INFO L85 PathProgramCache]: Analyzing trace with hash 1860643154, now seen corresponding path program 1 times [2022-07-13 11:26:30,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 11:26:30,630 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [717298545] [2022-07-13 11:26:30,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:26:30,631 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 11:26:30,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 11:26:30,632 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 11:26:30,633 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-07-13 11:26:30,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:30,669 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-13 11:26:30,671 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:26:30,714 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-13 11:26:30,715 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:26:30,753 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-13 11:26:30,753 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 11:26:30,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [717298545] [2022-07-13 11:26:30,753 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [717298545] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:26:30,754 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 11:26:30,754 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2022-07-13 11:26:30,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767698449] [2022-07-13 11:26:30,754 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 11:26:30,754 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-13 11:26:30,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 11:26:30,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-13 11:26:30,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-13 11:26:30,755 INFO L87 Difference]: Start difference. First operand 114 states and 170 transitions. Second operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-13 11:26:30,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:26:30,877 INFO L93 Difference]: Finished difference Result 312 states and 476 transitions. [2022-07-13 11:26:30,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-13 11:26:30,877 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 40 [2022-07-13 11:26:30,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:26:30,879 INFO L225 Difference]: With dead ends: 312 [2022-07-13 11:26:30,879 INFO L226 Difference]: Without dead ends: 237 [2022-07-13 11:26:30,879 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-07-13 11:26:30,880 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 197 mSDsluCounter, 549 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 645 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:26:30,880 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 645 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 11:26:30,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2022-07-13 11:26:30,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 178. [2022-07-13 11:26:30,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 155 states have (on average 1.3870967741935485) internal successors, (215), 154 states have internal predecessors, (215), 19 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (25), 25 states have call predecessors, (25), 18 states have call successors, (25) [2022-07-13 11:26:30,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 259 transitions. [2022-07-13 11:26:30,889 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 259 transitions. Word has length 40 [2022-07-13 11:26:30,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:26:30,890 INFO L495 AbstractCegarLoop]: Abstraction has 178 states and 259 transitions. [2022-07-13 11:26:30,890 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-13 11:26:30,890 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 259 transitions. [2022-07-13 11:26:30,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-13 11:26:30,892 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:26:30,892 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:26:30,900 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-07-13 11:26:31,098 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 11:26:31,098 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:26:31,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:26:31,099 INFO L85 PathProgramCache]: Analyzing trace with hash 339137576, now seen corresponding path program 1 times [2022-07-13 11:26:31,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 11:26:31,099 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [353872303] [2022-07-13 11:26:31,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:26:31,100 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 11:26:31,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 11:26:31,101 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 11:26:31,112 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-07-13 11:26:31,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:31,180 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-13 11:26:31,182 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:26:31,201 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-13 11:26:31,202 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 11:26:31,202 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 11:26:31,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [353872303] [2022-07-13 11:26:31,203 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [353872303] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:26:31,203 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:26:31,203 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:26:31,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542109802] [2022-07-13 11:26:31,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:26:31,205 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:26:31,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 11:26:31,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:26:31,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:26:31,206 INFO L87 Difference]: Start difference. First operand 178 states and 259 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 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) [2022-07-13 11:26:31,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:26:31,241 INFO L93 Difference]: Finished difference Result 331 states and 489 transitions. [2022-07-13 11:26:31,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 11:26:31,241 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 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 43 [2022-07-13 11:26:31,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:26:31,243 INFO L225 Difference]: With dead ends: 331 [2022-07-13 11:26:31,243 INFO L226 Difference]: Without dead ends: 265 [2022-07-13 11:26:31,244 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 11:26:31,245 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 66 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 11:26:31,246 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 344 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 11:26:31,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2022-07-13 11:26:31,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 233. [2022-07-13 11:26:31,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 207 states have (on average 1.3478260869565217) internal successors, (279), 206 states have internal predecessors, (279), 22 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (28), 28 states have call predecessors, (28), 21 states have call successors, (28) [2022-07-13 11:26:31,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 329 transitions. [2022-07-13 11:26:31,275 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 329 transitions. Word has length 43 [2022-07-13 11:26:31,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:26:31,275 INFO L495 AbstractCegarLoop]: Abstraction has 233 states and 329 transitions. [2022-07-13 11:26:31,275 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 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) [2022-07-13 11:26:31,275 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 329 transitions. [2022-07-13 11:26:31,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-13 11:26:31,278 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:26:31,278 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:26:31,287 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-07-13 11:26:31,485 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 11:26:31,486 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:26:31,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:26:31,487 INFO L85 PathProgramCache]: Analyzing trace with hash -1682069059, now seen corresponding path program 1 times [2022-07-13 11:26:31,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 11:26:31,487 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1862661417] [2022-07-13 11:26:31,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:26:31,487 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 11:26:31,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 11:26:31,504 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 11:26:31,505 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-07-13 11:26:31,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:31,539 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-13 11:26:31,540 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:26:31,562 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-13 11:26:31,562 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 11:26:31,562 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 11:26:31,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1862661417] [2022-07-13 11:26:31,563 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1862661417] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:26:31,563 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:26:31,564 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:26:31,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821746903] [2022-07-13 11:26:31,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:26:31,565 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:26:31,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 11:26:31,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:26:31,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:26:31,566 INFO L87 Difference]: Start difference. First operand 233 states and 329 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-13 11:26:31,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:26:31,609 INFO L93 Difference]: Finished difference Result 408 states and 573 transitions. [2022-07-13 11:26:31,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 11:26:31,610 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 43 [2022-07-13 11:26:31,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:26:31,613 INFO L225 Difference]: With dead ends: 408 [2022-07-13 11:26:31,613 INFO L226 Difference]: Without dead ends: 178 [2022-07-13 11:26:31,613 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 11:26:31,616 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 25 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 11:26:31,616 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 250 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 11:26:31,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2022-07-13 11:26:31,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 166. [2022-07-13 11:26:31,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 146 states have (on average 1.3082191780821917) internal successors, (191), 148 states have internal predecessors, (191), 15 states have call successors, (15), 2 states have call predecessors, (15), 4 states have return successors, (20), 17 states have call predecessors, (20), 14 states have call successors, (20) [2022-07-13 11:26:31,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 226 transitions. [2022-07-13 11:26:31,628 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 226 transitions. Word has length 43 [2022-07-13 11:26:31,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:26:31,629 INFO L495 AbstractCegarLoop]: Abstraction has 166 states and 226 transitions. [2022-07-13 11:26:31,629 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-13 11:26:31,629 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 226 transitions. [2022-07-13 11:26:31,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-13 11:26:31,631 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:26:31,631 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:26:31,651 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Ended with exit code 0 [2022-07-13 11:26:31,837 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 11:26:31,837 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:26:31,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:26:31,838 INFO L85 PathProgramCache]: Analyzing trace with hash -690232792, now seen corresponding path program 1 times [2022-07-13 11:26:31,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 11:26:31,840 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [852606368] [2022-07-13 11:26:31,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:26:31,841 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 11:26:31,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 11:26:31,842 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 11:26:31,843 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-07-13 11:26:31,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:31,880 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-13 11:26:31,884 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:26:31,985 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-13 11:26:31,985 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:26:32,065 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-13 11:26:32,065 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 11:26:32,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [852606368] [2022-07-13 11:26:32,065 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [852606368] provided 1 perfect and 1 imperfect interpolant sequences [2022-07-13 11:26:32,065 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 11:26:32,065 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 14 [2022-07-13 11:26:32,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961686585] [2022-07-13 11:26:32,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:26:32,066 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 11:26:32,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 11:26:32,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 11:26:32,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2022-07-13 11:26:32,067 INFO L87 Difference]: Start difference. First operand 166 states and 226 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 2 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) [2022-07-13 11:26:32,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:26:32,319 INFO L93 Difference]: Finished difference Result 316 states and 459 transitions. [2022-07-13 11:26:32,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-13 11:26:32,320 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 2 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 44 [2022-07-13 11:26:32,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:26:32,321 INFO L225 Difference]: With dead ends: 316 [2022-07-13 11:26:32,321 INFO L226 Difference]: Without dead ends: 280 [2022-07-13 11:26:32,321 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2022-07-13 11:26:32,322 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 193 mSDsluCounter, 407 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 502 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 11:26:32,322 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 502 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 11:26:32,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2022-07-13 11:26:32,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 204. [2022-07-13 11:26:32,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 178 states have (on average 1.303370786516854) internal successors, (232), 181 states have internal predecessors, (232), 21 states have call successors, (21), 2 states have call predecessors, (21), 4 states have return successors, (26), 23 states have call predecessors, (26), 20 states have call successors, (26) [2022-07-13 11:26:32,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 279 transitions. [2022-07-13 11:26:32,330 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 279 transitions. Word has length 44 [2022-07-13 11:26:32,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:26:32,330 INFO L495 AbstractCegarLoop]: Abstraction has 204 states and 279 transitions. [2022-07-13 11:26:32,331 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 2 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) [2022-07-13 11:26:32,331 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 279 transitions. [2022-07-13 11:26:32,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-13 11:26:32,332 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:26:32,332 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:26:32,351 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-07-13 11:26:32,539 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 11:26:32,539 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:26:32,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:26:32,539 INFO L85 PathProgramCache]: Analyzing trace with hash 1084774570, now seen corresponding path program 1 times [2022-07-13 11:26:32,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 11:26:32,540 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [925674878] [2022-07-13 11:26:32,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:26:32,540 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 11:26:32,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 11:26:32,541 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 11:26:32,542 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-07-13 11:26:32,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:32,575 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-13 11:26:32,576 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:26:32,596 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-13 11:26:32,596 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 11:26:32,596 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 11:26:32,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [925674878] [2022-07-13 11:26:32,596 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [925674878] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:26:32,596 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:26:32,596 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 11:26:32,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73145926] [2022-07-13 11:26:32,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:26:32,597 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 11:26:32,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 11:26:32,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 11:26:32,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 11:26:32,598 INFO L87 Difference]: Start difference. First operand 204 states and 279 transitions. Second operand has 5 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 2 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) [2022-07-13 11:26:32,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:26:32,620 INFO L93 Difference]: Finished difference Result 211 states and 285 transitions. [2022-07-13 11:26:32,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 11:26:32,620 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 2 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 44 [2022-07-13 11:26:32,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:26:32,621 INFO L225 Difference]: With dead ends: 211 [2022-07-13 11:26:32,621 INFO L226 Difference]: Without dead ends: 204 [2022-07-13 11:26:32,622 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-13 11:26:32,622 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 5 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 11:26:32,622 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 380 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 11:26:32,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2022-07-13 11:26:32,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 204. [2022-07-13 11:26:32,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 178 states have (on average 1.2865168539325842) internal successors, (229), 181 states have internal predecessors, (229), 21 states have call successors, (21), 2 states have call predecessors, (21), 4 states have return successors, (26), 23 states have call predecessors, (26), 20 states have call successors, (26) [2022-07-13 11:26:32,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 276 transitions. [2022-07-13 11:26:32,628 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 276 transitions. Word has length 44 [2022-07-13 11:26:32,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:26:32,629 INFO L495 AbstractCegarLoop]: Abstraction has 204 states and 276 transitions. [2022-07-13 11:26:32,629 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 2 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) [2022-07-13 11:26:32,629 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 276 transitions. [2022-07-13 11:26:32,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-13 11:26:32,629 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:26:32,629 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2022-07-13 11:26:32,638 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-07-13 11:26:32,836 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 11:26:32,836 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:26:32,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:26:32,837 INFO L85 PathProgramCache]: Analyzing trace with hash -1077808761, now seen corresponding path program 2 times [2022-07-13 11:26:32,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 11:26:32,837 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1947042395] [2022-07-13 11:26:32,837 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 11:26:32,837 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 11:26:32,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 11:26:32,842 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 11:26:32,843 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-07-13 11:26:32,872 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-13 11:26:32,872 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 11:26:32,873 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-13 11:26:32,874 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:26:32,939 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-07-13 11:26:32,940 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 11:26:32,940 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 11:26:32,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1947042395] [2022-07-13 11:26:32,940 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1947042395] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:26:32,940 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:26:32,940 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-13 11:26:32,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039856598] [2022-07-13 11:26:32,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:26:32,941 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 11:26:32,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 11:26:32,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 11:26:32,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-13 11:26:32,941 INFO L87 Difference]: Start difference. First operand 204 states and 276 transitions. Second operand has 6 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 2 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) [2022-07-13 11:26:32,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:26:32,992 INFO L93 Difference]: Finished difference Result 247 states and 337 transitions. [2022-07-13 11:26:32,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 11:26:32,992 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 2 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 44 [2022-07-13 11:26:32,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:26:32,993 INFO L225 Difference]: With dead ends: 247 [2022-07-13 11:26:32,993 INFO L226 Difference]: Without dead ends: 245 [2022-07-13 11:26:32,994 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-07-13 11:26:32,994 INFO L413 NwaCegarLoop]: 131 mSDtfsCounter, 38 mSDsluCounter, 466 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 597 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 13 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 11:26:32,994 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 597 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 13 Unchecked, 0.0s Time] [2022-07-13 11:26:32,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2022-07-13 11:26:33,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 208. [2022-07-13 11:26:33,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 181 states have (on average 1.281767955801105) internal successors, (232), 184 states have internal predecessors, (232), 21 states have call successors, (21), 3 states have call predecessors, (21), 5 states have return successors, (26), 23 states have call predecessors, (26), 20 states have call successors, (26) [2022-07-13 11:26:33,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 279 transitions. [2022-07-13 11:26:33,009 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 279 transitions. Word has length 44 [2022-07-13 11:26:33,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:26:33,009 INFO L495 AbstractCegarLoop]: Abstraction has 208 states and 279 transitions. [2022-07-13 11:26:33,009 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 2 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) [2022-07-13 11:26:33,010 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 279 transitions. [2022-07-13 11:26:33,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-13 11:26:33,010 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:26:33,010 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2022-07-13 11:26:33,018 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-07-13 11:26:33,218 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 11:26:33,219 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:26:33,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:26:33,219 INFO L85 PathProgramCache]: Analyzing trace with hash -1020550459, now seen corresponding path program 1 times [2022-07-13 11:26:33,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 11:26:33,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1870323599] [2022-07-13 11:26:33,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:26:33,220 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 11:26:33,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 11:26:33,221 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 11:26:33,225 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-07-13 11:26:33,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:33,258 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-13 11:26:33,260 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:26:33,389 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-07-13 11:26:33,389 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:26:33,466 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-07-13 11:26:33,466 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 11:26:33,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1870323599] [2022-07-13 11:26:33,466 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1870323599] provided 1 perfect and 1 imperfect interpolant sequences [2022-07-13 11:26:33,466 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 11:26:33,466 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [12] total 16 [2022-07-13 11:26:33,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419064941] [2022-07-13 11:26:33,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:26:33,467 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 11:26:33,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 11:26:33,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 11:26:33,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2022-07-13 11:26:33,467 INFO L87 Difference]: Start difference. First operand 208 states and 279 transitions. Second operand has 6 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 2 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) [2022-07-13 11:26:33,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:26:33,576 INFO L93 Difference]: Finished difference Result 265 states and 359 transitions. [2022-07-13 11:26:33,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-13 11:26:33,576 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 2 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 44 [2022-07-13 11:26:33,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:26:33,577 INFO L225 Difference]: With dead ends: 265 [2022-07-13 11:26:33,577 INFO L226 Difference]: Without dead ends: 263 [2022-07-13 11:26:33,578 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=264, Unknown=0, NotChecked=0, Total=306 [2022-07-13 11:26:33,578 INFO L413 NwaCegarLoop]: 129 mSDtfsCounter, 84 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 508 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:26:33,578 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 508 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 11:26:33,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2022-07-13 11:26:33,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 212. [2022-07-13 11:26:33,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 184 states have (on average 1.2771739130434783) internal successors, (235), 187 states have internal predecessors, (235), 21 states have call successors, (21), 4 states have call predecessors, (21), 6 states have return successors, (26), 23 states have call predecessors, (26), 20 states have call successors, (26) [2022-07-13 11:26:33,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 282 transitions. [2022-07-13 11:26:33,589 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 282 transitions. Word has length 44 [2022-07-13 11:26:33,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:26:33,590 INFO L495 AbstractCegarLoop]: Abstraction has 212 states and 282 transitions. [2022-07-13 11:26:33,590 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 2 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) [2022-07-13 11:26:33,590 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 282 transitions. [2022-07-13 11:26:33,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-13 11:26:33,590 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:26:33,591 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:26:33,613 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-07-13 11:26:33,797 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 11:26:33,797 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:26:33,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:26:33,798 INFO L85 PathProgramCache]: Analyzing trace with hash 1134786859, now seen corresponding path program 1 times [2022-07-13 11:26:33,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 11:26:33,798 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2021800726] [2022-07-13 11:26:33,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:26:33,798 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 11:26:33,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 11:26:33,800 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 11:26:33,800 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-07-13 11:26:33,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:33,832 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-13 11:26:33,833 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:26:33,847 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-13 11:26:33,847 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 11:26:33,847 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 11:26:33,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2021800726] [2022-07-13 11:26:33,847 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2021800726] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:26:33,848 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:26:33,848 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:26:33,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320757118] [2022-07-13 11:26:33,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:26:33,848 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:26:33,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 11:26:33,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:26:33,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:26:33,849 INFO L87 Difference]: Start difference. First operand 212 states and 282 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 2 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) [2022-07-13 11:26:33,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:26:33,877 INFO L93 Difference]: Finished difference Result 351 states and 481 transitions. [2022-07-13 11:26:33,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 11:26:33,878 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 2 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 45 [2022-07-13 11:26:33,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:26:33,879 INFO L225 Difference]: With dead ends: 351 [2022-07-13 11:26:33,879 INFO L226 Difference]: Without dead ends: 299 [2022-07-13 11:26:33,879 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 11:26:33,880 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 75 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 11:26:33,880 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 309 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 11:26:33,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2022-07-13 11:26:33,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 231. [2022-07-13 11:26:33,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 200 states have (on average 1.285) internal successors, (257), 202 states have internal predecessors, (257), 24 states have call successors, (24), 4 states have call predecessors, (24), 6 states have return successors, (29), 26 states have call predecessors, (29), 23 states have call successors, (29) [2022-07-13 11:26:33,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 310 transitions. [2022-07-13 11:26:33,899 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 310 transitions. Word has length 45 [2022-07-13 11:26:33,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:26:33,899 INFO L495 AbstractCegarLoop]: Abstraction has 231 states and 310 transitions. [2022-07-13 11:26:33,900 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 2 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) [2022-07-13 11:26:33,900 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 310 transitions. [2022-07-13 11:26:33,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-07-13 11:26:33,900 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:26:33,900 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:26:33,909 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-07-13 11:26:34,107 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 11:26:34,107 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:26:34,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:26:34,108 INFO L85 PathProgramCache]: Analyzing trace with hash 702695573, now seen corresponding path program 1 times [2022-07-13 11:26:34,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 11:26:34,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [375653481] [2022-07-13 11:26:34,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:26:34,108 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 11:26:34,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 11:26:34,109 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 11:26:34,110 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-07-13 11:26:34,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:34,151 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-13 11:26:34,152 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:26:34,164 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-13 11:26:34,164 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 11:26:34,164 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 11:26:34,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [375653481] [2022-07-13 11:26:34,164 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [375653481] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:26:34,164 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:26:34,165 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:26:34,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821831814] [2022-07-13 11:26:34,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:26:34,165 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:26:34,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 11:26:34,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:26:34,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:26:34,166 INFO L87 Difference]: Start difference. First operand 231 states and 310 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 2 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) [2022-07-13 11:26:34,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:26:34,184 INFO L93 Difference]: Finished difference Result 246 states and 326 transitions. [2022-07-13 11:26:34,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:26:34,185 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 2 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 48 [2022-07-13 11:26:34,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:26:34,187 INFO L225 Difference]: With dead ends: 246 [2022-07-13 11:26:34,188 INFO L226 Difference]: Without dead ends: 207 [2022-07-13 11:26:34,188 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 11:26:34,188 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 1 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 11:26:34,188 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 285 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 11:26:34,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2022-07-13 11:26:34,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 207. [2022-07-13 11:26:34,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 176 states have (on average 1.3011363636363635) internal successors, (229), 179 states have internal predecessors, (229), 24 states have call successors, (24), 4 states have call predecessors, (24), 6 states have return successors, (27), 25 states have call predecessors, (27), 23 states have call successors, (27) [2022-07-13 11:26:34,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 280 transitions. [2022-07-13 11:26:34,202 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 280 transitions. Word has length 48 [2022-07-13 11:26:34,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:26:34,202 INFO L495 AbstractCegarLoop]: Abstraction has 207 states and 280 transitions. [2022-07-13 11:26:34,202 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 2 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) [2022-07-13 11:26:34,202 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 280 transitions. [2022-07-13 11:26:34,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-07-13 11:26:34,203 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:26:34,203 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1] [2022-07-13 11:26:34,223 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Ended with exit code 0 [2022-07-13 11:26:34,409 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 11:26:34,410 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:26:34,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:26:34,410 INFO L85 PathProgramCache]: Analyzing trace with hash -1948634931, now seen corresponding path program 1 times [2022-07-13 11:26:34,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 11:26:34,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [415795625] [2022-07-13 11:26:34,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:26:34,411 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 11:26:34,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 11:26:34,428 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 11:26:34,429 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-07-13 11:26:34,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:34,477 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-13 11:26:34,478 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:26:34,535 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-13 11:26:34,535 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:26:34,598 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-07-13 11:26:34,598 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 11:26:34,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [415795625] [2022-07-13 11:26:34,599 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [415795625] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:26:34,599 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 11:26:34,599 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2022-07-13 11:26:34,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253554895] [2022-07-13 11:26:34,599 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 11:26:34,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-13 11:26:34,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 11:26:34,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-13 11:26:34,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-13 11:26:34,600 INFO L87 Difference]: Start difference. First operand 207 states and 280 transitions. Second operand has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 8 states have internal predecessors, (34), 3 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-07-13 11:26:34,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:26:34,728 INFO L93 Difference]: Finished difference Result 298 states and 396 transitions. [2022-07-13 11:26:34,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-13 11:26:34,729 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 8 states have internal predecessors, (34), 3 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 50 [2022-07-13 11:26:34,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:26:34,730 INFO L225 Difference]: With dead ends: 298 [2022-07-13 11:26:34,731 INFO L226 Difference]: Without dead ends: 232 [2022-07-13 11:26:34,731 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 89 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2022-07-13 11:26:34,731 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 174 mSDsluCounter, 544 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 634 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:26:34,732 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 634 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 11:26:34,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2022-07-13 11:26:34,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 166. [2022-07-13 11:26:34,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 140 states have (on average 1.3142857142857143) internal successors, (184), 143 states have internal predecessors, (184), 19 states have call successors, (19), 4 states have call predecessors, (19), 6 states have return successors, (22), 20 states have call predecessors, (22), 18 states have call successors, (22) [2022-07-13 11:26:34,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 225 transitions. [2022-07-13 11:26:34,740 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 225 transitions. Word has length 50 [2022-07-13 11:26:34,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:26:34,741 INFO L495 AbstractCegarLoop]: Abstraction has 166 states and 225 transitions. [2022-07-13 11:26:34,741 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 8 states have internal predecessors, (34), 3 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-07-13 11:26:34,741 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 225 transitions. [2022-07-13 11:26:34,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-07-13 11:26:34,741 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:26:34,742 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1, 1] [2022-07-13 11:26:34,765 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2022-07-13 11:26:34,948 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 11:26:34,948 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:26:34,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:26:34,949 INFO L85 PathProgramCache]: Analyzing trace with hash -1060673824, now seen corresponding path program 1 times [2022-07-13 11:26:34,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 11:26:34,949 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1142546133] [2022-07-13 11:26:34,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:26:34,949 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 11:26:34,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 11:26:34,951 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 11:26:34,951 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2022-07-13 11:26:34,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:34,985 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-13 11:26:34,986 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:26:35,003 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-07-13 11:26:35,004 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 11:26:35,004 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 11:26:35,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1142546133] [2022-07-13 11:26:35,004 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1142546133] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:26:35,004 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:26:35,004 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 11:26:35,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764057612] [2022-07-13 11:26:35,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:26:35,004 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 11:26:35,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 11:26:35,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 11:26:35,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 11:26:35,005 INFO L87 Difference]: Start difference. First operand 166 states and 225 transitions. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 2 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) [2022-07-13 11:26:35,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:26:35,086 INFO L93 Difference]: Finished difference Result 241 states and 330 transitions. [2022-07-13 11:26:35,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 11:26:35,086 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 2 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 49 [2022-07-13 11:26:35,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:26:35,087 INFO L225 Difference]: With dead ends: 241 [2022-07-13 11:26:35,087 INFO L226 Difference]: Without dead ends: 199 [2022-07-13 11:26:35,088 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-07-13 11:26:35,088 INFO L413 NwaCegarLoop]: 133 mSDtfsCounter, 128 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 11:26:35,088 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 345 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 11:26:35,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2022-07-13 11:26:35,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 166. [2022-07-13 11:26:35,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 140 states have (on average 1.3) internal successors, (182), 143 states have internal predecessors, (182), 19 states have call successors, (19), 4 states have call predecessors, (19), 6 states have return successors, (22), 20 states have call predecessors, (22), 18 states have call successors, (22) [2022-07-13 11:26:35,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 223 transitions. [2022-07-13 11:26:35,098 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 223 transitions. Word has length 49 [2022-07-13 11:26:35,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:26:35,098 INFO L495 AbstractCegarLoop]: Abstraction has 166 states and 223 transitions. [2022-07-13 11:26:35,098 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 2 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) [2022-07-13 11:26:35,098 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 223 transitions. [2022-07-13 11:26:35,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-07-13 11:26:35,099 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:26:35,099 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1] [2022-07-13 11:26:35,121 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Ended with exit code 0 [2022-07-13 11:26:35,322 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 11:26:35,322 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:26:35,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:26:35,323 INFO L85 PathProgramCache]: Analyzing trace with hash 45509775, now seen corresponding path program 1 times [2022-07-13 11:26:35,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 11:26:35,323 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1093398731] [2022-07-13 11:26:35,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:26:35,323 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 11:26:35,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 11:26:35,324 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 11:26:35,326 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2022-07-13 11:26:35,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 11:26:35,360 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 11:26:35,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 11:26:35,405 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-07-13 11:26:35,405 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-13 11:26:35,406 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-13 11:26:35,415 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2022-07-13 11:26:35,607 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 11:26:35,609 INFO L356 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:26:35,611 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-13 11:26:35,635 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.07 11:26:35 BoogieIcfgContainer [2022-07-13 11:26:35,637 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-13 11:26:35,638 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-13 11:26:35,638 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-13 11:26:35,638 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-13 11:26:35,638 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 11:26:29" (3/4) ... [2022-07-13 11:26:35,639 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-07-13 11:26:35,673 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-13 11:26:35,673 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-13 11:26:35,673 INFO L158 Benchmark]: Toolchain (without parser) took 7253.13ms. Allocated memory was 48.2MB in the beginning and 104.9MB in the end (delta: 56.6MB). Free memory was 31.2MB in the beginning and 60.9MB in the end (delta: -29.7MB). Peak memory consumption was 25.9MB. Max. memory is 16.1GB. [2022-07-13 11:26:35,673 INFO L158 Benchmark]: CDTParser took 0.08ms. Allocated memory is still 39.8MB. Free memory was 21.6MB in the beginning and 21.5MB in the end (delta: 50.2kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 11:26:35,674 INFO L158 Benchmark]: CACSL2BoogieTranslator took 248.81ms. Allocated memory is still 48.2MB. Free memory was 30.9MB in the beginning and 28.4MB in the end (delta: 2.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-13 11:26:35,674 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.67ms. Allocated memory is still 48.2MB. Free memory was 28.4MB in the beginning and 26.6MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 11:26:35,674 INFO L158 Benchmark]: Boogie Preprocessor took 18.00ms. Allocated memory is still 48.2MB. Free memory was 26.4MB in the beginning and 24.9MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 11:26:35,674 INFO L158 Benchmark]: RCFGBuilder took 295.57ms. Allocated memory was 48.2MB in the beginning and 58.7MB in the end (delta: 10.5MB). Free memory was 24.9MB in the beginning and 39.6MB in the end (delta: -14.7MB). Peak memory consumption was 6.4MB. Max. memory is 16.1GB. [2022-07-13 11:26:35,675 INFO L158 Benchmark]: TraceAbstraction took 6611.93ms. Allocated memory was 58.7MB in the beginning and 104.9MB in the end (delta: 46.1MB). Free memory was 39.2MB in the beginning and 64.3MB in the end (delta: -25.1MB). Peak memory consumption was 20.9MB. Max. memory is 16.1GB. [2022-07-13 11:26:35,675 INFO L158 Benchmark]: Witness Printer took 35.41ms. Allocated memory is still 104.9MB. Free memory was 64.3MB in the beginning and 60.9MB in the end (delta: 3.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 11:26:35,676 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.08ms. Allocated memory is still 39.8MB. Free memory was 21.6MB in the beginning and 21.5MB in the end (delta: 50.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 248.81ms. Allocated memory is still 48.2MB. Free memory was 30.9MB in the beginning and 28.4MB in the end (delta: 2.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.67ms. Allocated memory is still 48.2MB. Free memory was 28.4MB in the beginning and 26.6MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 18.00ms. Allocated memory is still 48.2MB. Free memory was 26.4MB in the beginning and 24.9MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 295.57ms. Allocated memory was 48.2MB in the beginning and 58.7MB in the end (delta: 10.5MB). Free memory was 24.9MB in the beginning and 39.6MB in the end (delta: -14.7MB). Peak memory consumption was 6.4MB. Max. memory is 16.1GB. * TraceAbstraction took 6611.93ms. Allocated memory was 58.7MB in the beginning and 104.9MB in the end (delta: 46.1MB). Free memory was 39.2MB in the beginning and 64.3MB in the end (delta: -25.1MB). Peak memory consumption was 20.9MB. Max. memory is 16.1GB. * Witness Printer took 35.41ms. Allocated memory is still 104.9MB. Free memory was 64.3MB in the beginning and 60.9MB in the end (delta: 3.4MB). 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 - CounterExampleResult [Line: 17]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L226] unsigned int a ; [L227] unsigned int ma = __VERIFIER_nondet_uint(); [L228] signed char ea = __VERIFIER_nondet_char(); [L229] unsigned int b ; [L230] unsigned int mb = __VERIFIER_nondet_uint(); [L231] signed char eb = __VERIFIER_nondet_char(); [L232] unsigned int r_add ; [L233] unsigned int zero ; [L234] int sa ; [L235] int sb ; [L236] int tmp ; [L237] int tmp___0 ; [L238] int tmp___1 ; [L239] int tmp___2 ; [L240] int tmp___3 ; [L241] int tmp___4 ; [L242] int tmp___5 ; [L243] int tmp___6 ; [L244] int tmp___7 ; [L245] int tmp___8 ; [L246] int tmp___9 ; [L247] int __retres23 ; [L251] CALL, EXPR base2flt(0, 0) VAL [\old(e)=0, \old(m)=0] [L25] unsigned int res ; [L26] unsigned int __retres4 ; VAL [\old(e)=0, \old(m)=0, e=0, m=0] [L29] COND TRUE ! m [L30] __retres4 = 0U VAL [\old(e)=0, \old(m)=0, __retres4=0, e=0, m=0] [L80] return (__retres4); VAL [\old(e)=0, \old(m)=0, \result=0, __retres4=0, e=0, m=0] [L251] RET, EXPR base2flt(0, 0) VAL [base2flt(0, 0)=0] [L251] zero = base2flt(0, 0) [L252] CALL, EXPR base2flt(ma, ea) VAL [\old(e)=0, \old(m)=16777216] [L25] unsigned int res ; [L26] unsigned int __retres4 ; VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L29] COND FALSE !(! m) VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L35] COND FALSE !(m < 1U << 24U) VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L57] COND TRUE 1 VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L59] COND FALSE !(m >= 1U << 25U) VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L76] m = m & ~ (1U << 24U) [L77] res = m | ((unsigned int )(e + 128) << 24U) [L78] __retres4 = res VAL [\old(e)=0, \old(m)=16777216, __retres4=2147483648, e=0, m=0, res=2147483648] [L80] return (__retres4); VAL [\old(e)=0, \old(m)=16777216, \result=-2147483648, __retres4=2147483648, e=0, m=0, res=2147483648] [L252] RET, EXPR base2flt(ma, ea) VAL [base2flt(ma, ea)=-2147483648, ea=0, ma=16777216, zero=0] [L252] a = base2flt(ma, ea) [L253] CALL, EXPR base2flt(mb, eb) VAL [\old(e)=64, \old(m)=16777216] [L25] unsigned int res ; [L26] unsigned int __retres4 ; VAL [\old(e)=64, \old(m)=16777216, e=64, m=16777216] [L29] COND FALSE !(! m) VAL [\old(e)=64, \old(m)=16777216, e=64, m=16777216] [L35] COND FALSE !(m < 1U << 24U) VAL [\old(e)=64, \old(m)=16777216, e=64, m=16777216] [L57] COND TRUE 1 VAL [\old(e)=64, \old(m)=16777216, e=64, m=16777216] [L59] COND FALSE !(m >= 1U << 25U) VAL [\old(e)=64, \old(m)=16777216, e=64, m=16777216] [L76] m = m & ~ (1U << 24U) [L77] res = m | ((unsigned int )(e + 128) << 24U) [L78] __retres4 = res VAL [\old(e)=64, \old(m)=16777216, __retres4=3221225472, e=64, m=0, res=3221225472] [L80] return (__retres4); VAL [\old(e)=64, \old(m)=16777216, \result=-1073741824, __retres4=3221225472, e=64, m=0, res=3221225472] [L253] RET, EXPR base2flt(mb, eb) VAL [a=2147483648, base2flt(mb, eb)=-1073741824, ea=0, eb=64, ma=16777216, mb=16777216, zero=0] [L253] b = base2flt(mb, eb) [L255] COND FALSE !(a < zero) VAL [a=2147483648, b=3221225472, ea=0, eb=64, ma=16777216, mb=16777216, zero=0] [L258] COND TRUE a > zero [L259] tmp = 1 VAL [a=2147483648, b=3221225472, ea=0, eb=64, ma=16777216, mb=16777216, tmp=1, zero=0] [L263] sa = tmp VAL [a=2147483648, b=3221225472, ea=0, eb=64, ma=16777216, mb=16777216, sa=1, tmp=1, zero=0] [L265] COND FALSE !(b < zero) VAL [a=2147483648, b=3221225472, ea=0, eb=64, ma=16777216, mb=16777216, sa=1, tmp=1, zero=0] [L268] COND TRUE b > zero [L269] tmp___0 = 1 VAL [a=2147483648, b=3221225472, ea=0, eb=64, ma=16777216, mb=16777216, sa=1, tmp=1, tmp___0=1, zero=0] [L273] sb = tmp___0 VAL [a=2147483648, b=3221225472, ea=0, eb=64, ma=16777216, mb=16777216, sa=1, sb=1, tmp=1, tmp___0=1, zero=0] [L276] CALL addflt(a, b) [L84] unsigned int res ; [L85] unsigned int ma ; [L86] unsigned int mb ; [L87] unsigned int delta ; [L88] int ea ; [L89] int eb ; [L90] unsigned int tmp ; [L91] unsigned int __retres10 ; VAL [\old(a)=2147483648, \old(b)=3221225472, a=2147483648, b=3221225472] [L94] COND TRUE a < b [L95] tmp = a [L96] a = b [L97] b = tmp VAL [\old(a)=2147483648, \old(b)=3221225472, a=3221225472, b=2147483648, tmp=2147483648] [L101] COND FALSE !(! b) [L108] ma = a & ((1U << 24U) - 1U) [L109] ea = (int )(a >> 24U) - 128 [L110] ma = ma | (1U << 24U) [L111] mb = b & ((1U << 24U) - 1U) [L112] eb = (int )(b >> 24U) - 128 [L113] mb = mb | (1U << 24U) VAL [\old(a)=2147483648, \old(b)=3221225472, a=3221225472, b=2147483648, ea=64, eb=0, ma=16777216, mb=16777216, tmp=2147483648] [L114] CALL __VERIFIER_assert(ea >= eb) VAL [\old(cond)=1] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L114] RET __VERIFIER_assert(ea >= eb) VAL [\old(a)=2147483648, \old(b)=3221225472, a=3221225472, b=2147483648, ea=64, eb=0, ma=16777216, mb=16777216, tmp=2147483648] [L115] delta = ea - eb VAL [\old(a)=2147483648, \old(b)=3221225472, a=3221225472, b=2147483648, delta=64, ea=64, eb=0, ma=16777216, mb=16777216, tmp=2147483648] [L116] CALL __VERIFIER_assert(delta < sizeof(mb) * 8) VAL [\old(cond)=0] [L16] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L17] reach_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 72 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.5s, OverallIterations: 15, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1236 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1204 mSDsluCounter, 6533 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 13 IncrementalHoareTripleChecker+Unchecked, 4976 mSDsCounter, 113 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 858 IncrementalHoareTripleChecker+Invalid, 984 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 113 mSolverCounterUnsat, 1557 mSDtfsCounter, 858 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 818 GetRequests, 717 SyntacticMatches, 2 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=233occurred in iteration=5, InterpolantAutomatonStates: 92, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 14 MinimizatonAttempts, 502 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 648 NumberOfCodeBlocks, 630 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 789 ConstructedInterpolants, 2 QuantifiedInterpolants, 1312 SizeOfPredicates, 51 NumberOfNonLiveVariables, 1139 ConjunctsInSsa, 90 ConjunctsInUnsatCore, 19 InterpolantComputations, 11 PerfectInterpolantSequences, 274/313 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-07-13 11:26:35,706 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 Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE