./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/heap-manipulation/dancing.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e8d55036 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/heap-manipulation/dancing.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c2e0266b63b958a771d0226973905d5a39a7a28d05d194ae66381394d9ab520a --- Real Ultimate output --- This is Ultimate 0.2.2-?-e8d5503-m [2023-02-15 19:26:48,572 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-15 19:26:48,573 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-15 19:26:48,603 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-15 19:26:48,604 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-15 19:26:48,606 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-15 19:26:48,607 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-15 19:26:48,610 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-15 19:26:48,611 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-15 19:26:48,614 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-15 19:26:48,615 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-15 19:26:48,617 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-15 19:26:48,617 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-15 19:26:48,619 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-15 19:26:48,620 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-15 19:26:48,623 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-15 19:26:48,623 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-15 19:26:48,625 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-15 19:26:48,625 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-15 19:26:48,629 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-15 19:26:48,630 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-15 19:26:48,631 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-15 19:26:48,632 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-15 19:26:48,632 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-15 19:26:48,638 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-15 19:26:48,639 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-15 19:26:48,639 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-15 19:26:48,641 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-15 19:26:48,641 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-15 19:26:48,642 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-15 19:26:48,642 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-15 19:26:48,642 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-15 19:26:48,643 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-15 19:26:48,644 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-15 19:26:48,645 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-15 19:26:48,645 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-15 19:26:48,645 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-15 19:26:48,646 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-15 19:26:48,646 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-15 19:26:48,647 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-15 19:26:48,648 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-15 19:26:48,648 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-02-15 19:26:48,671 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-15 19:26:48,671 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-15 19:26:48,671 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-15 19:26:48,672 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-15 19:26:48,672 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-15 19:26:48,672 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-15 19:26:48,673 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-15 19:26:48,673 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-15 19:26:48,673 INFO L138 SettingsManager]: * Use SBE=true [2023-02-15 19:26:48,673 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-15 19:26:48,674 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-15 19:26:48,674 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-15 19:26:48,674 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-15 19:26:48,675 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-15 19:26:48,675 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-15 19:26:48,675 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-15 19:26:48,675 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-15 19:26:48,675 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-15 19:26:48,675 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-15 19:26:48,676 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-15 19:26:48,676 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-15 19:26:48,676 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-15 19:26:48,676 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-15 19:26:48,676 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-15 19:26:48,676 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 19:26:48,677 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-15 19:26:48,677 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-15 19:26:48,677 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-15 19:26:48,677 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-15 19:26:48,677 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-15 19:26:48,678 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-15 19:26:48,678 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-15 19:26:48,678 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-15 19:26:48,678 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-15 19:26:48,678 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-15 19:26:48,678 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c2e0266b63b958a771d0226973905d5a39a7a28d05d194ae66381394d9ab520a [2023-02-15 19:26:48,881 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-15 19:26:48,898 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-15 19:26:48,900 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-15 19:26:48,901 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-15 19:26:48,901 INFO L275 PluginConnector]: CDTParser initialized [2023-02-15 19:26:48,907 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/heap-manipulation/dancing.i [2023-02-15 19:26:49,973 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-15 19:26:50,171 INFO L351 CDTParser]: Found 1 translation units. [2023-02-15 19:26:50,171 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/dancing.i [2023-02-15 19:26:50,180 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d52500174/7f2294904fa546c286b1bc752b95cd46/FLAG8ac12c86c [2023-02-15 19:26:50,198 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d52500174/7f2294904fa546c286b1bc752b95cd46 [2023-02-15 19:26:50,200 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-15 19:26:50,201 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-15 19:26:50,202 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-15 19:26:50,202 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-15 19:26:50,205 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-15 19:26:50,212 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 07:26:50" (1/1) ... [2023-02-15 19:26:50,213 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6097c666 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:26:50, skipping insertion in model container [2023-02-15 19:26:50,214 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 07:26:50" (1/1) ... [2023-02-15 19:26:50,218 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-15 19:26:50,240 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 19:26:50,336 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/dancing.i[938,951] [2023-02-15 19:26:50,405 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 19:26:50,413 INFO L203 MainTranslator]: Completed pre-run [2023-02-15 19:26:50,429 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/dancing.i[938,951] [2023-02-15 19:26:50,464 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 19:26:50,490 INFO L208 MainTranslator]: Completed translation [2023-02-15 19:26:50,491 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:26:50 WrapperNode [2023-02-15 19:26:50,491 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-15 19:26:50,492 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-15 19:26:50,492 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-15 19:26:50,492 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-15 19:26:50,497 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:26:50" (1/1) ... [2023-02-15 19:26:50,506 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:26:50" (1/1) ... [2023-02-15 19:26:50,521 INFO L138 Inliner]: procedures = 124, calls = 40, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 90 [2023-02-15 19:26:50,521 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-15 19:26:50,522 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-15 19:26:50,522 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-15 19:26:50,522 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-15 19:26:50,527 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:26:50" (1/1) ... [2023-02-15 19:26:50,527 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:26:50" (1/1) ... [2023-02-15 19:26:50,530 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:26:50" (1/1) ... [2023-02-15 19:26:50,530 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:26:50" (1/1) ... [2023-02-15 19:26:50,535 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:26:50" (1/1) ... [2023-02-15 19:26:50,537 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:26:50" (1/1) ... [2023-02-15 19:26:50,538 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:26:50" (1/1) ... [2023-02-15 19:26:50,539 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:26:50" (1/1) ... [2023-02-15 19:26:50,541 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-15 19:26:50,541 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-15 19:26:50,541 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-15 19:26:50,542 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-15 19:26:50,542 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:26:50" (1/1) ... [2023-02-15 19:26:50,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 19:26:50,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 19:26:50,568 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-02-15 19:26:50,572 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-02-15 19:26:50,593 INFO L130 BoogieDeclarations]: Found specification of procedure is_list_containing_x [2023-02-15 19:26:50,593 INFO L138 BoogieDeclarations]: Found implementation of procedure is_list_containing_x [2023-02-15 19:26:50,593 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-02-15 19:26:50,593 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-02-15 19:26:50,593 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-15 19:26:50,594 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-15 19:26:50,594 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-02-15 19:26:50,594 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-02-15 19:26:50,594 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-02-15 19:26:50,594 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-15 19:26:50,594 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-15 19:26:50,595 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-15 19:26:50,595 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-15 19:26:50,681 INFO L235 CfgBuilder]: Building ICFG [2023-02-15 19:26:50,683 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-15 19:26:50,910 INFO L276 CfgBuilder]: Performing block encoding [2023-02-15 19:26:50,915 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-15 19:26:50,915 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2023-02-15 19:26:50,916 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 07:26:50 BoogieIcfgContainer [2023-02-15 19:26:50,917 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-15 19:26:50,918 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-15 19:26:50,918 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-15 19:26:50,920 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-15 19:26:50,921 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.02 07:26:50" (1/3) ... [2023-02-15 19:26:50,921 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c477c3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 07:26:50, skipping insertion in model container [2023-02-15 19:26:50,921 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:26:50" (2/3) ... [2023-02-15 19:26:50,922 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c477c3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 07:26:50, skipping insertion in model container [2023-02-15 19:26:50,922 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 07:26:50" (3/3) ... [2023-02-15 19:26:50,923 INFO L112 eAbstractionObserver]: Analyzing ICFG dancing.i [2023-02-15 19:26:50,935 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-15 19:26:50,935 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-15 19:26:50,968 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-15 19:26:50,973 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@5cca8fc4, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-15 19:26:50,973 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-15 19:26:50,976 INFO L276 IsEmpty]: Start isEmpty. Operand has 41 states, 31 states have (on average 1.4516129032258065) internal successors, (45), 32 states have internal predecessors, (45), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-15 19:26:50,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-02-15 19:26:50,982 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:26:50,983 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:26:50,983 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:26:50,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:26:50,987 INFO L85 PathProgramCache]: Analyzing trace with hash 1472755522, now seen corresponding path program 1 times [2023-02-15 19:26:50,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:26:50,993 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204427184] [2023-02-15 19:26:50,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:26:50,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:26:51,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:26:51,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 19:26:51,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:26:51,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 19:26:51,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:26:51,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204427184] [2023-02-15 19:26:51,124 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204427184] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 19:26:51,125 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 19:26:51,125 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 19:26:51,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150143756] [2023-02-15 19:26:51,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 19:26:51,129 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-15 19:26:51,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:26:51,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-15 19:26:51,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-15 19:26:51,150 INFO L87 Difference]: Start difference. First operand has 41 states, 31 states have (on average 1.4516129032258065) internal successors, (45), 32 states have internal predecessors, (45), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 19:26:51,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:26:51,224 INFO L93 Difference]: Finished difference Result 77 states and 107 transitions. [2023-02-15 19:26:51,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-15 19:26:51,226 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2023-02-15 19:26:51,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:26:51,233 INFO L225 Difference]: With dead ends: 77 [2023-02-15 19:26:51,233 INFO L226 Difference]: Without dead ends: 37 [2023-02-15 19:26:51,236 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-15 19:26:51,240 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 19:26:51,241 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 19:26:51,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2023-02-15 19:26:51,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2023-02-15 19:26:51,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 29 states have internal predecessors, (39), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-02-15 19:26:51,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 50 transitions. [2023-02-15 19:26:51,273 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 50 transitions. Word has length 20 [2023-02-15 19:26:51,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:26:51,273 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 50 transitions. [2023-02-15 19:26:51,273 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 19:26:51,274 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 50 transitions. [2023-02-15 19:26:51,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-02-15 19:26:51,275 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:26:51,275 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:26:51,275 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-15 19:26:51,276 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:26:51,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:26:51,276 INFO L85 PathProgramCache]: Analyzing trace with hash -751028367, now seen corresponding path program 1 times [2023-02-15 19:26:51,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:26:51,277 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826962794] [2023-02-15 19:26:51,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:26:51,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:26:51,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:26:51,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 19:26:51,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:26:51,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 19:26:51,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:26:51,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826962794] [2023-02-15 19:26:51,523 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826962794] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 19:26:51,524 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 19:26:51,524 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 19:26:51,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016715647] [2023-02-15 19:26:51,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 19:26:51,525 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 19:26:51,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:26:51,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 19:26:51,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 19:26:51,529 INFO L87 Difference]: Start difference. First operand 37 states and 50 transitions. Second operand has 5 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 19:26:51,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:26:51,582 INFO L93 Difference]: Finished difference Result 45 states and 58 transitions. [2023-02-15 19:26:51,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 19:26:51,583 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2023-02-15 19:26:51,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:26:51,583 INFO L225 Difference]: With dead ends: 45 [2023-02-15 19:26:51,584 INFO L226 Difference]: Without dead ends: 43 [2023-02-15 19:26:51,584 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-15 19:26:51,585 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 6 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 19:26:51,585 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 181 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 19:26:51,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2023-02-15 19:26:51,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2023-02-15 19:26:51,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 31 states have (on average 1.3548387096774193) internal successors, (42), 33 states have internal predecessors, (42), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-15 19:26:51,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 55 transitions. [2023-02-15 19:26:51,594 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 55 transitions. Word has length 20 [2023-02-15 19:26:51,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:26:51,595 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 55 transitions. [2023-02-15 19:26:51,595 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 19:26:51,596 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 55 transitions. [2023-02-15 19:26:51,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-02-15 19:26:51,596 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:26:51,596 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:26:51,597 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-15 19:26:51,597 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:26:51,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:26:51,597 INFO L85 PathProgramCache]: Analyzing trace with hash 789210768, now seen corresponding path program 1 times [2023-02-15 19:26:51,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:26:51,598 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889947296] [2023-02-15 19:26:51,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:26:51,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:26:51,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:26:51,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 19:26:51,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:26:51,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-15 19:26:51,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:26:51,678 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-15 19:26:51,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:26:51,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889947296] [2023-02-15 19:26:51,679 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889947296] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 19:26:51,679 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 19:26:51,679 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 19:26:51,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667895761] [2023-02-15 19:26:51,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 19:26:51,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 19:26:51,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:26:51,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 19:26:51,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 19:26:51,682 INFO L87 Difference]: Start difference. First operand 42 states and 55 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-15 19:26:51,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:26:51,723 INFO L93 Difference]: Finished difference Result 86 states and 116 transitions. [2023-02-15 19:26:51,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 19:26:51,723 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 26 [2023-02-15 19:26:51,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:26:51,724 INFO L225 Difference]: With dead ends: 86 [2023-02-15 19:26:51,724 INFO L226 Difference]: Without dead ends: 63 [2023-02-15 19:26:51,729 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-15 19:26:51,730 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 16 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 19:26:51,730 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 134 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 19:26:51,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2023-02-15 19:26:51,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 54. [2023-02-15 19:26:51,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 42 states have (on average 1.380952380952381) internal successors, (58), 44 states have internal predecessors, (58), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2023-02-15 19:26:51,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 73 transitions. [2023-02-15 19:26:51,737 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 73 transitions. Word has length 26 [2023-02-15 19:26:51,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:26:51,738 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 73 transitions. [2023-02-15 19:26:51,738 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-15 19:26:51,738 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 73 transitions. [2023-02-15 19:26:51,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-02-15 19:26:51,739 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:26:51,739 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-02-15 19:26:51,739 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-15 19:26:51,739 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:26:51,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:26:51,740 INFO L85 PathProgramCache]: Analyzing trace with hash 860755832, now seen corresponding path program 1 times [2023-02-15 19:26:51,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:26:51,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497181849] [2023-02-15 19:26:51,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:26:51,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:26:51,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:26:51,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-02-15 19:26:51,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:26:51,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-02-15 19:26:51,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:26:51,898 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 19:26:51,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:26:51,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497181849] [2023-02-15 19:26:51,898 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497181849] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 19:26:51,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1713475811] [2023-02-15 19:26:51,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:26:51,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:26:51,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 19:26:51,913 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 19:26:51,925 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-02-15 19:26:52,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:26:52,063 INFO L263 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-15 19:26:52,071 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 19:26:52,195 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 19:26:52,196 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 19:26:52,363 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 19:26:52,364 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1713475811] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 19:26:52,364 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 19:26:52,364 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2023-02-15 19:26:52,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766719909] [2023-02-15 19:26:52,365 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 19:26:52,370 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-02-15 19:26:52,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:26:52,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-02-15 19:26:52,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2023-02-15 19:26:52,373 INFO L87 Difference]: Start difference. First operand 54 states and 73 transitions. Second operand has 16 states, 16 states have (on average 2.625) internal successors, (42), 16 states have internal predecessors, (42), 4 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (5), 1 states have call predecessors, (5), 4 states have call successors, (5) [2023-02-15 19:26:52,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:26:52,611 INFO L93 Difference]: Finished difference Result 118 states and 165 transitions. [2023-02-15 19:26:52,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 19:26:52,612 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.625) internal successors, (42), 16 states have internal predecessors, (42), 4 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (5), 1 states have call predecessors, (5), 4 states have call successors, (5) Word has length 29 [2023-02-15 19:26:52,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:26:52,614 INFO L225 Difference]: With dead ends: 118 [2023-02-15 19:26:52,614 INFO L226 Difference]: Without dead ends: 82 [2023-02-15 19:26:52,615 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=304, Unknown=0, NotChecked=0, Total=380 [2023-02-15 19:26:52,616 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 132 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 19:26:52,616 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 338 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 19:26:52,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2023-02-15 19:26:52,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 63. [2023-02-15 19:26:52,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 48 states have (on average 1.375) internal successors, (66), 52 states have internal predecessors, (66), 10 states have call successors, (10), 3 states have call predecessors, (10), 4 states have return successors, (12), 7 states have call predecessors, (12), 9 states have call successors, (12) [2023-02-15 19:26:52,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 88 transitions. [2023-02-15 19:26:52,626 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 88 transitions. Word has length 29 [2023-02-15 19:26:52,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:26:52,627 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 88 transitions. [2023-02-15 19:26:52,627 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.625) internal successors, (42), 16 states have internal predecessors, (42), 4 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (5), 1 states have call predecessors, (5), 4 states have call successors, (5) [2023-02-15 19:26:52,627 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 88 transitions. [2023-02-15 19:26:52,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-02-15 19:26:52,628 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:26:52,629 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-02-15 19:26:52,651 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-02-15 19:26:52,835 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:26:52,835 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:26:52,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:26:52,836 INFO L85 PathProgramCache]: Analyzing trace with hash 162961828, now seen corresponding path program 1 times [2023-02-15 19:26:52,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:26:52,837 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054460159] [2023-02-15 19:26:52,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:26:52,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:26:52,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:26:53,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-02-15 19:26:53,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:26:53,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-02-15 19:26:53,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:26:53,063 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-15 19:26:53,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:26:53,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054460159] [2023-02-15 19:26:53,065 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054460159] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 19:26:53,065 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 19:26:53,065 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-15 19:26:53,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165378712] [2023-02-15 19:26:53,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 19:26:53,066 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-15 19:26:53,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:26:53,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-15 19:26:53,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-02-15 19:26:53,069 INFO L87 Difference]: Start difference. First operand 63 states and 88 transitions. Second operand has 7 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-15 19:26:53,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:26:53,125 INFO L93 Difference]: Finished difference Result 75 states and 105 transitions. [2023-02-15 19:26:53,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-15 19:26:53,125 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 31 [2023-02-15 19:26:53,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:26:53,127 INFO L225 Difference]: With dead ends: 75 [2023-02-15 19:26:53,127 INFO L226 Difference]: Without dead ends: 73 [2023-02-15 19:26:53,129 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-02-15 19:26:53,130 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 7 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 19:26:53,130 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 289 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 19:26:53,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2023-02-15 19:26:53,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 71. [2023-02-15 19:26:53,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 53 states have (on average 1.3396226415094339) internal successors, (71), 58 states have internal predecessors, (71), 11 states have call successors, (11), 4 states have call predecessors, (11), 6 states have return successors, (19), 8 states have call predecessors, (19), 10 states have call successors, (19) [2023-02-15 19:26:53,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 101 transitions. [2023-02-15 19:26:53,153 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 101 transitions. Word has length 31 [2023-02-15 19:26:53,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:26:53,153 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 101 transitions. [2023-02-15 19:26:53,154 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-15 19:26:53,154 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 101 transitions. [2023-02-15 19:26:53,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-02-15 19:26:53,158 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:26:53,158 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:26:53,158 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-02-15 19:26:53,158 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:26:53,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:26:53,159 INFO L85 PathProgramCache]: Analyzing trace with hash 786337177, now seen corresponding path program 1 times [2023-02-15 19:26:53,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:26:53,159 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575676257] [2023-02-15 19:26:53,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:26:53,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:26:53,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:26:53,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-02-15 19:26:53,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:26:53,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-02-15 19:26:53,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:26:53,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 19:26:53,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:26:53,314 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-02-15 19:26:53,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:26:53,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575676257] [2023-02-15 19:26:53,315 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [575676257] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 19:26:53,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [259357932] [2023-02-15 19:26:53,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:26:53,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:26:53,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 19:26:53,316 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 19:26:53,343 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-02-15 19:26:53,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:26:53,431 INFO L263 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 48 conjunts are in the unsatisfiable core [2023-02-15 19:26:53,434 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 19:26:53,498 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:26:53,504 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2023-02-15 19:26:53,514 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:26:53,516 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2023-02-15 19:26:53,527 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:26:53,530 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-02-15 19:26:53,536 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:26:53,538 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-02-15 19:26:53,676 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2023-02-15 19:26:53,680 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2023-02-15 19:26:53,694 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-15 19:26:53,694 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 19:26:53,740 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2023-02-15 19:26:53,829 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 19:26:53,830 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 31 [2023-02-15 19:26:53,833 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2023-02-15 19:26:53,837 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-02-15 19:26:53,842 INFO L321 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2023-02-15 19:26:53,843 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 1 [2023-02-15 19:26:53,865 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-02-15 19:26:53,866 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [259357932] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 19:26:53,866 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 19:26:53,866 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8, 7] total 16 [2023-02-15 19:26:53,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859085532] [2023-02-15 19:26:53,866 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 19:26:53,867 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-02-15 19:26:53,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:26:53,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-02-15 19:26:53,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2023-02-15 19:26:53,868 INFO L87 Difference]: Start difference. First operand 71 states and 101 transitions. Second operand has 16 states, 16 states have (on average 3.4375) internal successors, (55), 15 states have internal predecessors, (55), 4 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) [2023-02-15 19:26:54,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:26:54,738 INFO L93 Difference]: Finished difference Result 326 states and 477 transitions. [2023-02-15 19:26:54,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-02-15 19:26:54,739 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.4375) internal successors, (55), 15 states have internal predecessors, (55), 4 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) Word has length 37 [2023-02-15 19:26:54,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:26:54,753 INFO L225 Difference]: With dead ends: 326 [2023-02-15 19:26:54,753 INFO L226 Difference]: Without dead ends: 253 [2023-02-15 19:26:54,754 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 73 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=306, Invalid=954, Unknown=0, NotChecked=0, Total=1260 [2023-02-15 19:26:54,755 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 243 mSDsluCounter, 741 mSDsCounter, 0 mSdLazyCounter, 727 mSolverCounterSat, 139 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 852 SdHoareTripleChecker+Invalid, 866 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 139 IncrementalHoareTripleChecker+Valid, 727 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-15 19:26:54,755 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 852 Invalid, 866 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [139 Valid, 727 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-02-15 19:26:54,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2023-02-15 19:26:54,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 136. [2023-02-15 19:26:54,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 101 states have (on average 1.316831683168317) internal successors, (133), 111 states have internal predecessors, (133), 22 states have call successors, (22), 8 states have call predecessors, (22), 12 states have return successors, (34), 16 states have call predecessors, (34), 20 states have call successors, (34) [2023-02-15 19:26:54,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 189 transitions. [2023-02-15 19:26:54,772 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 189 transitions. Word has length 37 [2023-02-15 19:26:54,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:26:54,773 INFO L495 AbstractCegarLoop]: Abstraction has 136 states and 189 transitions. [2023-02-15 19:26:54,773 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.4375) internal successors, (55), 15 states have internal predecessors, (55), 4 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) [2023-02-15 19:26:54,773 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 189 transitions. [2023-02-15 19:26:54,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-02-15 19:26:54,774 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:26:54,774 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:26:54,781 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-02-15 19:26:54,987 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,SelfDestructingSolverStorable5 [2023-02-15 19:26:54,988 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:26:54,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:26:54,988 INFO L85 PathProgramCache]: Analyzing trace with hash -1693334873, now seen corresponding path program 1 times [2023-02-15 19:26:54,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:26:54,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613408056] [2023-02-15 19:26:54,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:26:54,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:26:54,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:26:55,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 19:26:55,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:26:55,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-15 19:26:55,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:26:55,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-02-15 19:26:55,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:26:55,114 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-15 19:26:55,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:26:55,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613408056] [2023-02-15 19:26:55,114 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [613408056] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 19:26:55,114 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 19:26:55,114 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 19:26:55,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115530090] [2023-02-15 19:26:55,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 19:26:55,114 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 19:26:55,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:26:55,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 19:26:55,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 19:26:55,115 INFO L87 Difference]: Start difference. First operand 136 states and 189 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-15 19:26:55,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:26:55,193 INFO L93 Difference]: Finished difference Result 179 states and 245 transitions. [2023-02-15 19:26:55,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 19:26:55,193 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 35 [2023-02-15 19:26:55,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:26:55,194 INFO L225 Difference]: With dead ends: 179 [2023-02-15 19:26:55,194 INFO L226 Difference]: Without dead ends: 148 [2023-02-15 19:26:55,194 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-02-15 19:26:55,195 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 22 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 19:26:55,195 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 165 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 19:26:55,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2023-02-15 19:26:55,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 138. [2023-02-15 19:26:55,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 103 states have (on average 1.3106796116504855) internal successors, (135), 113 states have internal predecessors, (135), 22 states have call successors, (22), 8 states have call predecessors, (22), 12 states have return successors, (34), 16 states have call predecessors, (34), 20 states have call successors, (34) [2023-02-15 19:26:55,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 191 transitions. [2023-02-15 19:26:55,231 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 191 transitions. Word has length 35 [2023-02-15 19:26:55,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:26:55,231 INFO L495 AbstractCegarLoop]: Abstraction has 138 states and 191 transitions. [2023-02-15 19:26:55,231 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-15 19:26:55,231 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 191 transitions. [2023-02-15 19:26:55,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-02-15 19:26:55,232 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:26:55,232 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:26:55,232 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-02-15 19:26:55,232 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:26:55,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:26:55,232 INFO L85 PathProgramCache]: Analyzing trace with hash -1474480155, now seen corresponding path program 1 times [2023-02-15 19:26:55,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:26:55,233 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120074392] [2023-02-15 19:26:55,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:26:55,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:26:55,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:26:55,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 19:26:55,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:26:55,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-15 19:26:55,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:26:55,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-02-15 19:26:55,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:26:55,346 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-15 19:26:55,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:26:55,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120074392] [2023-02-15 19:26:55,347 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120074392] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 19:26:55,347 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 19:26:55,347 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-15 19:26:55,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212289985] [2023-02-15 19:26:55,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 19:26:55,348 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 19:26:55,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:26:55,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 19:26:55,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-15 19:26:55,349 INFO L87 Difference]: Start difference. First operand 138 states and 191 transitions. Second operand has 6 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 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) [2023-02-15 19:26:55,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:26:55,378 INFO L93 Difference]: Finished difference Result 150 states and 202 transitions. [2023-02-15 19:26:55,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 19:26:55,379 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 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 35 [2023-02-15 19:26:55,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:26:55,380 INFO L225 Difference]: With dead ends: 150 [2023-02-15 19:26:55,380 INFO L226 Difference]: Without dead ends: 138 [2023-02-15 19:26:55,380 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-02-15 19:26:55,381 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 5 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 19:26:55,381 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 237 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 19:26:55,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2023-02-15 19:26:55,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 114. [2023-02-15 19:26:55,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 87 states have (on average 1.3218390804597702) internal successors, (115), 93 states have internal predecessors, (115), 16 states have call successors, (16), 6 states have call predecessors, (16), 10 states have return successors, (24), 14 states have call predecessors, (24), 14 states have call successors, (24) [2023-02-15 19:26:55,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 155 transitions. [2023-02-15 19:26:55,390 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 155 transitions. Word has length 35 [2023-02-15 19:26:55,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:26:55,390 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 155 transitions. [2023-02-15 19:26:55,391 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 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) [2023-02-15 19:26:55,391 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 155 transitions. [2023-02-15 19:26:55,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-02-15 19:26:55,391 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:26:55,391 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-02-15 19:26:55,392 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-02-15 19:26:55,392 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:26:55,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:26:55,392 INFO L85 PathProgramCache]: Analyzing trace with hash 1846747895, now seen corresponding path program 1 times [2023-02-15 19:26:55,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:26:55,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840706001] [2023-02-15 19:26:55,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:26:55,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:26:55,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:26:55,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 19:26:55,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:26:55,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-15 19:26:55,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:26:55,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-02-15 19:26:55,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:26:55,468 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 19:26:55,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:26:55,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840706001] [2023-02-15 19:26:55,469 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840706001] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 19:26:55,469 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 19:26:55,469 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 19:26:55,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303061709] [2023-02-15 19:26:55,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 19:26:55,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 19:26:55,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:26:55,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 19:26:55,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 19:26:55,470 INFO L87 Difference]: Start difference. First operand 114 states and 155 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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) [2023-02-15 19:26:55,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:26:55,518 INFO L93 Difference]: Finished difference Result 202 states and 267 transitions. [2023-02-15 19:26:55,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 19:26:55,519 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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 [2023-02-15 19:26:55,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:26:55,520 INFO L225 Difference]: With dead ends: 202 [2023-02-15 19:26:55,520 INFO L226 Difference]: Without dead ends: 94 [2023-02-15 19:26:55,521 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 [2023-02-15 19:26:55,521 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 16 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 19:26:55,521 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 144 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 19:26:55,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2023-02-15 19:26:55,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 92. [2023-02-15 19:26:55,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 67 states have (on average 1.3134328358208955) internal successors, (88), 73 states have internal predecessors, (88), 14 states have call successors, (14), 6 states have call predecessors, (14), 10 states have return successors, (20), 12 states have call predecessors, (20), 12 states have call successors, (20) [2023-02-15 19:26:55,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 122 transitions. [2023-02-15 19:26:55,532 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 122 transitions. Word has length 36 [2023-02-15 19:26:55,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:26:55,533 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 122 transitions. [2023-02-15 19:26:55,533 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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) [2023-02-15 19:26:55,533 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 122 transitions. [2023-02-15 19:26:55,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-02-15 19:26:55,533 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:26:55,533 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:26:55,534 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-02-15 19:26:55,534 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:26:55,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:26:55,534 INFO L85 PathProgramCache]: Analyzing trace with hash -1426728412, now seen corresponding path program 1 times [2023-02-15 19:26:55,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:26:55,534 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428387995] [2023-02-15 19:26:55,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:26:55,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:26:55,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:26:55,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 19:26:55,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:26:55,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 19:26:55,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:26:55,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-02-15 19:26:55,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:26:55,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 19:26:55,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:26:55,914 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-02-15 19:26:55,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:26:55,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428387995] [2023-02-15 19:26:55,915 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428387995] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 19:26:55,915 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [902785144] [2023-02-15 19:26:55,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:26:55,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:26:55,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 19:26:55,932 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 19:26:55,964 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-02-15 19:26:56,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:26:56,060 INFO L263 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 39 conjunts are in the unsatisfiable core [2023-02-15 19:26:56,062 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 19:26:56,077 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 19:26:56,123 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 19:26:56,123 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-02-15 19:26:56,163 INFO L321 Elim1Store]: treesize reduction 30, result has 38.8 percent of original size [2023-02-15 19:26:56,163 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 78 [2023-02-15 19:26:56,168 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2023-02-15 19:26:56,173 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2023-02-15 19:26:56,206 INFO L321 Elim1Store]: treesize reduction 35, result has 2.8 percent of original size [2023-02-15 19:26:56,207 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 102 treesize of output 46 [2023-02-15 19:26:56,208 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18 [2023-02-15 19:26:56,271 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int)) (|v_ULTIMATE.start_main_~#list~0#1.base_BEFORE_CALL_3| Int) (|v_ULTIMATE.start_main_~#list~0#1.offset_BEFORE_CALL_1| Int)) (let ((.cse1 (+ |v_ULTIMATE.start_main_~#list~0#1.offset_BEFORE_CALL_1| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~#list~0#1.base_BEFORE_CALL_3|) .cse1))) (and (= v_DerPreprocessor_1 (select (store (store (store (store |c_#memory_$Pointer$.base| .cse0 v_DerPreprocessor_1) |v_ULTIMATE.start_main_~#list~0#1.base_BEFORE_CALL_3| v_DerPreprocessor_2) .cse0 v_DerPreprocessor_1) |v_ULTIMATE.start_main_~#list~0#1.base_BEFORE_CALL_3| v_DerPreprocessor_2) .cse0)) (= (select v_DerPreprocessor_2 .cse1) .cse0))))) is different from true [2023-02-15 19:26:56,529 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 20 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-15 19:26:56,529 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 19:26:56,783 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 19:26:56,783 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 258 treesize of output 255 [2023-02-15 19:26:56,787 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 282 treesize of output 266 [2023-02-15 19:26:56,791 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 266 treesize of output 258 [2023-02-15 19:26:56,830 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2023-02-15 19:26:56,835 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2023-02-15 19:26:56,952 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-02-15 19:26:56,952 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [902785144] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 19:26:56,952 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 19:26:56,952 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 12] total 32 [2023-02-15 19:26:56,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612852905] [2023-02-15 19:26:56,953 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 19:26:56,953 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-02-15 19:26:56,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:26:56,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-02-15 19:26:56,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=843, Unknown=6, NotChecked=58, Total=992 [2023-02-15 19:26:56,954 INFO L87 Difference]: Start difference. First operand 92 states and 122 transitions. Second operand has 32 states, 30 states have (on average 2.5) internal successors, (75), 31 states have internal predecessors, (75), 8 states have call successors, (11), 3 states have call predecessors, (11), 7 states have return successors, (10), 6 states have call predecessors, (10), 8 states have call successors, (10) [2023-02-15 19:26:59,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:26:59,486 INFO L93 Difference]: Finished difference Result 194 states and 266 transitions. [2023-02-15 19:26:59,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2023-02-15 19:26:59,487 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 30 states have (on average 2.5) internal successors, (75), 31 states have internal predecessors, (75), 8 states have call successors, (11), 3 states have call predecessors, (11), 7 states have return successors, (10), 6 states have call predecessors, (10), 8 states have call successors, (10) Word has length 46 [2023-02-15 19:26:59,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:26:59,488 INFO L225 Difference]: With dead ends: 194 [2023-02-15 19:26:59,488 INFO L226 Difference]: Without dead ends: 118 [2023-02-15 19:26:59,489 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 80 SyntacticMatches, 2 SemanticMatches, 60 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 533 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=586, Invalid=3032, Unknown=46, NotChecked=118, Total=3782 [2023-02-15 19:26:59,490 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 296 mSDsluCounter, 673 mSDsCounter, 0 mSdLazyCounter, 902 mSolverCounterSat, 127 mSolverCounterUnsat, 41 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 725 SdHoareTripleChecker+Invalid, 1197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 902 IncrementalHoareTripleChecker+Invalid, 41 IncrementalHoareTripleChecker+Unknown, 127 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-02-15 19:26:59,490 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [296 Valid, 725 Invalid, 1197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 902 Invalid, 41 Unknown, 127 Unchecked, 0.6s Time] [2023-02-15 19:26:59,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2023-02-15 19:26:59,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 80. [2023-02-15 19:26:59,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 58 states have (on average 1.293103448275862) internal successors, (75), 64 states have internal predecessors, (75), 10 states have call successors, (10), 5 states have call predecessors, (10), 11 states have return successors, (20), 10 states have call predecessors, (20), 9 states have call successors, (20) [2023-02-15 19:26:59,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 105 transitions. [2023-02-15 19:26:59,496 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 105 transitions. Word has length 46 [2023-02-15 19:26:59,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:26:59,496 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 105 transitions. [2023-02-15 19:26:59,496 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 30 states have (on average 2.5) internal successors, (75), 31 states have internal predecessors, (75), 8 states have call successors, (11), 3 states have call predecessors, (11), 7 states have return successors, (10), 6 states have call predecessors, (10), 8 states have call successors, (10) [2023-02-15 19:26:59,496 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 105 transitions. [2023-02-15 19:26:59,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-02-15 19:26:59,497 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:26:59,497 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 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] [2023-02-15 19:26:59,505 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-02-15 19:26:59,702 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:26:59,703 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:26:59,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:26:59,703 INFO L85 PathProgramCache]: Analyzing trace with hash 803799756, now seen corresponding path program 1 times [2023-02-15 19:26:59,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:26:59,704 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534919794] [2023-02-15 19:26:59,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:26:59,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:26:59,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:27:00,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-02-15 19:27:00,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:27:00,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 19:27:00,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:27:00,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-02-15 19:27:00,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:27:00,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 19:27:00,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:27:00,368 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 8 proven. 14 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-02-15 19:27:00,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:27:00,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534919794] [2023-02-15 19:27:00,369 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534919794] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 19:27:00,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [82385264] [2023-02-15 19:27:00,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:27:00,369 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:27:00,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 19:27:00,370 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 19:27:00,372 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-02-15 19:27:00,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:27:00,469 INFO L263 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 91 conjunts are in the unsatisfiable core [2023-02-15 19:27:00,474 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 19:27:00,547 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:27:00,547 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2023-02-15 19:27:00,550 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:27:00,551 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-15 19:27:00,556 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:27:00,557 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2023-02-15 19:27:00,560 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:27:00,561 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2023-02-15 19:27:01,202 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 19:27:01,209 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-02-15 19:27:01,209 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 37 [2023-02-15 19:27:01,213 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2023-02-15 19:27:01,622 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 1 proven. 25 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-15 19:27:01,622 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 19:27:02,008 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [82385264] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 19:27:02,008 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 19:27:02,008 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 21] total 37 [2023-02-15 19:27:02,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867090685] [2023-02-15 19:27:02,008 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 19:27:02,009 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2023-02-15 19:27:02,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:27:02,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2023-02-15 19:27:02,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=1743, Unknown=0, NotChecked=0, Total=1892 [2023-02-15 19:27:02,010 INFO L87 Difference]: Start difference. First operand 80 states and 105 transitions. Second operand has 37 states, 33 states have (on average 1.9090909090909092) internal successors, (63), 35 states have internal predecessors, (63), 9 states have call successors, (9), 4 states have call predecessors, (9), 8 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2023-02-15 19:27:05,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:27:05,048 INFO L93 Difference]: Finished difference Result 228 states and 297 transitions. [2023-02-15 19:27:05,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2023-02-15 19:27:05,049 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 33 states have (on average 1.9090909090909092) internal successors, (63), 35 states have internal predecessors, (63), 9 states have call successors, (9), 4 states have call predecessors, (9), 8 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) Word has length 43 [2023-02-15 19:27:05,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:27:05,051 INFO L225 Difference]: With dead ends: 228 [2023-02-15 19:27:05,051 INFO L226 Difference]: Without dead ends: 150 [2023-02-15 19:27:05,056 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 58 SyntacticMatches, 2 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1670 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=879, Invalid=6093, Unknown=0, NotChecked=0, Total=6972 [2023-02-15 19:27:05,056 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 294 mSDsluCounter, 667 mSDsCounter, 0 mSdLazyCounter, 1098 mSolverCounterSat, 164 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 710 SdHoareTripleChecker+Invalid, 1262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 164 IncrementalHoareTripleChecker+Valid, 1098 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-02-15 19:27:05,056 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 710 Invalid, 1262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [164 Valid, 1098 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-02-15 19:27:05,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2023-02-15 19:27:05,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 133. [2023-02-15 19:27:05,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 95 states have (on average 1.231578947368421) internal successors, (117), 103 states have internal predecessors, (117), 19 states have call successors, (19), 11 states have call predecessors, (19), 18 states have return successors, (32), 18 states have call predecessors, (32), 17 states have call successors, (32) [2023-02-15 19:27:05,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 168 transitions. [2023-02-15 19:27:05,076 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 168 transitions. Word has length 43 [2023-02-15 19:27:05,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:27:05,076 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 168 transitions. [2023-02-15 19:27:05,077 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 33 states have (on average 1.9090909090909092) internal successors, (63), 35 states have internal predecessors, (63), 9 states have call successors, (9), 4 states have call predecessors, (9), 8 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2023-02-15 19:27:05,077 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 168 transitions. [2023-02-15 19:27:05,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-02-15 19:27:05,078 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:27:05,078 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 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] [2023-02-15 19:27:05,087 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-02-15 19:27:05,282 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:27:05,283 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:27:05,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:27:05,283 INFO L85 PathProgramCache]: Analyzing trace with hash 828672736, now seen corresponding path program 1 times [2023-02-15 19:27:05,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:27:05,283 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871382102] [2023-02-15 19:27:05,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:27:05,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:27:05,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:27:05,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-02-15 19:27:05,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:27:05,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 19:27:05,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:27:05,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-02-15 19:27:05,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:27:05,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 19:27:05,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:27:05,415 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-02-15 19:27:05,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:27:05,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871382102] [2023-02-15 19:27:05,416 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871382102] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 19:27:05,416 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 19:27:05,416 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-02-15 19:27:05,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991755590] [2023-02-15 19:27:05,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 19:27:05,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-15 19:27:05,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:27:05,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-15 19:27:05,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-02-15 19:27:05,418 INFO L87 Difference]: Start difference. First operand 133 states and 168 transitions. Second operand has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-15 19:27:05,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:27:05,488 INFO L93 Difference]: Finished difference Result 168 states and 214 transitions. [2023-02-15 19:27:05,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-15 19:27:05,489 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) Word has length 44 [2023-02-15 19:27:05,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:27:05,490 INFO L225 Difference]: With dead ends: 168 [2023-02-15 19:27:05,490 INFO L226 Difference]: Without dead ends: 166 [2023-02-15 19:27:05,491 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2023-02-15 19:27:05,491 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 7 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 19:27:05,491 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 317 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 19:27:05,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2023-02-15 19:27:05,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 138. [2023-02-15 19:27:05,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 99 states have (on average 1.2222222222222223) internal successors, (121), 105 states have internal predecessors, (121), 19 states have call successors, (19), 11 states have call predecessors, (19), 19 states have return successors, (34), 21 states have call predecessors, (34), 17 states have call successors, (34) [2023-02-15 19:27:05,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 174 transitions. [2023-02-15 19:27:05,505 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 174 transitions. Word has length 44 [2023-02-15 19:27:05,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:27:05,506 INFO L495 AbstractCegarLoop]: Abstraction has 138 states and 174 transitions. [2023-02-15 19:27:05,506 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-15 19:27:05,506 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 174 transitions. [2023-02-15 19:27:05,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-02-15 19:27:05,506 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:27:05,507 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:27:05,507 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-02-15 19:27:05,507 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:27:05,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:27:05,507 INFO L85 PathProgramCache]: Analyzing trace with hash 1865771786, now seen corresponding path program 1 times [2023-02-15 19:27:05,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:27:05,507 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043784760] [2023-02-15 19:27:05,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:27:05,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:27:05,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:27:05,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-02-15 19:27:05,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:27:05,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 19:27:05,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:27:05,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-02-15 19:27:05,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:27:05,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-02-15 19:27:05,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:27:05,615 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-15 19:27:05,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:27:05,615 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043784760] [2023-02-15 19:27:05,615 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043784760] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 19:27:05,615 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [83214447] [2023-02-15 19:27:05,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:27:05,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:27:05,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 19:27:05,616 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) [2023-02-15 19:27:05,637 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-02-15 19:27:05,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:27:05,736 INFO L263 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-15 19:27:05,737 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 19:27:05,764 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-02-15 19:27:05,765 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 19:27:05,801 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-02-15 19:27:05,801 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [83214447] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 19:27:05,802 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 19:27:05,802 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2023-02-15 19:27:05,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593299195] [2023-02-15 19:27:05,802 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 19:27:05,802 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-15 19:27:05,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:27:05,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-15 19:27:05,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2023-02-15 19:27:05,803 INFO L87 Difference]: Start difference. First operand 138 states and 174 transitions. Second operand has 12 states, 12 states have (on average 5.583333333333333) internal successors, (67), 12 states have internal predecessors, (67), 5 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 6 states have call predecessors, (9), 5 states have call successors, (9) [2023-02-15 19:27:05,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:27:05,943 INFO L93 Difference]: Finished difference Result 209 states and 258 transitions. [2023-02-15 19:27:05,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-15 19:27:05,944 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.583333333333333) internal successors, (67), 12 states have internal predecessors, (67), 5 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 6 states have call predecessors, (9), 5 states have call successors, (9) Word has length 46 [2023-02-15 19:27:05,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:27:05,945 INFO L225 Difference]: With dead ends: 209 [2023-02-15 19:27:05,945 INFO L226 Difference]: Without dead ends: 141 [2023-02-15 19:27:05,945 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 94 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2023-02-15 19:27:05,946 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 108 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 19:27:05,946 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 174 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 19:27:05,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2023-02-15 19:27:05,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 140. [2023-02-15 19:27:05,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 101 states have (on average 1.198019801980198) internal successors, (121), 106 states have internal predecessors, (121), 19 states have call successors, (19), 12 states have call predecessors, (19), 19 states have return successors, (34), 21 states have call predecessors, (34), 17 states have call successors, (34) [2023-02-15 19:27:05,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 174 transitions. [2023-02-15 19:27:05,958 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 174 transitions. Word has length 46 [2023-02-15 19:27:05,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:27:05,958 INFO L495 AbstractCegarLoop]: Abstraction has 140 states and 174 transitions. [2023-02-15 19:27:05,958 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.583333333333333) internal successors, (67), 12 states have internal predecessors, (67), 5 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 6 states have call predecessors, (9), 5 states have call successors, (9) [2023-02-15 19:27:05,959 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 174 transitions. [2023-02-15 19:27:05,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2023-02-15 19:27:05,959 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:27:05,959 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 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] [2023-02-15 19:27:05,966 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-02-15 19:27:06,164 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,SelfDestructingSolverStorable12 [2023-02-15 19:27:06,165 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:27:06,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:27:06,165 INFO L85 PathProgramCache]: Analyzing trace with hash 191887930, now seen corresponding path program 1 times [2023-02-15 19:27:06,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:27:06,165 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125648358] [2023-02-15 19:27:06,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:27:06,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:27:06,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:27:06,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 19:27:06,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:27:06,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 19:27:06,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:27:06,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-02-15 19:27:06,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:27:06,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 19:27:06,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:27:06,333 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-02-15 19:27:06,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:27:06,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125648358] [2023-02-15 19:27:06,333 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125648358] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 19:27:06,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [445341111] [2023-02-15 19:27:06,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:27:06,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:27:06,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 19:27:06,335 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) [2023-02-15 19:27:06,388 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-02-15 19:27:06,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:27:06,507 INFO L263 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 123 conjunts are in the unsatisfiable core [2023-02-15 19:27:06,511 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 19:27:06,547 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:27:06,548 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 19:27:06,549 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2023-02-15 19:27:06,552 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:27:06,553 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2023-02-15 19:27:06,563 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:27:06,563 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2023-02-15 19:27:06,566 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:27:06,566 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-02-15 19:27:06,700 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:27:06,736 INFO L321 Elim1Store]: treesize reduction 67, result has 29.5 percent of original size [2023-02-15 19:27:06,736 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 58 treesize of output 102 [2023-02-15 19:27:06,743 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:27:06,744 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:27:06,745 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 19:27:06,802 INFO L321 Elim1Store]: treesize reduction 82, result has 27.4 percent of original size [2023-02-15 19:27:06,802 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 92 treesize of output 69 [2023-02-15 19:27:06,833 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2023-02-15 19:27:06,841 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2023-02-15 19:27:06,856 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-02-15 19:27:06,927 INFO L321 Elim1Store]: treesize reduction 31, result has 3.1 percent of original size [2023-02-15 19:27:06,928 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 138 treesize of output 78 [2023-02-15 19:27:06,931 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 35 [2023-02-15 19:27:08,573 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:27:08,574 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:27:08,575 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 19:27:08,578 INFO L321 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2023-02-15 19:27:08,578 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 7 case distinctions, treesize of input 212 treesize of output 132 [2023-02-15 19:27:08,581 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:27:08,582 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:27:08,589 INFO L321 Elim1Store]: treesize reduction 9, result has 47.1 percent of original size [2023-02-15 19:27:08,589 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 147 treesize of output 124 [2023-02-15 19:27:08,593 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 70 [2023-02-15 19:27:08,607 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2023-02-15 19:27:08,646 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 20 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-02-15 19:27:08,647 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 19:27:08,682 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2023-02-15 19:27:19,081 WARN L233 SmtUtils]: Spent 10.02s on a formula simplification that was a NOOP. DAG size: 30 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-15 19:27:29,163 WARN L233 SmtUtils]: Spent 10.02s on a formula simplification that was a NOOP. DAG size: 37 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-15 19:27:29,312 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_main_~#list~0#1.offset| 4)) (.cse1 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 4)) (.cse0 (+ |c_ULTIMATE.start_main_~tail~0#1.offset| 4)) (.cse3 (+ |c_ULTIMATE.start_main_~n~0#1.offset| 4))) (and (forall ((|ULTIMATE.start_main_~n~0#1.base| Int)) (or (forall ((v_ArrVal_930 (Array Int Int)) (v_ArrVal_929 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_929) |c_ULTIMATE.start_main_~tail~0#1.base| (store (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_930) |c_ULTIMATE.start_main_~tail~0#1.base|) .cse0 |ULTIMATE.start_main_~n~0#1.base|)) |c_ULTIMATE.start_main_~x~0#1.base|) .cse1) 0)) (= (select (select (let ((.cse2 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| (store (store (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset| |c_ULTIMATE.start_main_~tail~0#1.offset|) .cse3 0)))) (store .cse2 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse0 |c_ULTIMATE.start_main_~n~0#1.offset|))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse4) |c_ULTIMATE.start_main_~x~0#1.offset|))) (forall ((v_ArrVal_930 (Array Int Int)) (|ULTIMATE.start_main_~n~0#1.base| Int) (v_ArrVal_929 (Array Int Int))) (or (= (select (select (store (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_929) |c_ULTIMATE.start_main_~tail~0#1.base| (store (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_930) |c_ULTIMATE.start_main_~tail~0#1.base|) .cse0 |ULTIMATE.start_main_~n~0#1.base|)) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse4) |c_ULTIMATE.start_main_~x~0#1.base|) (= (select (select (let ((.cse5 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| (store (store (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset| |c_ULTIMATE.start_main_~tail~0#1.offset|) .cse3 0)))) (store .cse5 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse5 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse0 |c_ULTIMATE.start_main_~n~0#1.offset|))) |c_ULTIMATE.start_main_~x~0#1.base|) .cse1) 0))) (forall ((v_ArrVal_930 (Array Int Int)) (|ULTIMATE.start_main_~n~0#1.base| Int) (v_ArrVal_929 (Array Int Int))) (let ((.cse6 (store (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_929) |c_ULTIMATE.start_main_~tail~0#1.base| (store (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_930) |c_ULTIMATE.start_main_~tail~0#1.base|) .cse0 |ULTIMATE.start_main_~n~0#1.base|)))) (or (= (select (select .cse6 |c_ULTIMATE.start_main_~x~0#1.base|) .cse1) 0) (= (select (select .cse6 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse4) |c_ULTIMATE.start_main_~x~0#1.base|)))) (forall ((|ULTIMATE.start_main_~n~0#1.base| Int)) (let ((.cse7 (let ((.cse8 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| (store (store (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset| |c_ULTIMATE.start_main_~tail~0#1.offset|) .cse3 0)))) (store .cse8 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse8 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse0 |c_ULTIMATE.start_main_~n~0#1.offset|))))) (or (= (select (select .cse7 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse4) |c_ULTIMATE.start_main_~x~0#1.offset|) (= (select (select .cse7 |c_ULTIMATE.start_main_~x~0#1.base|) .cse1) 0)))))) is different from false [2023-02-15 19:27:29,365 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 4)) (.cse3 (+ |c_ULTIMATE.start_main_~#list~0#1.offset| 4)) (.cse1 (+ |c_ULTIMATE.start_main_~tail~0#1.offset| 4))) (and (forall ((v_ArrVal_930 (Array Int Int)) (|ULTIMATE.start_main_~n~0#1.base| Int) (v_ArrVal_929 (Array Int Int))) (or (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| (store (store (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base|) 0 |c_ULTIMATE.start_main_~tail~0#1.offset|) 4 0)))) (store .cse0 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse1 0))) |c_ULTIMATE.start_main_~x~0#1.base|) .cse2) 0) (= (select (select (store (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_929) |c_ULTIMATE.start_main_~tail~0#1.base| (store (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_930) |c_ULTIMATE.start_main_~tail~0#1.base|) .cse1 |ULTIMATE.start_main_~n~0#1.base|)) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse3) |c_ULTIMATE.start_main_~x~0#1.base|))) (forall ((|ULTIMATE.start_main_~n~0#1.base| Int)) (or (forall ((v_ArrVal_930 (Array Int Int)) (v_ArrVal_929 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_929) |c_ULTIMATE.start_main_~tail~0#1.base| (store (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_930) |c_ULTIMATE.start_main_~tail~0#1.base|) .cse1 |ULTIMATE.start_main_~n~0#1.base|)) |c_ULTIMATE.start_main_~x~0#1.base|) .cse2) 0)) (= (select (select (let ((.cse4 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| (store (store (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base|) 0 |c_ULTIMATE.start_main_~tail~0#1.offset|) 4 0)))) (store .cse4 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse4 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse1 0))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse3) |c_ULTIMATE.start_main_~x~0#1.offset|))) (forall ((v_ArrVal_930 (Array Int Int)) (|ULTIMATE.start_main_~n~0#1.base| Int) (v_ArrVal_929 (Array Int Int))) (let ((.cse5 (store (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_929) |c_ULTIMATE.start_main_~tail~0#1.base| (store (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_930) |c_ULTIMATE.start_main_~tail~0#1.base|) .cse1 |ULTIMATE.start_main_~n~0#1.base|)))) (or (= (select (select .cse5 |c_ULTIMATE.start_main_~x~0#1.base|) .cse2) 0) (= (select (select .cse5 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse3) |c_ULTIMATE.start_main_~x~0#1.base|)))) (forall ((|ULTIMATE.start_main_~n~0#1.base| Int)) (let ((.cse6 (let ((.cse7 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| (store (store (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base|) 0 |c_ULTIMATE.start_main_~tail~0#1.offset|) 4 0)))) (store .cse7 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse7 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse1 0))))) (or (= (select (select .cse6 |c_ULTIMATE.start_main_~x~0#1.base|) .cse2) 0) (= (select (select .cse6 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse3) |c_ULTIMATE.start_main_~x~0#1.offset|)))))) is different from false [2023-02-15 19:27:29,445 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~#list~0#1.offset| 4)) (.cse3 (+ |c_ULTIMATE.start_main_~tail~0#1.offset| 4)) (.cse2 (+ |c_ULTIMATE.start_main_~n~0#1.offset| 4))) (and (forall ((v_ArrVal_930 (Array Int Int)) (v_ArrVal_929 (Array Int Int)) (v_subst_1 Int)) (let ((.cse0 (store (store |c_#memory_$Pointer$.base| v_subst_1 v_ArrVal_929) |c_ULTIMATE.start_main_~tail~0#1.base| (store (select (store |c_#memory_$Pointer$.base| v_subst_1 v_ArrVal_930) |c_ULTIMATE.start_main_~tail~0#1.base|) .cse3 v_subst_1)))) (or (= (select (select .cse0 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse1) |c_ULTIMATE.start_main_~n~0#1.base|) (= (select (select .cse0 |c_ULTIMATE.start_main_~n~0#1.base|) .cse2) 0)))) (forall ((v_ArrVal_930 (Array Int Int)) (v_ArrVal_929 (Array Int Int)) (v_subst_2 Int)) (or (= (select (select (let ((.cse4 (store |c_#memory_$Pointer$.offset| v_subst_2 (store (store (select |c_#memory_$Pointer$.offset| v_subst_2) 0 |c_ULTIMATE.start_main_~tail~0#1.offset|) 4 0)))) (store .cse4 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse4 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse3 0))) |c_ULTIMATE.start_main_~n~0#1.base|) .cse2) 0) (= (select (select (store (store |c_#memory_$Pointer$.base| v_subst_2 v_ArrVal_929) |c_ULTIMATE.start_main_~tail~0#1.base| (store (select (store |c_#memory_$Pointer$.base| v_subst_2 v_ArrVal_930) |c_ULTIMATE.start_main_~tail~0#1.base|) .cse3 v_subst_2)) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse1) |c_ULTIMATE.start_main_~n~0#1.base|))) (forall ((v_subst_4 Int)) (let ((.cse5 (let ((.cse6 (store |c_#memory_$Pointer$.offset| v_subst_4 (store (store (select |c_#memory_$Pointer$.offset| v_subst_4) 0 |c_ULTIMATE.start_main_~tail~0#1.offset|) 4 0)))) (store .cse6 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse6 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse3 0))))) (or (= (select (select .cse5 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse1) |c_ULTIMATE.start_main_~n~0#1.offset|) (= (select (select .cse5 |c_ULTIMATE.start_main_~n~0#1.base|) .cse2) 0)))) (forall ((v_subst_3 Int)) (or (= (select (select (let ((.cse7 (store |c_#memory_$Pointer$.offset| v_subst_3 (store (store (select |c_#memory_$Pointer$.offset| v_subst_3) 0 |c_ULTIMATE.start_main_~tail~0#1.offset|) 4 0)))) (store .cse7 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse7 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse3 0))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse1) |c_ULTIMATE.start_main_~n~0#1.offset|) (forall ((v_ArrVal_930 (Array Int Int)) (v_ArrVal_929 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| v_subst_3 v_ArrVal_929) |c_ULTIMATE.start_main_~tail~0#1.base| (store (select (store |c_#memory_$Pointer$.base| v_subst_3 v_ArrVal_930) |c_ULTIMATE.start_main_~tail~0#1.base|) .cse3 v_subst_3)) |c_ULTIMATE.start_main_~n~0#1.base|) .cse2) 0)))))) is different from false [2023-02-15 19:27:29,464 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 19:27:29,465 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 115 treesize of output 81 [2023-02-15 19:27:29,475 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 19:27:29,475 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1921 treesize of output 1866 [2023-02-15 19:27:29,509 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 19:27:29,510 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1406 treesize of output 1318 [2023-02-15 19:27:29,528 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 19:27:29,529 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 2169 treesize of output 2009 [2023-02-15 19:27:29,547 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 19:27:29,548 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 2001 treesize of output 1929 [2023-02-15 19:27:32,270 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 19:27:32,271 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 211 treesize of output 125 [2023-02-15 19:27:32,274 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:27:32,274 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 19:27:32,281 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 19:27:32,281 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 271 treesize of output 257 [2023-02-15 19:27:32,286 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:27:32,290 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 189 treesize of output 181 [2023-02-15 19:27:32,297 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:27:32,300 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 359 treesize of output 321 [2023-02-15 19:27:32,337 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 19:27:32,337 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 57 treesize of output 50 [2023-02-15 19:27:32,342 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 19:27:32,347 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2023-02-15 19:27:32,357 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 19:27:32,357 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 105 treesize of output 72 [2023-02-15 19:27:32,360 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 19:27:32,361 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:27:32,362 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 21 [2023-02-15 19:27:32,365 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:27:32,369 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-02-15 19:27:32,373 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-15 19:27:32,448 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 9 trivial. 4 not checked. [2023-02-15 19:27:32,448 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [445341111] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 19:27:32,448 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 19:27:32,448 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 15, 15] total 32 [2023-02-15 19:27:32,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527000383] [2023-02-15 19:27:32,448 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 19:27:32,449 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-02-15 19:27:32,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:27:32,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-02-15 19:27:32,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=728, Unknown=5, NotChecked=168, Total=992 [2023-02-15 19:27:32,450 INFO L87 Difference]: Start difference. First operand 140 states and 174 transitions. Second operand has 32 states, 30 states have (on average 2.5) internal successors, (75), 29 states have internal predecessors, (75), 6 states have call successors, (10), 3 states have call predecessors, (10), 7 states have return successors, (10), 8 states have call predecessors, (10), 6 states have call successors, (10) [2023-02-15 19:27:41,963 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-02-15 19:27:44,090 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-02-15 19:27:54,261 WARN L233 SmtUtils]: Spent 10.05s on a formula simplification that was a NOOP. DAG size: 49 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-15 19:28:09,163 WARN L233 SmtUtils]: Spent 10.05s on a formula simplification that was a NOOP. DAG size: 64 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-15 19:28:19,259 WARN L233 SmtUtils]: Spent 10.05s on a formula simplification that was a NOOP. DAG size: 61 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-15 19:28:29,478 WARN L233 SmtUtils]: Spent 10.09s on a formula simplification that was a NOOP. DAG size: 67 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-15 19:28:39,787 WARN L233 SmtUtils]: Spent 10.12s on a formula simplification that was a NOOP. DAG size: 63 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-15 19:28:50,146 WARN L233 SmtUtils]: Spent 10.14s on a formula simplification that was a NOOP. DAG size: 51 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-15 19:29:00,539 WARN L233 SmtUtils]: Spent 10.06s on a formula simplification that was a NOOP. DAG size: 51 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-15 19:29:02,885 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-02-15 19:29:05,283 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-02-15 19:29:23,794 WARN L233 SmtUtils]: Spent 10.14s on a formula simplification that was a NOOP. DAG size: 94 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-15 19:29:38,715 WARN L233 SmtUtils]: Spent 10.21s on a formula simplification that was a NOOP. DAG size: 94 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-15 19:29:39,833 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-02-15 19:29:43,331 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-15 19:29:45,362 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-15 19:29:50,491 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-02-15 19:29:50,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:29:50,491 INFO L93 Difference]: Finished difference Result 254 states and 315 transitions. [2023-02-15 19:29:50,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2023-02-15 19:29:50,506 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 30 states have (on average 2.5) internal successors, (75), 29 states have internal predecessors, (75), 6 states have call successors, (10), 3 states have call predecessors, (10), 7 states have return successors, (10), 8 states have call predecessors, (10), 6 states have call successors, (10) Word has length 47 [2023-02-15 19:29:50,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:29:50,507 INFO L225 Difference]: With dead ends: 254 [2023-02-15 19:29:50,507 INFO L226 Difference]: Without dead ends: 140 [2023-02-15 19:29:50,508 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 82 SyntacticMatches, 3 SemanticMatches, 64 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 716 ImplicationChecksByTransitivity, 137.2s TimeCoverageRelationStatistics Valid=591, Invalid=3293, Unknown=34, NotChecked=372, Total=4290 [2023-02-15 19:29:50,509 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 117 mSDsluCounter, 532 mSDsCounter, 0 mSdLazyCounter, 873 mSolverCounterSat, 56 mSolverCounterUnsat, 25 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 21.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 575 SdHoareTripleChecker+Invalid, 1228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 873 IncrementalHoareTripleChecker+Invalid, 25 IncrementalHoareTripleChecker+Unknown, 274 IncrementalHoareTripleChecker+Unchecked, 22.0s IncrementalHoareTripleChecker+Time [2023-02-15 19:29:50,509 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 575 Invalid, 1228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 873 Invalid, 25 Unknown, 274 Unchecked, 22.0s Time] [2023-02-15 19:29:50,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2023-02-15 19:29:50,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 116. [2023-02-15 19:29:50,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 83 states have (on average 1.180722891566265) internal successors, (98), 88 states have internal predecessors, (98), 16 states have call successors, (16), 11 states have call predecessors, (16), 16 states have return successors, (28), 16 states have call predecessors, (28), 14 states have call successors, (28) [2023-02-15 19:29:50,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 142 transitions. [2023-02-15 19:29:50,534 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 142 transitions. Word has length 47 [2023-02-15 19:29:50,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:29:50,535 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 142 transitions. [2023-02-15 19:29:50,535 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 30 states have (on average 2.5) internal successors, (75), 29 states have internal predecessors, (75), 6 states have call successors, (10), 3 states have call predecessors, (10), 7 states have return successors, (10), 8 states have call predecessors, (10), 6 states have call successors, (10) [2023-02-15 19:29:50,535 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 142 transitions. [2023-02-15 19:29:50,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2023-02-15 19:29:50,536 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:29:50,536 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 3, 3, 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] [2023-02-15 19:29:50,547 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-02-15 19:29:50,741 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:29:50,741 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:29:50,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:29:50,742 INFO L85 PathProgramCache]: Analyzing trace with hash 604583819, now seen corresponding path program 2 times [2023-02-15 19:29:50,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:29:50,742 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497220501] [2023-02-15 19:29:50,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:29:50,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:29:50,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:29:51,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-02-15 19:29:51,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:29:51,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 19:29:51,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:29:51,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-02-15 19:29:51,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:29:51,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 19:29:51,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:29:51,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 19:29:51,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:29:51,327 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 10 proven. 21 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-02-15 19:29:51,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:29:51,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497220501] [2023-02-15 19:29:51,328 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497220501] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 19:29:51,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1830159987] [2023-02-15 19:29:51,328 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 19:29:51,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:29:51,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 19:29:51,329 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) [2023-02-15 19:29:51,332 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-02-15 19:29:51,458 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-15 19:29:51,459 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 19:29:51,461 INFO L263 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 74 conjunts are in the unsatisfiable core [2023-02-15 19:29:51,466 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 19:29:51,498 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:29:51,500 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2023-02-15 19:29:51,511 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-15 19:29:51,511 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 27 [2023-02-15 19:29:51,516 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:29:51,517 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2023-02-15 19:29:51,530 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:29:51,531 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2023-02-15 19:29:51,543 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-15 19:29:51,543 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 27 [2023-02-15 19:29:51,553 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:29:51,554 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2023-02-15 19:29:51,901 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:29:51,925 INFO L321 Elim1Store]: treesize reduction 56, result has 35.6 percent of original size [2023-02-15 19:29:51,925 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 100 treesize of output 93 [2023-02-15 19:29:51,929 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:29:51,946 INFO L321 Elim1Store]: treesize reduction 46, result has 35.2 percent of original size [2023-02-15 19:29:51,946 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 91 treesize of output 82 [2023-02-15 19:29:54,755 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 35 proven. 5 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-02-15 19:29:54,755 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 19:29:55,383 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 19:29:55,384 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 341 treesize of output 268 [2023-02-15 19:29:55,396 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 19:29:55,397 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 263 treesize of output 164 [2023-02-15 19:29:55,455 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 19:29:55,455 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 785 treesize of output 767 [2023-02-15 19:29:55,469 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:29:55,492 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 19:29:55,493 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1513 treesize of output 1461 [2023-02-15 19:29:55,529 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 19:29:55,530 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 1499 treesize of output 1391 [2023-02-15 19:29:55,570 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 19:29:55,571 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 1537 treesize of output 1379 [2023-02-15 19:29:56,431 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 366 treesize of output 350 [2023-02-15 19:29:57,757 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-02-15 19:29:57,794 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 31 [2023-02-15 19:29:57,862 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-02-15 19:29:58,807 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 31 [2023-02-15 19:29:58,830 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 19:29:58,830 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 27 [2023-02-15 19:29:58,867 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 14 proven. 5 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2023-02-15 19:29:58,867 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1830159987] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 19:29:58,867 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 19:29:58,867 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16, 15] total 39 [2023-02-15 19:29:58,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549220166] [2023-02-15 19:29:58,868 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 19:29:58,868 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2023-02-15 19:29:58,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:29:58,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2023-02-15 19:29:58,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=1324, Unknown=0, NotChecked=0, Total=1482 [2023-02-15 19:29:58,869 INFO L87 Difference]: Start difference. First operand 116 states and 142 transitions. Second operand has 39 states, 37 states have (on average 1.945945945945946) internal successors, (72), 39 states have internal predecessors, (72), 12 states have call successors, (12), 3 states have call predecessors, (12), 5 states have return successors, (11), 9 states have call predecessors, (11), 11 states have call successors, (11) [2023-02-15 19:30:01,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:30:01,269 INFO L93 Difference]: Finished difference Result 188 states and 228 transitions. [2023-02-15 19:30:01,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-02-15 19:30:01,269 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 37 states have (on average 1.945945945945946) internal successors, (72), 39 states have internal predecessors, (72), 12 states have call successors, (12), 3 states have call predecessors, (12), 5 states have return successors, (11), 9 states have call predecessors, (11), 11 states have call successors, (11) Word has length 50 [2023-02-15 19:30:01,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:30:01,270 INFO L225 Difference]: With dead ends: 188 [2023-02-15 19:30:01,270 INFO L226 Difference]: Without dead ends: 104 [2023-02-15 19:30:01,271 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 82 SyntacticMatches, 4 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 717 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=511, Invalid=2911, Unknown=0, NotChecked=0, Total=3422 [2023-02-15 19:30:01,271 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 154 mSDsluCounter, 409 mSDsCounter, 0 mSdLazyCounter, 602 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 450 SdHoareTripleChecker+Invalid, 676 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 602 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-02-15 19:30:01,271 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 450 Invalid, 676 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 602 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-02-15 19:30:01,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2023-02-15 19:30:01,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 92. [2023-02-15 19:30:01,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 68 states have (on average 1.161764705882353) internal successors, (79), 72 states have internal predecessors, (79), 12 states have call successors, (12), 9 states have call predecessors, (12), 11 states have return successors, (20), 10 states have call predecessors, (20), 11 states have call successors, (20) [2023-02-15 19:30:01,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 111 transitions. [2023-02-15 19:30:01,288 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 111 transitions. Word has length 50 [2023-02-15 19:30:01,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:30:01,289 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 111 transitions. [2023-02-15 19:30:01,289 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 37 states have (on average 1.945945945945946) internal successors, (72), 39 states have internal predecessors, (72), 12 states have call successors, (12), 3 states have call predecessors, (12), 5 states have return successors, (11), 9 states have call predecessors, (11), 11 states have call successors, (11) [2023-02-15 19:30:01,289 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 111 transitions. [2023-02-15 19:30:01,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-02-15 19:30:01,290 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:30:01,290 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:30:01,295 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-02-15 19:30:01,493 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:30:01,493 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:30:01,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:30:01,494 INFO L85 PathProgramCache]: Analyzing trace with hash -664222695, now seen corresponding path program 1 times [2023-02-15 19:30:01,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:30:01,494 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108153812] [2023-02-15 19:30:01,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:30:01,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:30:01,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:30:02,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-02-15 19:30:02,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:30:02,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 19:30:02,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:30:02,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-02-15 19:30:02,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:30:02,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-02-15 19:30:02,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:30:02,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-02-15 19:30:02,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:30:02,090 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-02-15 19:30:02,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:30:02,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108153812] [2023-02-15 19:30:02,091 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108153812] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 19:30:02,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1296700500] [2023-02-15 19:30:02,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:30:02,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:30:02,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 19:30:02,093 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) [2023-02-15 19:30:02,095 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-02-15 19:30:02,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:30:02,220 INFO L263 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 61 conjunts are in the unsatisfiable core [2023-02-15 19:30:02,223 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 19:30:02,266 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:30:02,268 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2023-02-15 19:30:02,271 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:30:02,271 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-02-15 19:30:02,276 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:30:02,277 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2023-02-15 19:30:02,280 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:30:02,280 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2023-02-15 19:30:02,548 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 19:30:02,548 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 38 [2023-02-15 19:30:02,552 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:30:02,553 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2023-02-15 19:30:02,741 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2023-02-15 19:30:02,744 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-15 19:30:02,762 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 16 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-02-15 19:30:02,762 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 19:30:02,827 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_remove_~x#1.base|) |c_ULTIMATE.start_remove_~x#1.offset|)) (.cse1 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 4))) (and (forall ((v_ArrVal_1155 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1155) |c_ULTIMATE.start_main_~x~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_1154 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1154) |c_ULTIMATE.start_main_~x~0#1.base|) .cse1) 0)))) is different from false [2023-02-15 19:30:02,905 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1296700500] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 19:30:02,905 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 19:30:02,906 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2023-02-15 19:30:02,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338585625] [2023-02-15 19:30:02,906 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 19:30:02,907 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-02-15 19:30:02,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:30:02,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-02-15 19:30:02,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=373, Unknown=10, NotChecked=40, Total=506 [2023-02-15 19:30:02,908 INFO L87 Difference]: Start difference. First operand 92 states and 111 transitions. Second operand has 20 states, 20 states have (on average 3.15) internal successors, (63), 20 states have internal predecessors, (63), 8 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 7 states have call predecessors, (10), 8 states have call successors, (10) [2023-02-15 19:30:03,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:30:03,433 INFO L93 Difference]: Finished difference Result 117 states and 137 transitions. [2023-02-15 19:30:03,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-15 19:30:03,434 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.15) internal successors, (63), 20 states have internal predecessors, (63), 8 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 7 states have call predecessors, (10), 8 states have call successors, (10) Word has length 53 [2023-02-15 19:30:03,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:30:03,435 INFO L225 Difference]: With dead ends: 117 [2023-02-15 19:30:03,435 INFO L226 Difference]: Without dead ends: 97 [2023-02-15 19:30:03,435 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 86 SyntacticMatches, 3 SemanticMatches, 30 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=232, Invalid=692, Unknown=10, NotChecked=58, Total=992 [2023-02-15 19:30:03,438 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 122 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 19:30:03,438 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 243 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 19:30:03,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2023-02-15 19:30:03,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 90. [2023-02-15 19:30:03,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 66 states have (on average 1.1363636363636365) internal successors, (75), 70 states have internal predecessors, (75), 12 states have call successors, (12), 9 states have call predecessors, (12), 11 states have return successors, (20), 10 states have call predecessors, (20), 11 states have call successors, (20) [2023-02-15 19:30:03,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 107 transitions. [2023-02-15 19:30:03,454 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 107 transitions. Word has length 53 [2023-02-15 19:30:03,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:30:03,454 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 107 transitions. [2023-02-15 19:30:03,455 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.15) internal successors, (63), 20 states have internal predecessors, (63), 8 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 7 states have call predecessors, (10), 8 states have call successors, (10) [2023-02-15 19:30:03,455 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 107 transitions. [2023-02-15 19:30:03,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-02-15 19:30:03,456 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:30:03,456 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:30:03,465 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-02-15 19:30:03,660 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,SelfDestructingSolverStorable15 [2023-02-15 19:30:03,661 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:30:03,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:30:03,661 INFO L85 PathProgramCache]: Analyzing trace with hash -1675339945, now seen corresponding path program 1 times [2023-02-15 19:30:03,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:30:03,661 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571377860] [2023-02-15 19:30:03,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:30:03,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:30:03,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:30:04,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-02-15 19:30:04,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:30:04,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 19:30:04,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:30:04,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-02-15 19:30:04,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:30:04,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-02-15 19:30:04,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:30:04,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-02-15 19:30:04,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:30:04,422 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 17 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-15 19:30:04,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:30:04,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571377860] [2023-02-15 19:30:04,423 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571377860] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 19:30:04,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1571047614] [2023-02-15 19:30:04,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:30:04,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:30:04,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 19:30:04,438 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) [2023-02-15 19:30:04,464 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-02-15 19:30:04,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:30:04,566 INFO L263 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 90 conjunts are in the unsatisfiable core [2023-02-15 19:30:04,570 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 19:30:04,634 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:30:04,635 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2023-02-15 19:30:04,638 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:30:04,638 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2023-02-15 19:30:04,648 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:30:04,650 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2023-02-15 19:30:04,653 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:30:04,653 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2023-02-15 19:30:05,121 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 19:30:05,122 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 51 [2023-02-15 19:30:05,129 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:30:05,129 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 42 [2023-02-15 19:30:05,655 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 19:30:05,663 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-02-15 19:30:05,663 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 41 [2023-02-15 19:30:05,667 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 20 [2023-02-15 19:30:05,933 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 11 proven. 15 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-15 19:30:05,933 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 19:30:06,357 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1571047614] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 19:30:06,358 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 19:30:06,358 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17] total 34 [2023-02-15 19:30:06,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146312251] [2023-02-15 19:30:06,358 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 19:30:06,358 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-02-15 19:30:06,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:30:06,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-02-15 19:30:06,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=1494, Unknown=0, NotChecked=0, Total=1640 [2023-02-15 19:30:06,359 INFO L87 Difference]: Start difference. First operand 90 states and 107 transitions. Second operand has 34 states, 33 states have (on average 2.3333333333333335) internal successors, (77), 33 states have internal predecessors, (77), 9 states have call successors, (11), 5 states have call predecessors, (11), 7 states have return successors, (10), 7 states have call predecessors, (10), 8 states have call successors, (10) [2023-02-15 19:30:09,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:30:09,393 INFO L93 Difference]: Finished difference Result 111 states and 131 transitions. [2023-02-15 19:30:09,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2023-02-15 19:30:09,393 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 2.3333333333333335) internal successors, (77), 33 states have internal predecessors, (77), 9 states have call successors, (11), 5 states have call predecessors, (11), 7 states have return successors, (10), 7 states have call predecessors, (10), 8 states have call successors, (10) Word has length 53 [2023-02-15 19:30:09,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:30:09,394 INFO L225 Difference]: With dead ends: 111 [2023-02-15 19:30:09,394 INFO L226 Difference]: Without dead ends: 104 [2023-02-15 19:30:09,395 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 76 SyntacticMatches, 8 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1268 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=663, Invalid=4887, Unknown=0, NotChecked=0, Total=5550 [2023-02-15 19:30:09,396 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 195 mSDsluCounter, 452 mSDsCounter, 0 mSdLazyCounter, 856 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 485 SdHoareTripleChecker+Invalid, 973 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 856 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-02-15 19:30:09,396 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 485 Invalid, 973 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 856 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-02-15 19:30:09,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2023-02-15 19:30:09,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 95. [2023-02-15 19:30:09,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 69 states have (on average 1.1304347826086956) internal successors, (78), 74 states have internal predecessors, (78), 13 states have call successors, (13), 9 states have call predecessors, (13), 12 states have return successors, (24), 11 states have call predecessors, (24), 12 states have call successors, (24) [2023-02-15 19:30:09,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 115 transitions. [2023-02-15 19:30:09,410 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 115 transitions. Word has length 53 [2023-02-15 19:30:09,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:30:09,410 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 115 transitions. [2023-02-15 19:30:09,410 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 2.3333333333333335) internal successors, (77), 33 states have internal predecessors, (77), 9 states have call successors, (11), 5 states have call predecessors, (11), 7 states have return successors, (10), 7 states have call predecessors, (10), 8 states have call successors, (10) [2023-02-15 19:30:09,410 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 115 transitions. [2023-02-15 19:30:09,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-02-15 19:30:09,411 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:30:09,411 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:30:09,418 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-02-15 19:30:09,611 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,SelfDestructingSolverStorable16 [2023-02-15 19:30:09,611 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:30:09,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:30:09,612 INFO L85 PathProgramCache]: Analyzing trace with hash -1417174507, now seen corresponding path program 1 times [2023-02-15 19:30:09,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:30:09,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42064042] [2023-02-15 19:30:09,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:30:09,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:30:09,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:30:09,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-02-15 19:30:09,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:30:09,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 19:30:09,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:30:09,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-02-15 19:30:09,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:30:09,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-02-15 19:30:09,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:30:09,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-02-15 19:30:09,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:30:09,983 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-02-15 19:30:09,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:30:09,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42064042] [2023-02-15 19:30:09,984 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42064042] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 19:30:09,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1141544888] [2023-02-15 19:30:09,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:30:09,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:30:09,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 19:30:09,985 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) [2023-02-15 19:30:10,022 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-02-15 19:30:10,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:30:10,124 INFO L263 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 73 conjunts are in the unsatisfiable core [2023-02-15 19:30:10,126 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 19:30:10,172 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:30:10,172 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2023-02-15 19:30:10,176 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:30:10,176 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2023-02-15 19:30:10,180 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:30:10,180 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2023-02-15 19:30:10,183 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:30:10,183 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-02-15 19:30:10,626 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:30:10,627 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:30:10,627 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 19:30:10,633 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2023-02-15 19:30:10,633 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 44 [2023-02-15 19:30:10,650 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:30:10,651 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2023-02-15 19:30:11,045 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2023-02-15 19:30:11,070 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 17 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 19:30:11,070 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 19:30:11,393 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1141544888] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 19:30:11,393 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 19:30:11,393 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 18] total 30 [2023-02-15 19:30:11,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667280748] [2023-02-15 19:30:11,393 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 19:30:11,394 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-02-15 19:30:11,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:30:11,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-02-15 19:30:11,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=1156, Unknown=0, NotChecked=0, Total=1260 [2023-02-15 19:30:11,395 INFO L87 Difference]: Start difference. First operand 95 states and 115 transitions. Second operand has 30 states, 29 states have (on average 2.5172413793103448) internal successors, (73), 29 states have internal predecessors, (73), 7 states have call successors, (11), 4 states have call predecessors, (11), 6 states have return successors, (10), 7 states have call predecessors, (10), 7 states have call successors, (10) [2023-02-15 19:30:13,413 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-15 19:30:15,491 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-15 19:30:19,918 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-15 19:30:22,271 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-15 19:30:22,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:30:22,382 INFO L93 Difference]: Finished difference Result 155 states and 179 transitions. [2023-02-15 19:30:22,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2023-02-15 19:30:22,382 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 2.5172413793103448) internal successors, (73), 29 states have internal predecessors, (73), 7 states have call successors, (11), 4 states have call predecessors, (11), 6 states have return successors, (10), 7 states have call predecessors, (10), 7 states have call successors, (10) Word has length 53 [2023-02-15 19:30:22,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:30:22,383 INFO L225 Difference]: With dead ends: 155 [2023-02-15 19:30:22,383 INFO L226 Difference]: Without dead ends: 143 [2023-02-15 19:30:22,384 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 77 SyntacticMatches, 4 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 919 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=653, Invalid=3903, Unknown=0, NotChecked=0, Total=4556 [2023-02-15 19:30:22,384 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 393 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 647 mSolverCounterSat, 163 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 393 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 814 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 163 IncrementalHoareTripleChecker+Valid, 647 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.8s IncrementalHoareTripleChecker+Time [2023-02-15 19:30:22,385 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [393 Valid, 376 Invalid, 814 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [163 Valid, 647 Invalid, 4 Unknown, 0 Unchecked, 8.8s Time] [2023-02-15 19:30:22,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2023-02-15 19:30:22,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 93. [2023-02-15 19:30:22,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 68 states have (on average 1.1176470588235294) internal successors, (76), 72 states have internal predecessors, (76), 12 states have call successors, (12), 9 states have call predecessors, (12), 12 states have return successors, (23), 11 states have call predecessors, (23), 11 states have call successors, (23) [2023-02-15 19:30:22,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 111 transitions. [2023-02-15 19:30:22,408 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 111 transitions. Word has length 53 [2023-02-15 19:30:22,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:30:22,409 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 111 transitions. [2023-02-15 19:30:22,409 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 2.5172413793103448) internal successors, (73), 29 states have internal predecessors, (73), 7 states have call successors, (11), 4 states have call predecessors, (11), 6 states have return successors, (10), 7 states have call predecessors, (10), 7 states have call successors, (10) [2023-02-15 19:30:22,409 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 111 transitions. [2023-02-15 19:30:22,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-02-15 19:30:22,410 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:30:22,410 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 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] [2023-02-15 19:30:22,430 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-02-15 19:30:22,616 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-02-15 19:30:22,616 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:30:22,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:30:22,616 INFO L85 PathProgramCache]: Analyzing trace with hash -160259518, now seen corresponding path program 2 times [2023-02-15 19:30:22,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:30:22,617 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393968919] [2023-02-15 19:30:22,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:30:22,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:30:22,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:30:22,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-02-15 19:30:22,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:30:22,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 19:30:22,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:30:22,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-02-15 19:30:22,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:30:22,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-02-15 19:30:22,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:30:22,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-02-15 19:30:22,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:30:22,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 19:30:22,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:30:22,734 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2023-02-15 19:30:22,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:30:22,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393968919] [2023-02-15 19:30:22,735 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393968919] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 19:30:22,735 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 19:30:22,735 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-15 19:30:22,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756218659] [2023-02-15 19:30:22,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 19:30:22,736 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-15 19:30:22,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:30:22,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-15 19:30:22,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-02-15 19:30:22,737 INFO L87 Difference]: Start difference. First operand 93 states and 111 transitions. Second operand has 7 states, 6 states have (on average 6.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 1 states have call successors, (6) [2023-02-15 19:30:22,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:30:22,776 INFO L93 Difference]: Finished difference Result 101 states and 118 transitions. [2023-02-15 19:30:22,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 19:30:22,777 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 1 states have call successors, (6) Word has length 59 [2023-02-15 19:30:22,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:30:22,778 INFO L225 Difference]: With dead ends: 101 [2023-02-15 19:30:22,778 INFO L226 Difference]: Without dead ends: 91 [2023-02-15 19:30:22,778 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-02-15 19:30:22,779 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 1 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 19:30:22,779 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 242 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 19:30:22,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2023-02-15 19:30:22,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2023-02-15 19:30:22,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 67 states have (on average 1.1044776119402986) internal successors, (74), 70 states have internal predecessors, (74), 12 states have call successors, (12), 9 states have call predecessors, (12), 11 states have return successors, (19), 11 states have call predecessors, (19), 11 states have call successors, (19) [2023-02-15 19:30:22,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 105 transitions. [2023-02-15 19:30:22,795 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 105 transitions. Word has length 59 [2023-02-15 19:30:22,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:30:22,796 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 105 transitions. [2023-02-15 19:30:22,796 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 1 states have call successors, (6) [2023-02-15 19:30:22,796 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 105 transitions. [2023-02-15 19:30:22,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-02-15 19:30:22,800 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:30:22,800 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 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] [2023-02-15 19:30:22,800 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-02-15 19:30:22,800 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:30:22,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:30:22,801 INFO L85 PathProgramCache]: Analyzing trace with hash -1055504788, now seen corresponding path program 3 times [2023-02-15 19:30:22,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:30:22,801 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397412771] [2023-02-15 19:30:22,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:30:22,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:30:22,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:30:23,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-02-15 19:30:23,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:30:23,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 19:30:23,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:30:23,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-02-15 19:30:23,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:30:23,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-02-15 19:30:23,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:30:23,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-02-15 19:30:23,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:30:23,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 19:30:23,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:30:23,525 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 18 proven. 14 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-02-15 19:30:23,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:30:23,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397412771] [2023-02-15 19:30:23,525 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397412771] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 19:30:23,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [474621051] [2023-02-15 19:30:23,526 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-15 19:30:23,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:30:23,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 19:30:23,534 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) [2023-02-15 19:30:23,540 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-02-15 19:30:23,732 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2023-02-15 19:30:23,732 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 19:30:23,735 INFO L263 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 89 conjunts are in the unsatisfiable core [2023-02-15 19:30:23,737 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 19:30:23,791 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:30:23,792 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2023-02-15 19:30:23,795 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:30:23,795 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-15 19:30:23,801 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:30:23,802 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2023-02-15 19:30:23,805 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:30:23,805 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-15 19:30:24,072 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 19:30:24,072 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2023-02-15 19:30:24,077 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:30:24,078 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2023-02-15 19:30:24,296 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:30:24,297 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 44 [2023-02-15 19:30:24,302 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:30:24,302 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 32 [2023-02-15 19:30:24,673 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 32 proven. 4 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-02-15 19:30:24,674 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 19:30:25,057 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_remove_~x#1.base|) |c_ULTIMATE.start_remove_~x#1.offset|)) (.cse3 (+ |c_ULTIMATE.start_main_~#list~0#1.offset| 4))) (and (forall ((v_ArrVal_1516 (Array Int Int)) (v_ArrVal_1515 (Array Int Int))) (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1515))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_1516) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) 4) |c_ULTIMATE.start_main_~x~0#1.base|)))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse3) |c_ULTIMATE.start_main_~x~0#1.base|)) (forall ((v_ArrVal_1516 (Array Int Int)) (v_ArrVal_1515 (Array Int Int))) (= (select (select (let ((.cse5 (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1515) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|)) (.cse4 (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_1516))) (store .cse4 .cse5 (store (select .cse4 .cse5) (+ (select (select .cse4 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) 4) |c_ULTIMATE.start_main_~x~0#1.offset|))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse3) |c_ULTIMATE.start_main_~x~0#1.offset|)))) is different from false [2023-02-15 19:30:25,077 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|)) (.cse3 (+ |c_ULTIMATE.start_main_~#list~0#1.offset| 4))) (and (forall ((v_ArrVal_1516 (Array Int Int)) (v_ArrVal_1515 (Array Int Int))) (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1515))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_1516) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) 4) |c_ULTIMATE.start_main_~x~0#1.base|)))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse3) |c_ULTIMATE.start_main_~x~0#1.base|)) (forall ((v_ArrVal_1516 (Array Int Int)) (v_ArrVal_1515 (Array Int Int))) (= (select (select (let ((.cse5 (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1515) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|)) (.cse4 (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_1516))) (store .cse4 .cse5 (store (select .cse4 .cse5) (+ (select (select .cse4 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) 4) |c_ULTIMATE.start_main_~x~0#1.offset|))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse3) |c_ULTIMATE.start_main_~x~0#1.offset|)))) is different from false [2023-02-15 19:30:25,115 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [474621051] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 19:30:25,115 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 19:30:25,115 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 28 [2023-02-15 19:30:25,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621294438] [2023-02-15 19:30:25,116 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 19:30:25,116 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-02-15 19:30:25,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:30:25,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-02-15 19:30:25,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=928, Unknown=2, NotChecked=126, Total=1190 [2023-02-15 19:30:25,117 INFO L87 Difference]: Start difference. First operand 91 states and 105 transitions. Second operand has 28 states, 26 states have (on average 3.0) internal successors, (78), 27 states have internal predecessors, (78), 10 states have call successors, (13), 4 states have call predecessors, (13), 6 states have return successors, (12), 8 states have call predecessors, (12), 9 states have call successors, (12) [2023-02-15 19:30:25,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:30:25,950 INFO L93 Difference]: Finished difference Result 95 states and 110 transitions. [2023-02-15 19:30:25,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-02-15 19:30:25,951 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 26 states have (on average 3.0) internal successors, (78), 27 states have internal predecessors, (78), 10 states have call successors, (13), 4 states have call predecessors, (13), 6 states have return successors, (12), 8 states have call predecessors, (12), 9 states have call successors, (12) Word has length 60 [2023-02-15 19:30:25,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:30:25,951 INFO L225 Difference]: With dead ends: 95 [2023-02-15 19:30:25,951 INFO L226 Difference]: Without dead ends: 0 [2023-02-15 19:30:25,952 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 92 SyntacticMatches, 7 SemanticMatches, 49 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 540 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=378, Invalid=1980, Unknown=2, NotChecked=190, Total=2550 [2023-02-15 19:30:25,953 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 125 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 424 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 424 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-15 19:30:25,954 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 309 Invalid, 468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 424 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-15 19:30:25,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-02-15 19:30:25,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-02-15 19:30:25,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 19:30:25,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-02-15 19:30:25,954 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 60 [2023-02-15 19:30:25,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:30:25,955 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-02-15 19:30:25,955 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 26 states have (on average 3.0) internal successors, (78), 27 states have internal predecessors, (78), 10 states have call successors, (13), 4 states have call predecessors, (13), 6 states have return successors, (12), 8 states have call predecessors, (12), 9 states have call successors, (12) [2023-02-15 19:30:25,955 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-02-15 19:30:25,955 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-02-15 19:30:25,957 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-02-15 19:30:25,976 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-02-15 19:30:26,164 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:30:26,166 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-02-15 19:30:33,033 WARN L233 SmtUtils]: Spent 6.38s on a formula simplification. DAG size of input: 383 DAG size of output: 382 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2023-02-15 19:30:59,769 WARN L233 SmtUtils]: Spent 25.19s on a formula simplification. DAG size of input: 382 DAG size of output: 181 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter)