./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 b5317dae 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-?-b5317da-m [2023-02-16 00:47:54,717 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-16 00:47:54,718 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-16 00:47:54,756 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-16 00:47:54,756 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-16 00:47:54,758 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-16 00:47:54,760 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-16 00:47:54,761 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-16 00:47:54,763 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-16 00:47:54,766 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-16 00:47:54,767 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-16 00:47:54,768 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-16 00:47:54,768 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-16 00:47:54,770 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-16 00:47:54,771 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-16 00:47:54,771 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-16 00:47:54,772 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-16 00:47:54,773 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-16 00:47:54,774 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-16 00:47:54,777 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-16 00:47:54,778 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-16 00:47:54,779 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-16 00:47:54,780 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-16 00:47:54,780 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-16 00:47:54,786 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-16 00:47:54,787 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-16 00:47:54,787 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-16 00:47:54,788 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-16 00:47:54,788 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-16 00:47:54,789 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-16 00:47:54,789 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-16 00:47:54,789 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-16 00:47:54,790 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-16 00:47:54,791 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-16 00:47:54,791 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-16 00:47:54,791 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-16 00:47:54,792 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-16 00:47:54,792 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-16 00:47:54,792 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-16 00:47:54,793 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-16 00:47:54,793 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-16 00:47:54,794 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-02-16 00:47:54,815 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-16 00:47:54,816 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-16 00:47:54,816 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-16 00:47:54,816 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-16 00:47:54,817 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-16 00:47:54,817 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-16 00:47:54,817 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-16 00:47:54,817 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-16 00:47:54,818 INFO L138 SettingsManager]: * Use SBE=true [2023-02-16 00:47:54,818 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-16 00:47:54,818 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-16 00:47:54,818 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-16 00:47:54,819 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-16 00:47:54,819 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-16 00:47:54,819 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-16 00:47:54,819 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-16 00:47:54,819 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-16 00:47:54,819 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-16 00:47:54,819 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-16 00:47:54,819 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-16 00:47:54,820 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-16 00:47:54,820 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-16 00:47:54,820 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-16 00:47:54,820 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-16 00:47:54,820 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-16 00:47:54,820 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-16 00:47:54,820 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-16 00:47:54,821 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-16 00:47:54,821 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-16 00:47:54,821 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-16 00:47:54,821 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-16 00:47:54,821 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-16 00:47:54,821 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-16 00:47:54,821 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-16 00:47:54,822 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-16 00:47:54,822 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-16 00:47:55,034 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-16 00:47:55,046 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-16 00:47:55,048 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-16 00:47:55,049 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-16 00:47:55,056 INFO L275 PluginConnector]: CDTParser initialized [2023-02-16 00:47:55,057 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-16 00:47:55,963 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-16 00:47:56,130 INFO L351 CDTParser]: Found 1 translation units. [2023-02-16 00:47:56,130 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/dancing.i [2023-02-16 00:47:56,136 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/65b6c3365/22b5af877f13452b819b4d433075a4e0/FLAGc18e50f0e [2023-02-16 00:47:56,145 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/65b6c3365/22b5af877f13452b819b4d433075a4e0 [2023-02-16 00:47:56,147 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-16 00:47:56,148 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-16 00:47:56,148 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-16 00:47:56,149 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-16 00:47:56,151 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-16 00:47:56,151 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.02 12:47:56" (1/1) ... [2023-02-16 00:47:56,152 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62611499 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:47:56, skipping insertion in model container [2023-02-16 00:47:56,152 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.02 12:47:56" (1/1) ... [2023-02-16 00:47:56,157 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-16 00:47:56,189 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-16 00:47:56,277 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-16 00:47:56,363 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-16 00:47:56,373 INFO L203 MainTranslator]: Completed pre-run [2023-02-16 00:47:56,385 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-16 00:47:56,419 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-16 00:47:56,447 INFO L208 MainTranslator]: Completed translation [2023-02-16 00:47:56,447 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:47:56 WrapperNode [2023-02-16 00:47:56,448 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-16 00:47:56,449 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-16 00:47:56,449 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-16 00:47:56,449 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-16 00:47:56,453 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:47:56" (1/1) ... [2023-02-16 00:47:56,475 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:47:56" (1/1) ... [2023-02-16 00:47:56,495 INFO L138 Inliner]: procedures = 124, calls = 40, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 90 [2023-02-16 00:47:56,496 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-16 00:47:56,496 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-16 00:47:56,496 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-16 00:47:56,496 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-16 00:47:56,502 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:47:56" (1/1) ... [2023-02-16 00:47:56,502 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:47:56" (1/1) ... [2023-02-16 00:47:56,507 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:47:56" (1/1) ... [2023-02-16 00:47:56,507 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:47:56" (1/1) ... [2023-02-16 00:47:56,512 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:47:56" (1/1) ... [2023-02-16 00:47:56,514 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:47:56" (1/1) ... [2023-02-16 00:47:56,515 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:47:56" (1/1) ... [2023-02-16 00:47:56,516 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:47:56" (1/1) ... [2023-02-16 00:47:56,517 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-16 00:47:56,518 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-16 00:47:56,518 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-16 00:47:56,518 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-16 00:47:56,519 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:47:56" (1/1) ... [2023-02-16 00:47:56,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-16 00:47:56,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 00:47:56,574 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-16 00:47:56,581 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-16 00:47:56,599 INFO L130 BoogieDeclarations]: Found specification of procedure is_list_containing_x [2023-02-16 00:47:56,599 INFO L138 BoogieDeclarations]: Found implementation of procedure is_list_containing_x [2023-02-16 00:47:56,599 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-02-16 00:47:56,599 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-02-16 00:47:56,599 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-16 00:47:56,600 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-16 00:47:56,600 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-02-16 00:47:56,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-02-16 00:47:56,600 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-02-16 00:47:56,600 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-16 00:47:56,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-16 00:47:56,600 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-16 00:47:56,601 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-16 00:47:56,673 INFO L235 CfgBuilder]: Building ICFG [2023-02-16 00:47:56,675 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-16 00:47:56,863 INFO L276 CfgBuilder]: Performing block encoding [2023-02-16 00:47:56,867 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-16 00:47:56,867 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2023-02-16 00:47:56,869 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.02 12:47:56 BoogieIcfgContainer [2023-02-16 00:47:56,869 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-16 00:47:56,870 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-16 00:47:56,870 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-16 00:47:56,872 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-16 00:47:56,872 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.02 12:47:56" (1/3) ... [2023-02-16 00:47:56,873 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a995746 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.02 12:47:56, skipping insertion in model container [2023-02-16 00:47:56,873 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:47:56" (2/3) ... [2023-02-16 00:47:56,873 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a995746 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.02 12:47:56, skipping insertion in model container [2023-02-16 00:47:56,873 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.02 12:47:56" (3/3) ... [2023-02-16 00:47:56,874 INFO L112 eAbstractionObserver]: Analyzing ICFG dancing.i [2023-02-16 00:47:56,885 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-16 00:47:56,885 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-16 00:47:56,915 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-16 00:47:56,924 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;@504c64d1, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-16 00:47:56,924 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-16 00:47:56,927 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-16 00:47:56,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-02-16 00:47:56,935 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:47:56,935 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-16 00:47:56,936 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:47:56,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:47:56,941 INFO L85 PathProgramCache]: Analyzing trace with hash 1472755522, now seen corresponding path program 1 times [2023-02-16 00:47:56,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:47:56,947 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836413771] [2023-02-16 00:47:56,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:47:56,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:47:57,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:47:57,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 00:47:57,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:47:57,109 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-16 00:47:57,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:47:57,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836413771] [2023-02-16 00:47:57,112 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836413771] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 00:47:57,112 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 00:47:57,113 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-16 00:47:57,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796273944] [2023-02-16 00:47:57,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 00:47:57,118 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-16 00:47:57,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:47:57,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-16 00:47:57,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-16 00:47:57,146 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-16 00:47:57,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:47:57,169 INFO L93 Difference]: Finished difference Result 77 states and 107 transitions. [2023-02-16 00:47:57,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-16 00:47:57,170 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-16 00:47:57,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:47:57,174 INFO L225 Difference]: With dead ends: 77 [2023-02-16 00:47:57,175 INFO L226 Difference]: Without dead ends: 37 [2023-02-16 00:47:57,177 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-16 00:47:57,180 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-16 00:47:57,180 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-16 00:47:57,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2023-02-16 00:47:57,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2023-02-16 00:47:57,200 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-16 00:47:57,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 50 transitions. [2023-02-16 00:47:57,202 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 50 transitions. Word has length 20 [2023-02-16 00:47:57,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:47:57,202 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 50 transitions. [2023-02-16 00:47:57,202 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-16 00:47:57,202 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 50 transitions. [2023-02-16 00:47:57,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-02-16 00:47:57,203 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:47:57,203 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-16 00:47:57,204 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-16 00:47:57,204 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:47:57,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:47:57,205 INFO L85 PathProgramCache]: Analyzing trace with hash -751028367, now seen corresponding path program 1 times [2023-02-16 00:47:57,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:47:57,205 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443667100] [2023-02-16 00:47:57,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:47:57,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:47:57,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:47:57,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 00:47:57,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:47:57,352 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-16 00:47:57,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:47:57,352 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443667100] [2023-02-16 00:47:57,353 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443667100] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 00:47:57,353 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 00:47:57,353 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-16 00:47:57,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733401324] [2023-02-16 00:47:57,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 00:47:57,354 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-16 00:47:57,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:47:57,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-16 00:47:57,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-16 00:47:57,355 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-16 00:47:57,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:47:57,385 INFO L93 Difference]: Finished difference Result 45 states and 58 transitions. [2023-02-16 00:47:57,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-16 00:47:57,386 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-16 00:47:57,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:47:57,386 INFO L225 Difference]: With dead ends: 45 [2023-02-16 00:47:57,387 INFO L226 Difference]: Without dead ends: 43 [2023-02-16 00:47:57,387 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-16 00:47:57,388 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-16 00:47:57,388 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-16 00:47:57,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2023-02-16 00:47:57,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2023-02-16 00:47:57,393 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-16 00:47:57,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 55 transitions. [2023-02-16 00:47:57,394 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 55 transitions. Word has length 20 [2023-02-16 00:47:57,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:47:57,394 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 55 transitions. [2023-02-16 00:47:57,395 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-16 00:47:57,395 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 55 transitions. [2023-02-16 00:47:57,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-02-16 00:47:57,396 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:47:57,396 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-16 00:47:57,396 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-16 00:47:57,396 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:47:57,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:47:57,397 INFO L85 PathProgramCache]: Analyzing trace with hash 789210768, now seen corresponding path program 1 times [2023-02-16 00:47:57,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:47:57,397 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853245536] [2023-02-16 00:47:57,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:47:57,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:47:57,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:47:57,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 00:47:57,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:47:57,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-16 00:47:57,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:47:57,483 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-16 00:47:57,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:47:57,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853245536] [2023-02-16 00:47:57,483 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853245536] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 00:47:57,483 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 00:47:57,484 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-16 00:47:57,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805959946] [2023-02-16 00:47:57,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 00:47:57,484 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-16 00:47:57,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:47:57,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-16 00:47:57,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-16 00:47:57,485 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-16 00:47:57,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:47:57,515 INFO L93 Difference]: Finished difference Result 86 states and 116 transitions. [2023-02-16 00:47:57,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-16 00:47:57,515 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-16 00:47:57,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:47:57,516 INFO L225 Difference]: With dead ends: 86 [2023-02-16 00:47:57,516 INFO L226 Difference]: Without dead ends: 63 [2023-02-16 00:47:57,517 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-16 00:47:57,518 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-16 00:47:57,518 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-16 00:47:57,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2023-02-16 00:47:57,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 54. [2023-02-16 00:47:57,523 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-16 00:47:57,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 73 transitions. [2023-02-16 00:47:57,524 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 73 transitions. Word has length 26 [2023-02-16 00:47:57,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:47:57,525 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 73 transitions. [2023-02-16 00:47:57,525 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-16 00:47:57,525 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 73 transitions. [2023-02-16 00:47:57,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-02-16 00:47:57,526 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:47:57,526 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-16 00:47:57,526 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-16 00:47:57,526 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:47:57,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:47:57,527 INFO L85 PathProgramCache]: Analyzing trace with hash 860755832, now seen corresponding path program 1 times [2023-02-16 00:47:57,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:47:57,527 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683781795] [2023-02-16 00:47:57,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:47:57,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:47:57,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:47:57,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-02-16 00:47:57,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:47:57,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-02-16 00:47:57,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:47:57,667 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-16 00:47:57,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:47:57,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683781795] [2023-02-16 00:47:57,668 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683781795] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 00:47:57,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [725313854] [2023-02-16 00:47:57,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:47:57,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 00:47:57,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 00:47:57,671 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-16 00:47:57,672 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-16 00:47:57,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:47:57,772 INFO L263 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-16 00:47:57,777 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 00:47:57,868 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-16 00:47:57,868 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 00:47:58,013 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-16 00:47:58,013 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [725313854] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 00:47:58,014 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 00:47:58,014 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2023-02-16 00:47:58,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611907725] [2023-02-16 00:47:58,014 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 00:47:58,017 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-02-16 00:47:58,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:47:58,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-02-16 00:47:58,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2023-02-16 00:47:58,019 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-16 00:47:58,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:47:58,224 INFO L93 Difference]: Finished difference Result 118 states and 165 transitions. [2023-02-16 00:47:58,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-16 00:47:58,225 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-16 00:47:58,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:47:58,226 INFO L225 Difference]: With dead ends: 118 [2023-02-16 00:47:58,227 INFO L226 Difference]: Without dead ends: 82 [2023-02-16 00:47:58,227 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=304, Unknown=0, NotChecked=0, Total=380 [2023-02-16 00:47:58,228 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.1s IncrementalHoareTripleChecker+Time [2023-02-16 00:47:58,228 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.1s Time] [2023-02-16 00:47:58,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2023-02-16 00:47:58,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 63. [2023-02-16 00:47:58,236 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-16 00:47:58,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 88 transitions. [2023-02-16 00:47:58,237 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 88 transitions. Word has length 29 [2023-02-16 00:47:58,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:47:58,237 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 88 transitions. [2023-02-16 00:47:58,237 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-16 00:47:58,238 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 88 transitions. [2023-02-16 00:47:58,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-02-16 00:47:58,238 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:47:58,239 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-16 00:47:58,248 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-16 00:47:58,443 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-16 00:47:58,444 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:47:58,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:47:58,444 INFO L85 PathProgramCache]: Analyzing trace with hash 162961828, now seen corresponding path program 1 times [2023-02-16 00:47:58,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:47:58,445 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426479150] [2023-02-16 00:47:58,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:47:58,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:47:58,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:47:58,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-02-16 00:47:58,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:47:58,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-02-16 00:47:58,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:47:58,624 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-16 00:47:58,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:47:58,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426479150] [2023-02-16 00:47:58,625 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426479150] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 00:47:58,625 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 00:47:58,625 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-16 00:47:58,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709635545] [2023-02-16 00:47:58,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 00:47:58,626 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-16 00:47:58,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:47:58,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-16 00:47:58,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-02-16 00:47:58,628 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-16 00:47:58,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:47:58,677 INFO L93 Difference]: Finished difference Result 75 states and 105 transitions. [2023-02-16 00:47:58,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-16 00:47:58,677 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-16 00:47:58,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:47:58,680 INFO L225 Difference]: With dead ends: 75 [2023-02-16 00:47:58,680 INFO L226 Difference]: Without dead ends: 73 [2023-02-16 00:47:58,682 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-16 00:47:58,683 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-16 00:47:58,683 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-16 00:47:58,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2023-02-16 00:47:58,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 71. [2023-02-16 00:47:58,704 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-16 00:47:58,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 101 transitions. [2023-02-16 00:47:58,707 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 101 transitions. Word has length 31 [2023-02-16 00:47:58,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:47:58,707 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 101 transitions. [2023-02-16 00:47:58,708 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-16 00:47:58,708 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 101 transitions. [2023-02-16 00:47:58,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-02-16 00:47:58,711 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:47:58,712 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-16 00:47:58,712 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-02-16 00:47:58,712 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:47:58,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:47:58,712 INFO L85 PathProgramCache]: Analyzing trace with hash 786337177, now seen corresponding path program 1 times [2023-02-16 00:47:58,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:47:58,713 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969118868] [2023-02-16 00:47:58,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:47:58,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:47:58,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:47:58,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-02-16 00:47:58,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:47:58,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-02-16 00:47:58,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:47:58,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 00:47:58,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:47:58,868 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-16 00:47:58,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:47:58,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969118868] [2023-02-16 00:47:58,869 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969118868] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 00:47:58,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1413291793] [2023-02-16 00:47:58,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:47:58,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 00:47:58,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 00:47:58,870 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-16 00:47:58,873 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-16 00:47:58,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:47:58,968 INFO L263 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 48 conjunts are in the unsatisfiable core [2023-02-16 00:47:58,971 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 00:47:59,016 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:47:59,023 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-16 00:47:59,032 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:47:59,033 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-16 00:47:59,043 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:47:59,045 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-16 00:47:59,051 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:47:59,053 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-16 00:47:59,171 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-16 00:47:59,175 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-16 00:47:59,191 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-16 00:47:59,192 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 00:47:59,237 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-16 00:47:59,339 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 00:47:59,339 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-16 00:47:59,343 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-16 00:47:59,346 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-16 00:47:59,351 INFO L321 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2023-02-16 00:47:59,351 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-16 00:47:59,373 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-16 00:47:59,374 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1413291793] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 00:47:59,374 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 00:47:59,374 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8, 7] total 16 [2023-02-16 00:47:59,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259516351] [2023-02-16 00:47:59,374 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 00:47:59,375 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-02-16 00:47:59,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:47:59,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-02-16 00:47:59,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2023-02-16 00:47:59,383 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-16 00:48:00,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:48:00,147 INFO L93 Difference]: Finished difference Result 326 states and 477 transitions. [2023-02-16 00:48:00,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-02-16 00:48:00,147 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-16 00:48:00,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:48:00,150 INFO L225 Difference]: With dead ends: 326 [2023-02-16 00:48:00,150 INFO L226 Difference]: Without dead ends: 253 [2023-02-16 00:48:00,151 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-16 00:48:00,151 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.4s IncrementalHoareTripleChecker+Time [2023-02-16 00:48:00,151 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.4s Time] [2023-02-16 00:48:00,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2023-02-16 00:48:00,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 136. [2023-02-16 00:48:00,193 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-16 00:48:00,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 189 transitions. [2023-02-16 00:48:00,194 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 189 transitions. Word has length 37 [2023-02-16 00:48:00,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:48:00,194 INFO L495 AbstractCegarLoop]: Abstraction has 136 states and 189 transitions. [2023-02-16 00:48:00,194 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-16 00:48:00,194 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 189 transitions. [2023-02-16 00:48:00,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-02-16 00:48:00,195 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:48:00,196 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-16 00:48:00,217 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-02-16 00:48:00,401 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-16 00:48:00,402 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:48:00,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:48:00,405 INFO L85 PathProgramCache]: Analyzing trace with hash -1693334873, now seen corresponding path program 1 times [2023-02-16 00:48:00,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:48:00,405 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232059287] [2023-02-16 00:48:00,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:48:00,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:48:00,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:48:00,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 00:48:00,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:48:00,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-16 00:48:00,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:48:00,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-02-16 00:48:00,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:48:00,610 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-16 00:48:00,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:48:00,611 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232059287] [2023-02-16 00:48:00,611 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232059287] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 00:48:00,611 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 00:48:00,611 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-16 00:48:00,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943012503] [2023-02-16 00:48:00,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 00:48:00,612 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-16 00:48:00,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:48:00,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-16 00:48:00,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-16 00:48:00,612 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-16 00:48:00,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:48:00,698 INFO L93 Difference]: Finished difference Result 179 states and 245 transitions. [2023-02-16 00:48:00,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-16 00:48:00,699 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-16 00:48:00,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:48:00,701 INFO L225 Difference]: With dead ends: 179 [2023-02-16 00:48:00,701 INFO L226 Difference]: Without dead ends: 148 [2023-02-16 00:48:00,701 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-16 00:48:00,702 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.0s IncrementalHoareTripleChecker+Time [2023-02-16 00:48:00,702 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.0s Time] [2023-02-16 00:48:00,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2023-02-16 00:48:00,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 138. [2023-02-16 00:48:00,717 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-16 00:48:00,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 191 transitions. [2023-02-16 00:48:00,719 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 191 transitions. Word has length 35 [2023-02-16 00:48:00,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:48:00,719 INFO L495 AbstractCegarLoop]: Abstraction has 138 states and 191 transitions. [2023-02-16 00:48:00,719 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-16 00:48:00,719 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 191 transitions. [2023-02-16 00:48:00,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-02-16 00:48:00,722 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:48:00,722 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-16 00:48:00,722 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-02-16 00:48:00,722 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:48:00,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:48:00,723 INFO L85 PathProgramCache]: Analyzing trace with hash -1474480155, now seen corresponding path program 1 times [2023-02-16 00:48:00,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:48:00,723 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755842316] [2023-02-16 00:48:00,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:48:00,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:48:00,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:48:00,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 00:48:00,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:48:00,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-16 00:48:00,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:48:00,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-02-16 00:48:00,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:48:00,812 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-16 00:48:00,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:48:00,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755842316] [2023-02-16 00:48:00,813 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755842316] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 00:48:00,813 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 00:48:00,813 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-16 00:48:00,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863562004] [2023-02-16 00:48:00,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 00:48:00,813 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-16 00:48:00,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:48:00,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-16 00:48:00,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-16 00:48:00,814 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-16 00:48:00,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:48:00,843 INFO L93 Difference]: Finished difference Result 150 states and 202 transitions. [2023-02-16 00:48:00,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-16 00:48:00,843 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-16 00:48:00,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:48:00,845 INFO L225 Difference]: With dead ends: 150 [2023-02-16 00:48:00,846 INFO L226 Difference]: Without dead ends: 138 [2023-02-16 00:48:00,846 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-16 00:48:00,847 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-16 00:48:00,847 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-16 00:48:00,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2023-02-16 00:48:00,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 114. [2023-02-16 00:48:00,860 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-16 00:48:00,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 155 transitions. [2023-02-16 00:48:00,861 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 155 transitions. Word has length 35 [2023-02-16 00:48:00,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:48:00,861 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 155 transitions. [2023-02-16 00:48:00,861 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-16 00:48:00,861 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 155 transitions. [2023-02-16 00:48:00,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-02-16 00:48:00,862 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:48:00,862 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-16 00:48:00,862 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-02-16 00:48:00,862 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:48:00,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:48:00,863 INFO L85 PathProgramCache]: Analyzing trace with hash 1846747895, now seen corresponding path program 1 times [2023-02-16 00:48:00,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:48:00,863 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261694821] [2023-02-16 00:48:00,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:48:00,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:48:00,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:48:00,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 00:48:00,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:48:00,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-16 00:48:00,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:48:00,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-02-16 00:48:00,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:48:00,934 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-16 00:48:00,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:48:00,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261694821] [2023-02-16 00:48:00,935 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261694821] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 00:48:00,935 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 00:48:00,935 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-16 00:48:00,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689054695] [2023-02-16 00:48:00,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 00:48:00,936 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-16 00:48:00,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:48:00,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-16 00:48:00,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-16 00:48:00,937 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-16 00:48:00,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:48:00,981 INFO L93 Difference]: Finished difference Result 202 states and 267 transitions. [2023-02-16 00:48:00,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-16 00:48:00,982 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-16 00:48:00,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:48:00,983 INFO L225 Difference]: With dead ends: 202 [2023-02-16 00:48:00,983 INFO L226 Difference]: Without dead ends: 94 [2023-02-16 00:48:00,984 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-16 00:48:00,984 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-16 00:48:00,984 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-16 00:48:00,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2023-02-16 00:48:00,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 92. [2023-02-16 00:48:00,991 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-16 00:48:00,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 122 transitions. [2023-02-16 00:48:00,992 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 122 transitions. Word has length 36 [2023-02-16 00:48:00,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:48:00,992 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 122 transitions. [2023-02-16 00:48:00,992 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-16 00:48:00,993 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 122 transitions. [2023-02-16 00:48:00,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-02-16 00:48:00,993 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:48:00,993 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-16 00:48:00,993 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-02-16 00:48:00,993 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:48:00,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:48:00,994 INFO L85 PathProgramCache]: Analyzing trace with hash -1426728412, now seen corresponding path program 1 times [2023-02-16 00:48:00,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:48:00,994 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897332331] [2023-02-16 00:48:00,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:48:00,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:48:01,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:48:01,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-16 00:48:01,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:48:01,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 00:48:01,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:48:01,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-02-16 00:48:01,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:48:01,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 00:48:01,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:48:01,373 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-16 00:48:01,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:48:01,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897332331] [2023-02-16 00:48:01,374 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897332331] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 00:48:01,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1640029476] [2023-02-16 00:48:01,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:48:01,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 00:48:01,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 00:48:01,375 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-16 00:48:01,387 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-16 00:48:01,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:48:01,492 INFO L263 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 39 conjunts are in the unsatisfiable core [2023-02-16 00:48:01,495 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 00:48:01,510 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-16 00:48:01,548 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-16 00:48:01,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 11 treesize of output 11 [2023-02-16 00:48:01,584 INFO L321 Elim1Store]: treesize reduction 30, result has 38.8 percent of original size [2023-02-16 00:48:01,585 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-16 00:48:01,600 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-16 00:48:01,608 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-16 00:48:01,664 INFO L321 Elim1Store]: treesize reduction 35, result has 2.8 percent of original size [2023-02-16 00:48:01,665 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-16 00:48:01,667 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-16 00:48:01,850 WARN L859 $PredicateComparison]: unable to prove that (or (exists ((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 (exists ((v_DerPreprocessor_1 (Array Int Int))) (= 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))))) (exists ((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 ((.cse4 (+ |v_ULTIMATE.start_main_~#list~0#1.offset_BEFORE_CALL_1| 4))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~#list~0#1.base_BEFORE_CALL_3|) .cse4))) (and (exists ((v_DerPreprocessor_1 (Array Int Int))) (let ((.cse2 (select (store (store (store (store |c_#memory_$Pointer$.base| .cse3 v_DerPreprocessor_1) |v_ULTIMATE.start_main_~#list~0#1.base_BEFORE_CALL_3| v_DerPreprocessor_2) .cse3 v_DerPreprocessor_1) |v_ULTIMATE.start_main_~#list~0#1.base_BEFORE_CALL_3| v_DerPreprocessor_2) .cse3))) (and (= v_DerPreprocessor_1 .cse2) (= .cse2 (select |c_#memory_$Pointer$.base| .cse3))))) (= (select v_DerPreprocessor_2 .cse4) .cse3)))))) is different from true [2023-02-16 00:48:04,448 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-16 00:48:04,448 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 00:48:04,664 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 00:48:04,664 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-16 00:48:04,667 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-16 00:48:04,672 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-16 00:48:04,712 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-16 00:48:04,716 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-16 00:48:04,723 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-16 00:48:04,728 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-16 00:48:04,823 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-16 00:48:04,824 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1640029476] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 00:48:04,824 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 00:48:04,824 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 12] total 32 [2023-02-16 00:48:04,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640229176] [2023-02-16 00:48:04,824 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 00:48:04,824 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-02-16 00:48:04,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:48:04,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-02-16 00:48:04,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=843, Unknown=6, NotChecked=58, Total=992 [2023-02-16 00:48:04,825 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-16 00:48:08,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:48:08,619 INFO L93 Difference]: Finished difference Result 194 states and 266 transitions. [2023-02-16 00:48:08,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2023-02-16 00:48:08,620 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-16 00:48:08,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:48:08,621 INFO L225 Difference]: With dead ends: 194 [2023-02-16 00:48:08,621 INFO L226 Difference]: Without dead ends: 118 [2023-02-16 00:48:08,622 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 80 SyntacticMatches, 2 SemanticMatches, 60 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 532 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=583, Invalid=3032, Unknown=49, NotChecked=118, Total=3782 [2023-02-16 00:48:08,622 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 298 mSDsluCounter, 673 mSDsCounter, 0 mSdLazyCounter, 924 mSolverCounterSat, 127 mSolverCounterUnsat, 42 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 726 SdHoareTripleChecker+Invalid, 1220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 924 IncrementalHoareTripleChecker+Invalid, 42 IncrementalHoareTripleChecker+Unknown, 127 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-02-16 00:48:08,622 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [298 Valid, 726 Invalid, 1220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 924 Invalid, 42 Unknown, 127 Unchecked, 1.2s Time] [2023-02-16 00:48:08,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2023-02-16 00:48:08,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 80. [2023-02-16 00:48:08,628 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-16 00:48:08,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 105 transitions. [2023-02-16 00:48:08,631 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 105 transitions. Word has length 46 [2023-02-16 00:48:08,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:48:08,632 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 105 transitions. [2023-02-16 00:48:08,632 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-16 00:48:08,632 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 105 transitions. [2023-02-16 00:48:08,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-02-16 00:48:08,633 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:48:08,633 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-16 00:48:08,652 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-16 00:48:08,841 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-16 00:48:08,841 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:48:08,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:48:08,842 INFO L85 PathProgramCache]: Analyzing trace with hash 803799756, now seen corresponding path program 1 times [2023-02-16 00:48:08,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:48:08,842 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529876454] [2023-02-16 00:48:08,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:48:08,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:48:08,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:48:09,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-02-16 00:48:09,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:48:09,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 00:48:09,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:48:09,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-02-16 00:48:09,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:48:09,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 00:48:09,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:48:09,425 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-16 00:48:09,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:48:09,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529876454] [2023-02-16 00:48:09,426 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529876454] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 00:48:09,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1275908465] [2023-02-16 00:48:09,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:48:09,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 00:48:09,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 00:48:09,428 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-16 00:48:09,457 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-16 00:48:09,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:48:09,526 INFO L263 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 91 conjunts are in the unsatisfiable core [2023-02-16 00:48:09,528 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 00:48:09,577 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:48:09,578 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-16 00:48:09,581 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:48:09,581 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-16 00:48:09,587 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:48:09,587 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-16 00:48:09,590 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:48:09,590 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-16 00:48:10,116 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 00:48:10,122 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-02-16 00:48:10,123 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-16 00:48:10,126 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-16 00:48:10,521 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-16 00:48:10,521 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 00:48:10,925 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1275908465] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 00:48:10,926 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 00:48:10,926 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 21] total 37 [2023-02-16 00:48:10,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845038956] [2023-02-16 00:48:10,926 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 00:48:10,926 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2023-02-16 00:48:10,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:48:10,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2023-02-16 00:48:10,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=1743, Unknown=0, NotChecked=0, Total=1892 [2023-02-16 00:48:10,927 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-16 00:48:13,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:48:13,846 INFO L93 Difference]: Finished difference Result 228 states and 297 transitions. [2023-02-16 00:48:13,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2023-02-16 00:48:13,846 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-16 00:48:13,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:48:13,847 INFO L225 Difference]: With dead ends: 228 [2023-02-16 00:48:13,847 INFO L226 Difference]: Without dead ends: 150 [2023-02-16 00:48:13,849 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 58 SyntacticMatches, 2 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1670 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=879, Invalid=6093, Unknown=0, NotChecked=0, Total=6972 [2023-02-16 00:48:13,850 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 294 mSDsluCounter, 667 mSDsCounter, 0 mSdLazyCounter, 1098 mSolverCounterSat, 164 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s 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.0s IncrementalHoareTripleChecker+Time [2023-02-16 00:48:13,850 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.0s Time] [2023-02-16 00:48:13,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2023-02-16 00:48:13,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 133. [2023-02-16 00:48:13,860 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-16 00:48:13,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 168 transitions. [2023-02-16 00:48:13,861 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 168 transitions. Word has length 43 [2023-02-16 00:48:13,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:48:13,861 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 168 transitions. [2023-02-16 00:48:13,862 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-16 00:48:13,862 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 168 transitions. [2023-02-16 00:48:13,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-02-16 00:48:13,862 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:48:13,862 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-16 00:48:13,868 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-16 00:48:14,068 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-16 00:48:14,068 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:48:14,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:48:14,068 INFO L85 PathProgramCache]: Analyzing trace with hash 828672736, now seen corresponding path program 1 times [2023-02-16 00:48:14,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:48:14,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782962719] [2023-02-16 00:48:14,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:48:14,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:48:14,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:48:14,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-02-16 00:48:14,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:48:14,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 00:48:14,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:48:14,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-02-16 00:48:14,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:48:14,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 00:48:14,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:48:14,184 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-16 00:48:14,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:48:14,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782962719] [2023-02-16 00:48:14,184 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782962719] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 00:48:14,184 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 00:48:14,185 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-02-16 00:48:14,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391804730] [2023-02-16 00:48:14,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 00:48:14,186 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-16 00:48:14,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:48:14,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-16 00:48:14,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-02-16 00:48:14,187 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-16 00:48:14,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:48:14,234 INFO L93 Difference]: Finished difference Result 168 states and 214 transitions. [2023-02-16 00:48:14,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-16 00:48:14,234 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-16 00:48:14,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:48:14,236 INFO L225 Difference]: With dead ends: 168 [2023-02-16 00:48:14,236 INFO L226 Difference]: Without dead ends: 166 [2023-02-16 00:48:14,236 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-16 00:48:14,237 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-16 00:48:14,237 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-16 00:48:14,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2023-02-16 00:48:14,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 138. [2023-02-16 00:48:14,249 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-16 00:48:14,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 174 transitions. [2023-02-16 00:48:14,249 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 174 transitions. Word has length 44 [2023-02-16 00:48:14,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:48:14,250 INFO L495 AbstractCegarLoop]: Abstraction has 138 states and 174 transitions. [2023-02-16 00:48:14,250 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-16 00:48:14,250 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 174 transitions. [2023-02-16 00:48:14,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-02-16 00:48:14,251 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:48:14,251 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-16 00:48:14,251 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-02-16 00:48:14,251 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:48:14,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:48:14,252 INFO L85 PathProgramCache]: Analyzing trace with hash 1865771786, now seen corresponding path program 1 times [2023-02-16 00:48:14,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:48:14,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523327833] [2023-02-16 00:48:14,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:48:14,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:48:14,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:48:14,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-02-16 00:48:14,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:48:14,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 00:48:14,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:48:14,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-02-16 00:48:14,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:48:14,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-02-16 00:48:14,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:48:14,354 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-16 00:48:14,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:48:14,354 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523327833] [2023-02-16 00:48:14,354 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523327833] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 00:48:14,354 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [217293182] [2023-02-16 00:48:14,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:48:14,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 00:48:14,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 00:48:14,355 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-16 00:48:14,357 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-16 00:48:14,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:48:14,451 INFO L263 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-16 00:48:14,453 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 00:48:14,485 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-16 00:48:14,485 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 00:48:14,524 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-16 00:48:14,524 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [217293182] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 00:48:14,524 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 00:48:14,524 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2023-02-16 00:48:14,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972207261] [2023-02-16 00:48:14,524 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 00:48:14,525 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-16 00:48:14,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:48:14,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-16 00:48:14,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2023-02-16 00:48:14,525 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-16 00:48:14,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:48:14,673 INFO L93 Difference]: Finished difference Result 209 states and 258 transitions. [2023-02-16 00:48:14,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-16 00:48:14,673 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-16 00:48:14,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:48:14,674 INFO L225 Difference]: With dead ends: 209 [2023-02-16 00:48:14,674 INFO L226 Difference]: Without dead ends: 141 [2023-02-16 00:48:14,674 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-16 00:48:14,675 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-16 00:48:14,675 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-16 00:48:14,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2023-02-16 00:48:14,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 140. [2023-02-16 00:48:14,691 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-16 00:48:14,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 174 transitions. [2023-02-16 00:48:14,693 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 174 transitions. Word has length 46 [2023-02-16 00:48:14,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:48:14,693 INFO L495 AbstractCegarLoop]: Abstraction has 140 states and 174 transitions. [2023-02-16 00:48:14,693 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-16 00:48:14,693 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 174 transitions. [2023-02-16 00:48:14,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2023-02-16 00:48:14,694 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:48:14,694 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-16 00:48:14,699 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-16 00:48:14,894 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-16 00:48:14,894 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:48:14,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:48:14,895 INFO L85 PathProgramCache]: Analyzing trace with hash 191887930, now seen corresponding path program 1 times [2023-02-16 00:48:14,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:48:14,895 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143478750] [2023-02-16 00:48:14,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:48:14,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:48:14,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:48:14,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-16 00:48:14,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:48:14,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 00:48:14,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:48:14,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-02-16 00:48:14,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:48:14,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 00:48:14,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:48:15,000 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-16 00:48:15,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:48:15,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143478750] [2023-02-16 00:48:15,000 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143478750] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 00:48:15,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1612122170] [2023-02-16 00:48:15,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:48:15,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 00:48:15,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 00:48:15,002 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-16 00:48:15,036 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-16 00:48:15,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:48:15,154 INFO L263 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 123 conjunts are in the unsatisfiable core [2023-02-16 00:48:15,157 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 00:48:15,192 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:48:15,193 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 00:48:15,194 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-16 00:48:15,196 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:48:15,197 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-16 00:48:15,207 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:48:15,208 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-16 00:48:15,211 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:48:15,212 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-16 00:48:15,317 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:48:15,352 INFO L321 Elim1Store]: treesize reduction 67, result has 29.5 percent of original size [2023-02-16 00:48:15,352 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-16 00:48:15,357 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:48:15,358 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:48:15,359 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 00:48:15,384 INFO L321 Elim1Store]: treesize reduction 82, result has 27.4 percent of original size [2023-02-16 00:48:15,384 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-16 00:48:15,390 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-16 00:48:15,397 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-16 00:48:15,411 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-16 00:48:15,472 INFO L321 Elim1Store]: treesize reduction 31, result has 3.1 percent of original size [2023-02-16 00:48:15,473 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-16 00:48:15,475 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-16 00:48:16,909 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:48:16,910 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:48:16,911 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 00:48:16,914 INFO L321 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2023-02-16 00:48:16,914 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-16 00:48:16,922 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:48:16,923 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:48:16,930 INFO L321 Elim1Store]: treesize reduction 9, result has 47.1 percent of original size [2023-02-16 00:48:16,930 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-16 00:48:16,934 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-16 00:48:16,947 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-16 00:48:16,950 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-16 00:48:16,952 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-16 00:48:16,959 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-16 00:48:16,985 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-16 00:48:16,986 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 00:48:17,021 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-16 00:48:37,431 WARN L233 SmtUtils]: Spent 20.03s on a formula simplification that was a NOOP. DAG size: 31 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-16 00:48:57,529 WARN L233 SmtUtils]: Spent 20.04s on a formula simplification that was a NOOP. DAG size: 39 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-16 00:48:57,728 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-16 00:48:57,776 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-16 00:48:57,833 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-16 00:48:57,861 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 00:48:57,862 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-16 00:48:57,871 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 00:48:57,871 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-16 00:48:57,885 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 00:48:57,885 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 1424 treesize of output 1336 [2023-02-16 00:48:57,897 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 00:48:57,897 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 2187 treesize of output 2027 [2023-02-16 00:48:57,908 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 00:48:57,908 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 2019 treesize of output 1947