./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-56.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4f9af400 extending candidate: java ['java'] extending candidate: /usr/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/oracle-jdk-bin-*/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/openjdk-*/bin/java ['java', '/usr/bin/java'] extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java ['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java'] ['/root/.sdkman/candidates/java/21.0.5-tem/bin/java', '-Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config', '-Xmx15G', '-Xms4m', '-jar', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar', '-data', '@noDefault', '-ultimatedata', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data', '-tc', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml', '-i', '../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-56.i', '-s', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf', '--cacsl2boogietranslator.entry.function', 'main', '--witnessprinter.witness.directory', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux', '--witnessprinter.witness.filename', 'witness', '--witnessprinter.write.witness.besides.input.file', 'false', '--witnessprinter.graph.data.specification', 'CHECK( init(main()), LTL(G ! call(reach_error())) )\n\n', '--witnessprinter.graph.data.producer', 'Automizer', '--witnessprinter.graph.data.architecture', '32bit', '--witnessprinter.graph.data.programhash', '10471332ed8d2599b04e210a8f5e1cfca6044f5eaf06c2a8c3075acc10d9721c'] Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-56.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --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 10471332ed8d2599b04e210a8f5e1cfca6044f5eaf06c2a8c3075acc10d9721c --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 10:25:31,432 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 10:25:31,507 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-07 10:25:31,514 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 10:25:31,514 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 10:25:31,530 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 10:25:31,531 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 10:25:31,531 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 10:25:31,531 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 10:25:31,532 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 10:25:31,532 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 10:25:31,532 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 10:25:31,532 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 10:25:31,532 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 10:25:31,532 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 10:25:31,532 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 10:25:31,532 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 10:25:31,532 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 10:25:31,533 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 10:25:31,533 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 10:25:31,533 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 10:25:31,533 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 10:25:31,533 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 10:25:31,533 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 10:25:31,533 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 10:25:31,533 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 10:25:31,533 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 10:25:31,533 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 10:25:31,534 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 10:25:31,534 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 10:25:31,534 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 10:25:31,534 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 10:25:31,534 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 10:25:31,534 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 10:25:31,534 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 10:25:31,534 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 10:25:31,534 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 10:25:31,534 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 10:25:31,534 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 10:25:31,535 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 10:25:31,535 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 10:25:31,535 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 10:25:31,535 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> 10471332ed8d2599b04e210a8f5e1cfca6044f5eaf06c2a8c3075acc10d9721c [2024-11-07 10:25:31,769 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 10:25:31,775 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 10:25:31,776 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 10:25:31,777 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 10:25:31,778 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 10:25:31,779 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-56.i [2024-11-07 10:25:32,895 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 10:25:33,140 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 10:25:33,141 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-56.i [2024-11-07 10:25:33,149 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d1bde5e0a/689e39b6a9c049ababcba169d2dec1d2/FLAG6353434c0 [2024-11-07 10:25:33,464 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d1bde5e0a/689e39b6a9c049ababcba169d2dec1d2 [2024-11-07 10:25:33,466 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 10:25:33,466 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 10:25:33,467 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 10:25:33,467 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 10:25:33,470 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 10:25:33,471 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:25:33" (1/1) ... [2024-11-07 10:25:33,471 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e2aa4a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:25:33, skipping insertion in model container [2024-11-07 10:25:33,471 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:25:33" (1/1) ... [2024-11-07 10:25:33,486 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 10:25:33,583 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-56.i[917,930] [2024-11-07 10:25:33,629 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 10:25:33,636 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 10:25:33,644 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-56.i[917,930] [2024-11-07 10:25:33,678 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 10:25:33,692 INFO L204 MainTranslator]: Completed translation [2024-11-07 10:25:33,692 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:25:33 WrapperNode [2024-11-07 10:25:33,693 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 10:25:33,694 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 10:25:33,694 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 10:25:33,694 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 10:25:33,698 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:25:33" (1/1) ... [2024-11-07 10:25:33,712 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:25:33" (1/1) ... [2024-11-07 10:25:33,756 INFO L138 Inliner]: procedures = 29, calls = 181, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 589 [2024-11-07 10:25:33,756 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 10:25:33,757 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 10:25:33,757 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 10:25:33,757 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 10:25:33,766 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:25:33" (1/1) ... [2024-11-07 10:25:33,770 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:25:33" (1/1) ... [2024-11-07 10:25:33,778 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:25:33" (1/1) ... [2024-11-07 10:25:33,798 INFO L175 MemorySlicer]: Split 147 memory accesses to 5 slices as follows [2, 41, 11, 16, 77]. 52 percent of accesses are in the largest equivalence class. The 16 initializations are split as follows [2, 5, 2, 1, 6]. The 18 writes are split as follows [0, 8, 2, 1, 7]. [2024-11-07 10:25:33,799 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:25:33" (1/1) ... [2024-11-07 10:25:33,799 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:25:33" (1/1) ... [2024-11-07 10:25:33,815 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:25:33" (1/1) ... [2024-11-07 10:25:33,822 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:25:33" (1/1) ... [2024-11-07 10:25:33,827 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:25:33" (1/1) ... [2024-11-07 10:25:33,833 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:25:33" (1/1) ... [2024-11-07 10:25:33,841 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 10:25:33,841 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 10:25:33,845 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 10:25:33,845 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 10:25:33,846 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:25:33" (1/1) ... [2024-11-07 10:25:33,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 10:25:33,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 10:25:33,872 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-07 10:25:33,874 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-07 10:25:33,894 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 10:25:33,894 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-11-07 10:25:33,894 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-11-07 10:25:33,894 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-11-07 10:25:33,894 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-11-07 10:25:33,894 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-11-07 10:25:33,894 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-07 10:25:33,894 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-07 10:25:33,894 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-07 10:25:33,894 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-07 10:25:33,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-07 10:25:33,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-11-07 10:25:33,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-11-07 10:25:33,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-11-07 10:25:33,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-11-07 10:25:33,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-11-07 10:25:33,895 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-07 10:25:33,896 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-07 10:25:33,896 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-07 10:25:33,896 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-07 10:25:33,896 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-07 10:25:33,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-11-07 10:25:33,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-11-07 10:25:33,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-11-07 10:25:33,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-11-07 10:25:33,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-11-07 10:25:33,897 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 10:25:33,897 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 10:25:33,897 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 10:25:33,897 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-07 10:25:33,897 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-07 10:25:33,897 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-07 10:25:33,897 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-07 10:25:33,897 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 10:25:33,898 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 10:25:34,000 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 10:25:34,002 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 10:25:34,493 INFO L? ?]: Removed 158 outVars from TransFormulas that were not future-live. [2024-11-07 10:25:34,494 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 10:25:34,500 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 10:25:34,501 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 10:25:34,501 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:25:34 BoogieIcfgContainer [2024-11-07 10:25:34,501 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 10:25:34,503 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 10:25:34,503 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 10:25:34,506 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 10:25:34,506 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 10:25:33" (1/3) ... [2024-11-07 10:25:34,507 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29b8a8f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:25:34, skipping insertion in model container [2024-11-07 10:25:34,507 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:25:33" (2/3) ... [2024-11-07 10:25:34,507 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29b8a8f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:25:34, skipping insertion in model container [2024-11-07 10:25:34,507 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:25:34" (3/3) ... [2024-11-07 10:25:34,508 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-ap_file-56.i [2024-11-07 10:25:34,517 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 10:25:34,518 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 10:25:34,556 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 10:25:34,562 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@6cd4e51a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 10:25:34,563 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 10:25:34,565 INFO L276 IsEmpty]: Start isEmpty. Operand has 126 states, 104 states have (on average 1.4326923076923077) internal successors, (149), 105 states have internal predecessors, (149), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-07 10:25:34,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-07 10:25:34,573 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:25:34,573 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:25:34,573 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:25:34,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:25:34,576 INFO L85 PathProgramCache]: Analyzing trace with hash -70143542, now seen corresponding path program 1 times [2024-11-07 10:25:34,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:25:34,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191109976] [2024-11-07 10:25:34,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:25:34,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:25:34,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:34,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:25:34,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:34,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:25:34,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:34,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:25:34,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:34,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:25:34,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:34,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:25:34,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:34,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:25:34,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:34,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:25:34,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:34,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:25:34,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:34,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 10:25:34,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:34,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 10:25:34,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:34,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 10:25:34,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:34,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 10:25:34,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:34,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-07 10:25:34,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:34,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-07 10:25:34,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:34,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 10:25:34,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:34,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 10:25:34,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:34,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 10:25:34,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:34,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 10:25:34,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:34,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-07 10:25:34,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:34,911 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-07 10:25:34,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:25:34,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191109976] [2024-11-07 10:25:34,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191109976] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:25:34,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:25:34,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 10:25:34,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771322291] [2024-11-07 10:25:34,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:25:34,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 10:25:34,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:25:34,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 10:25:34,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 10:25:34,931 INFO L87 Difference]: Start difference. First operand has 126 states, 104 states have (on average 1.4326923076923077) internal successors, (149), 105 states have internal predecessors, (149), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-07 10:25:34,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:25:34,953 INFO L93 Difference]: Finished difference Result 245 states and 387 transitions. [2024-11-07 10:25:34,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 10:25:34,955 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 151 [2024-11-07 10:25:34,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:25:34,960 INFO L225 Difference]: With dead ends: 245 [2024-11-07 10:25:34,960 INFO L226 Difference]: Without dead ends: 122 [2024-11-07 10:25:34,965 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 10:25:34,967 INFO L432 NwaCegarLoop]: 180 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, 180 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 [2024-11-07 10:25:34,967 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 10:25:34,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-11-07 10:25:34,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2024-11-07 10:25:34,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 101 states have (on average 1.4059405940594059) internal successors, (142), 101 states have internal predecessors, (142), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-07 10:25:34,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 180 transitions. [2024-11-07 10:25:34,994 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 180 transitions. Word has length 151 [2024-11-07 10:25:34,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:25:34,995 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 180 transitions. [2024-11-07 10:25:34,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-07 10:25:34,995 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 180 transitions. [2024-11-07 10:25:34,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-07 10:25:34,997 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:25:34,997 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:25:34,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 10:25:34,997 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:25:34,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:25:34,998 INFO L85 PathProgramCache]: Analyzing trace with hash 155255632, now seen corresponding path program 1 times [2024-11-07 10:25:34,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:25:34,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736013374] [2024-11-07 10:25:34,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:25:34,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:25:35,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:35,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:25:35,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:35,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:25:35,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:35,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:25:35,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:35,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:25:35,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:35,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:25:35,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:35,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:25:35,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:35,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:25:35,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:35,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:25:35,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:35,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 10:25:35,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:35,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 10:25:35,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:35,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 10:25:35,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:35,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 10:25:35,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:35,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-07 10:25:35,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:35,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-07 10:25:35,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:35,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 10:25:35,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:35,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 10:25:35,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:35,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 10:25:35,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:35,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 10:25:35,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:35,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-07 10:25:35,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:35,234 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-07 10:25:35,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:25:35,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736013374] [2024-11-07 10:25:35,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736013374] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:25:35,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:25:35,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 10:25:35,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394884119] [2024-11-07 10:25:35,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:25:35,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 10:25:35,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:25:35,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 10:25:35,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 10:25:35,237 INFO L87 Difference]: Start difference. First operand 122 states and 180 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-07 10:25:35,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:25:35,267 INFO L93 Difference]: Finished difference Result 242 states and 359 transitions. [2024-11-07 10:25:35,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 10:25:35,268 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 151 [2024-11-07 10:25:35,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:25:35,272 INFO L225 Difference]: With dead ends: 242 [2024-11-07 10:25:35,272 INFO L226 Difference]: Without dead ends: 123 [2024-11-07 10:25:35,272 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 10:25:35,273 INFO L432 NwaCegarLoop]: 179 mSDtfsCounter, 0 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 10:25:35,273 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 352 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 10:25:35,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-11-07 10:25:35,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2024-11-07 10:25:35,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 102 states have (on average 1.4019607843137254) internal successors, (143), 102 states have internal predecessors, (143), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-07 10:25:35,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 181 transitions. [2024-11-07 10:25:35,287 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 181 transitions. Word has length 151 [2024-11-07 10:25:35,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:25:35,288 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 181 transitions. [2024-11-07 10:25:35,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-07 10:25:35,288 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 181 transitions. [2024-11-07 10:25:35,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-07 10:25:35,290 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:25:35,290 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:25:35,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 10:25:35,290 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:25:35,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:25:35,291 INFO L85 PathProgramCache]: Analyzing trace with hash -662392818, now seen corresponding path program 1 times [2024-11-07 10:25:35,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:25:35,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735855014] [2024-11-07 10:25:35,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:25:35,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:25:35,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:36,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:25:36,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:36,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:25:36,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:36,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:25:36,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:36,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:25:36,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:36,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:25:36,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:36,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:25:36,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:36,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:25:36,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:36,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:25:36,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:36,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 10:25:36,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:36,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 10:25:36,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:36,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 10:25:36,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:36,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 10:25:36,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:36,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-07 10:25:36,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:36,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-07 10:25:36,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:36,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 10:25:36,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:36,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 10:25:36,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:36,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 10:25:36,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:36,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 10:25:36,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:36,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-07 10:25:36,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:36,836 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-07 10:25:36,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:25:36,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735855014] [2024-11-07 10:25:36,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735855014] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:25:36,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:25:36,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-07 10:25:36,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694737080] [2024-11-07 10:25:36,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:25:36,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-07 10:25:36,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:25:36,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-07 10:25:36,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2024-11-07 10:25:36,838 INFO L87 Difference]: Start difference. First operand 123 states and 181 transitions. Second operand has 16 states, 16 states have (on average 3.6875) internal successors, (59), 16 states have internal predecessors, (59), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-07 10:25:38,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:25:38,250 INFO L93 Difference]: Finished difference Result 725 states and 1076 transitions. [2024-11-07 10:25:38,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-07 10:25:38,251 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.6875) internal successors, (59), 16 states have internal predecessors, (59), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 151 [2024-11-07 10:25:38,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:25:38,254 INFO L225 Difference]: With dead ends: 725 [2024-11-07 10:25:38,254 INFO L226 Difference]: Without dead ends: 605 [2024-11-07 10:25:38,258 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=221, Invalid=771, Unknown=0, NotChecked=0, Total=992 [2024-11-07 10:25:38,258 INFO L432 NwaCegarLoop]: 267 mSDtfsCounter, 939 mSDsluCounter, 2497 mSDsCounter, 0 mSdLazyCounter, 1478 mSolverCounterSat, 153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 939 SdHoareTripleChecker+Valid, 2764 SdHoareTripleChecker+Invalid, 1631 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 153 IncrementalHoareTripleChecker+Valid, 1478 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-07 10:25:38,259 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [939 Valid, 2764 Invalid, 1631 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [153 Valid, 1478 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-07 10:25:38,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2024-11-07 10:25:38,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 382. [2024-11-07 10:25:38,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 382 states, 331 states have (on average 1.4501510574018126) internal successors, (480), 332 states have internal predecessors, (480), 47 states have call successors, (47), 3 states have call predecessors, (47), 3 states have return successors, (47), 46 states have call predecessors, (47), 47 states have call successors, (47) [2024-11-07 10:25:38,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 574 transitions. [2024-11-07 10:25:38,309 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 574 transitions. Word has length 151 [2024-11-07 10:25:38,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:25:38,312 INFO L471 AbstractCegarLoop]: Abstraction has 382 states and 574 transitions. [2024-11-07 10:25:38,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.6875) internal successors, (59), 16 states have internal predecessors, (59), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-07 10:25:38,313 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 574 transitions. [2024-11-07 10:25:38,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-07 10:25:38,314 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:25:38,314 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:25:38,315 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 10:25:38,315 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:25:38,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:25:38,317 INFO L85 PathProgramCache]: Analyzing trace with hash 439138535, now seen corresponding path program 1 times [2024-11-07 10:25:38,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:25:38,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174846350] [2024-11-07 10:25:38,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:25:38,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:25:38,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:38,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:25:38,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:38,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:25:38,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:38,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:25:38,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:38,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:25:38,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:38,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:25:38,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:38,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:25:38,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:38,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:25:38,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:38,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:25:38,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:38,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 10:25:38,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:38,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 10:25:38,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:38,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 10:25:38,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:38,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 10:25:38,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:38,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-07 10:25:38,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:38,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-07 10:25:38,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:38,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 10:25:38,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:38,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 10:25:38,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:38,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 10:25:38,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:38,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 10:25:38,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:38,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-07 10:25:38,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:38,444 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-07 10:25:38,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:25:38,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174846350] [2024-11-07 10:25:38,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174846350] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:25:38,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:25:38,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 10:25:38,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094390851] [2024-11-07 10:25:38,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:25:38,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 10:25:38,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:25:38,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 10:25:38,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 10:25:38,446 INFO L87 Difference]: Start difference. First operand 382 states and 574 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-07 10:25:38,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:25:38,484 INFO L93 Difference]: Finished difference Result 758 states and 1141 transitions. [2024-11-07 10:25:38,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 10:25:38,485 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 152 [2024-11-07 10:25:38,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:25:38,488 INFO L225 Difference]: With dead ends: 758 [2024-11-07 10:25:38,489 INFO L226 Difference]: Without dead ends: 379 [2024-11-07 10:25:38,490 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 10:25:38,492 INFO L432 NwaCegarLoop]: 179 mSDtfsCounter, 0 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 10:25:38,492 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 345 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 10:25:38,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2024-11-07 10:25:38,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 379. [2024-11-07 10:25:38,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 379 states, 328 states have (on average 1.4451219512195121) internal successors, (474), 329 states have internal predecessors, (474), 47 states have call successors, (47), 3 states have call predecessors, (47), 3 states have return successors, (47), 46 states have call predecessors, (47), 47 states have call successors, (47) [2024-11-07 10:25:38,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 568 transitions. [2024-11-07 10:25:38,524 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 568 transitions. Word has length 152 [2024-11-07 10:25:38,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:25:38,524 INFO L471 AbstractCegarLoop]: Abstraction has 379 states and 568 transitions. [2024-11-07 10:25:38,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-07 10:25:38,525 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 568 transitions. [2024-11-07 10:25:38,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-07 10:25:38,527 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:25:38,527 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:25:38,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 10:25:38,527 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:25:38,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:25:38,527 INFO L85 PathProgramCache]: Analyzing trace with hash -234426631, now seen corresponding path program 1 times [2024-11-07 10:25:38,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:25:38,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954952702] [2024-11-07 10:25:38,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:25:38,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:25:38,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:38,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:25:38,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:38,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:25:38,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:38,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:25:38,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:38,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:25:38,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:38,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:25:38,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:38,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:25:38,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:38,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:25:38,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:38,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:25:38,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:38,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 10:25:38,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:38,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 10:25:38,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:38,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 10:25:38,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:38,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 10:25:38,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:38,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-07 10:25:38,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:38,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-07 10:25:38,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:38,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 10:25:38,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:38,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 10:25:38,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:38,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 10:25:38,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:38,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 10:25:38,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:38,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-07 10:25:38,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:38,643 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-07 10:25:38,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:25:38,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954952702] [2024-11-07 10:25:38,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954952702] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:25:38,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:25:38,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 10:25:38,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372466843] [2024-11-07 10:25:38,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:25:38,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 10:25:38,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:25:38,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 10:25:38,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 10:25:38,645 INFO L87 Difference]: Start difference. First operand 379 states and 568 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-07 10:25:38,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:25:38,679 INFO L93 Difference]: Finished difference Result 760 states and 1143 transitions. [2024-11-07 10:25:38,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 10:25:38,679 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 152 [2024-11-07 10:25:38,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:25:38,681 INFO L225 Difference]: With dead ends: 760 [2024-11-07 10:25:38,681 INFO L226 Difference]: Without dead ends: 384 [2024-11-07 10:25:38,682 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 10:25:38,682 INFO L432 NwaCegarLoop]: 179 mSDtfsCounter, 0 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 10:25:38,682 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 344 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 10:25:38,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2024-11-07 10:25:38,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 384. [2024-11-07 10:25:38,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 384 states, 333 states have (on average 1.4384384384384385) internal successors, (479), 334 states have internal predecessors, (479), 47 states have call successors, (47), 3 states have call predecessors, (47), 3 states have return successors, (47), 46 states have call predecessors, (47), 47 states have call successors, (47) [2024-11-07 10:25:38,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 573 transitions. [2024-11-07 10:25:38,704 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 573 transitions. Word has length 152 [2024-11-07 10:25:38,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:25:38,704 INFO L471 AbstractCegarLoop]: Abstraction has 384 states and 573 transitions. [2024-11-07 10:25:38,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-07 10:25:38,704 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 573 transitions. [2024-11-07 10:25:38,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-07 10:25:38,705 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:25:38,705 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:25:38,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 10:25:38,706 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:25:38,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:25:38,706 INFO L85 PathProgramCache]: Analyzing trace with hash -1910188739, now seen corresponding path program 1 times [2024-11-07 10:25:38,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:25:38,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908610365] [2024-11-07 10:25:38,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:25:38,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:25:38,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:38,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:25:38,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:38,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:25:38,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:38,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:25:38,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:38,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:25:38,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:38,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:25:38,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:38,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:25:38,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:38,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:25:38,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:38,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:25:38,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:38,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 10:25:38,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:38,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 10:25:38,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:38,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 10:25:38,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:38,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 10:25:38,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:38,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-07 10:25:38,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:38,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-07 10:25:38,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:38,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 10:25:38,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:38,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 10:25:38,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:38,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 10:25:38,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:38,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 10:25:38,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:38,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-07 10:25:38,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:38,799 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-07 10:25:38,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:25:38,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908610365] [2024-11-07 10:25:38,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908610365] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:25:38,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:25:38,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 10:25:38,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491731284] [2024-11-07 10:25:38,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:25:38,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 10:25:38,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:25:38,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 10:25:38,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 10:25:38,800 INFO L87 Difference]: Start difference. First operand 384 states and 573 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-07 10:25:38,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:25:38,831 INFO L93 Difference]: Finished difference Result 760 states and 1135 transitions. [2024-11-07 10:25:38,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 10:25:38,831 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 152 [2024-11-07 10:25:38,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:25:38,834 INFO L225 Difference]: With dead ends: 760 [2024-11-07 10:25:38,834 INFO L226 Difference]: Without dead ends: 379 [2024-11-07 10:25:38,835 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 10:25:38,835 INFO L432 NwaCegarLoop]: 179 mSDtfsCounter, 0 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 10:25:38,835 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 345 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 10:25:38,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2024-11-07 10:25:38,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 379. [2024-11-07 10:25:38,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 379 states, 328 states have (on average 1.4298780487804879) internal successors, (469), 329 states have internal predecessors, (469), 47 states have call successors, (47), 3 states have call predecessors, (47), 3 states have return successors, (47), 46 states have call predecessors, (47), 47 states have call successors, (47) [2024-11-07 10:25:38,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 563 transitions. [2024-11-07 10:25:38,860 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 563 transitions. Word has length 152 [2024-11-07 10:25:38,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:25:38,860 INFO L471 AbstractCegarLoop]: Abstraction has 379 states and 563 transitions. [2024-11-07 10:25:38,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-07 10:25:38,860 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 563 transitions. [2024-11-07 10:25:38,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-07 10:25:38,861 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:25:38,862 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:25:38,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 10:25:38,862 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:25:38,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:25:38,862 INFO L85 PathProgramCache]: Analyzing trace with hash -2133860781, now seen corresponding path program 1 times [2024-11-07 10:25:38,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:25:38,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891830756] [2024-11-07 10:25:38,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:25:38,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:25:38,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:39,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:25:39,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:39,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:25:39,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:39,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:25:39,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:39,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:25:39,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:39,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:25:39,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:39,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:25:39,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:39,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:25:39,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:39,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:25:39,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:39,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 10:25:39,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:39,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 10:25:39,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:39,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 10:25:39,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:39,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 10:25:39,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:39,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-07 10:25:39,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:39,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-07 10:25:39,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:39,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 10:25:39,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:39,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 10:25:39,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:39,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 10:25:39,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:39,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 10:25:39,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:39,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-07 10:25:39,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:39,037 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-07 10:25:39,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:25:39,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891830756] [2024-11-07 10:25:39,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1891830756] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:25:39,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:25:39,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 10:25:39,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963510979] [2024-11-07 10:25:39,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:25:39,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 10:25:39,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:25:39,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 10:25:39,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 10:25:39,039 INFO L87 Difference]: Start difference. First operand 379 states and 563 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-07 10:25:39,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:25:39,070 INFO L93 Difference]: Finished difference Result 764 states and 1135 transitions. [2024-11-07 10:25:39,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 10:25:39,070 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 153 [2024-11-07 10:25:39,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:25:39,072 INFO L225 Difference]: With dead ends: 764 [2024-11-07 10:25:39,072 INFO L226 Difference]: Without dead ends: 388 [2024-11-07 10:25:39,073 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 10:25:39,073 INFO L432 NwaCegarLoop]: 177 mSDtfsCounter, 0 mSDsluCounter, 514 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 691 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 10:25:39,073 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 691 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 10:25:39,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2024-11-07 10:25:39,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 388. [2024-11-07 10:25:39,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 388 states, 337 states have (on average 1.4183976261127595) internal successors, (478), 338 states have internal predecessors, (478), 47 states have call successors, (47), 3 states have call predecessors, (47), 3 states have return successors, (47), 46 states have call predecessors, (47), 47 states have call successors, (47) [2024-11-07 10:25:39,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 572 transitions. [2024-11-07 10:25:39,089 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 572 transitions. Word has length 153 [2024-11-07 10:25:39,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:25:39,090 INFO L471 AbstractCegarLoop]: Abstraction has 388 states and 572 transitions. [2024-11-07 10:25:39,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-07 10:25:39,090 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 572 transitions. [2024-11-07 10:25:39,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-07 10:25:39,091 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:25:39,091 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:25:39,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 10:25:39,091 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:25:39,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:25:39,091 INFO L85 PathProgramCache]: Analyzing trace with hash 1297495016, now seen corresponding path program 1 times [2024-11-07 10:25:39,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:25:39,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142876838] [2024-11-07 10:25:39,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:25:39,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:25:39,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:40,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:25:40,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:40,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:25:40,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:40,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:25:40,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:40,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:25:40,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:40,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:25:40,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:40,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:25:40,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:40,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:25:40,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:40,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:25:40,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:40,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 10:25:40,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:40,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 10:25:40,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:40,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 10:25:40,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:40,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 10:25:40,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:40,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-07 10:25:40,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:40,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-07 10:25:40,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:40,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 10:25:40,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:40,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 10:25:40,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:40,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 10:25:40,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:40,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 10:25:40,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:40,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-07 10:25:40,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:40,214 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-07 10:25:40,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:25:40,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142876838] [2024-11-07 10:25:40,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142876838] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:25:40,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:25:40,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-07 10:25:40,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584955640] [2024-11-07 10:25:40,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:25:40,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-07 10:25:40,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:25:40,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-07 10:25:40,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-07 10:25:40,216 INFO L87 Difference]: Start difference. First operand 388 states and 572 transitions. Second operand has 10 states, 10 states have (on average 6.1) internal successors, (61), 10 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-07 10:25:40,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:25:40,731 INFO L93 Difference]: Finished difference Result 986 states and 1455 transitions. [2024-11-07 10:25:40,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 10:25:40,732 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.1) internal successors, (61), 10 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 153 [2024-11-07 10:25:40,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:25:40,734 INFO L225 Difference]: With dead ends: 986 [2024-11-07 10:25:40,734 INFO L226 Difference]: Without dead ends: 601 [2024-11-07 10:25:40,735 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2024-11-07 10:25:40,736 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 465 mSDsluCounter, 583 mSDsCounter, 0 mSdLazyCounter, 526 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 465 SdHoareTripleChecker+Valid, 726 SdHoareTripleChecker+Invalid, 558 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 526 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 10:25:40,736 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [465 Valid, 726 Invalid, 558 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 526 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 10:25:40,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2024-11-07 10:25:40,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 527. [2024-11-07 10:25:40,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 527 states, 466 states have (on average 1.4356223175965666) internal successors, (669), 468 states have internal predecessors, (669), 56 states have call successors, (56), 4 states have call predecessors, (56), 4 states have return successors, (56), 54 states have call predecessors, (56), 56 states have call successors, (56) [2024-11-07 10:25:40,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 781 transitions. [2024-11-07 10:25:40,767 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 781 transitions. Word has length 153 [2024-11-07 10:25:40,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:25:40,768 INFO L471 AbstractCegarLoop]: Abstraction has 527 states and 781 transitions. [2024-11-07 10:25:40,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.1) internal successors, (61), 10 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-07 10:25:40,768 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 781 transitions. [2024-11-07 10:25:40,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-07 10:25:40,773 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:25:40,773 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:25:40,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 10:25:40,773 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:25:40,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:25:40,773 INFO L85 PathProgramCache]: Analyzing trace with hash 17631338, now seen corresponding path program 1 times [2024-11-07 10:25:40,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:25:40,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340936314] [2024-11-07 10:25:40,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:25:40,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:25:40,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:40,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:25:40,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:40,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:25:40,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:40,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:25:40,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:40,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:25:40,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:40,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:25:40,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:40,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:25:40,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:40,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:25:40,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:40,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:25:40,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:40,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 10:25:40,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:40,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 10:25:40,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:40,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 10:25:40,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:40,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 10:25:40,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:40,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-07 10:25:40,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:40,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-07 10:25:40,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:40,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 10:25:40,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:40,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 10:25:40,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:40,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 10:25:40,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:40,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 10:25:40,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:40,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-07 10:25:40,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:40,986 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-07 10:25:40,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:25:40,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340936314] [2024-11-07 10:25:40,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340936314] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:25:40,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:25:40,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 10:25:40,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612098612] [2024-11-07 10:25:40,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:25:40,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 10:25:40,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:25:40,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 10:25:40,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 10:25:40,987 INFO L87 Difference]: Start difference. First operand 527 states and 781 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-07 10:25:41,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:25:41,155 INFO L93 Difference]: Finished difference Result 1323 states and 1942 transitions. [2024-11-07 10:25:41,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 10:25:41,155 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 153 [2024-11-07 10:25:41,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:25:41,159 INFO L225 Difference]: With dead ends: 1323 [2024-11-07 10:25:41,159 INFO L226 Difference]: Without dead ends: 799 [2024-11-07 10:25:41,160 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-07 10:25:41,160 INFO L432 NwaCegarLoop]: 235 mSDtfsCounter, 93 mSDsluCounter, 537 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 772 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 10:25:41,160 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 772 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 10:25:41,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 799 states. [2024-11-07 10:25:41,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 799 to 795. [2024-11-07 10:25:41,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 795 states, 690 states have (on average 1.3985507246376812) internal successors, (965), 696 states have internal predecessors, (965), 96 states have call successors, (96), 8 states have call predecessors, (96), 8 states have return successors, (96), 90 states have call predecessors, (96), 96 states have call successors, (96) [2024-11-07 10:25:41,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 1157 transitions. [2024-11-07 10:25:41,227 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 1157 transitions. Word has length 153 [2024-11-07 10:25:41,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:25:41,227 INFO L471 AbstractCegarLoop]: Abstraction has 795 states and 1157 transitions. [2024-11-07 10:25:41,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-07 10:25:41,227 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 1157 transitions. [2024-11-07 10:25:41,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-07 10:25:41,229 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:25:41,229 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:25:41,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-07 10:25:41,229 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:25:41,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:25:41,230 INFO L85 PathProgramCache]: Analyzing trace with hash -569174676, now seen corresponding path program 1 times [2024-11-07 10:25:41,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:25:41,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65989795] [2024-11-07 10:25:41,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:25:41,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:25:41,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:41,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:25:41,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:41,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:25:41,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:41,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:25:41,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:41,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:25:41,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:41,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:25:41,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:41,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:25:41,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:41,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:25:41,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:41,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:25:41,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:41,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 10:25:41,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:41,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 10:25:41,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:41,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 10:25:41,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:41,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 10:25:41,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:41,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-07 10:25:41,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:41,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-07 10:25:41,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:41,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 10:25:41,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:41,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 10:25:41,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:41,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 10:25:41,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:41,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 10:25:41,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:41,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-07 10:25:41,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:41,974 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-07 10:25:41,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:25:41,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65989795] [2024-11-07 10:25:41,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65989795] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:25:41,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:25:41,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 10:25:41,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386950304] [2024-11-07 10:25:41,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:25:41,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 10:25:41,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:25:41,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 10:25:41,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-07 10:25:41,976 INFO L87 Difference]: Start difference. First operand 795 states and 1157 transitions. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-07 10:25:42,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:25:42,362 INFO L93 Difference]: Finished difference Result 1721 states and 2506 transitions. [2024-11-07 10:25:42,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 10:25:42,363 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 153 [2024-11-07 10:25:42,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:25:42,370 INFO L225 Difference]: With dead ends: 1721 [2024-11-07 10:25:42,370 INFO L226 Difference]: Without dead ends: 929 [2024-11-07 10:25:42,371 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-07 10:25:42,373 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 474 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 330 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 474 SdHoareTripleChecker+Valid, 573 SdHoareTripleChecker+Invalid, 368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 10:25:42,373 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [474 Valid, 573 Invalid, 368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 330 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 10:25:42,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 929 states. [2024-11-07 10:25:42,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 929 to 860. [2024-11-07 10:25:42,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 860 states, 752 states have (on average 1.4042553191489362) internal successors, (1056), 758 states have internal predecessors, (1056), 98 states have call successors, (98), 9 states have call predecessors, (98), 9 states have return successors, (98), 92 states have call predecessors, (98), 98 states have call successors, (98) [2024-11-07 10:25:42,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 860 states to 860 states and 1252 transitions. [2024-11-07 10:25:42,438 INFO L78 Accepts]: Start accepts. Automaton has 860 states and 1252 transitions. Word has length 153 [2024-11-07 10:25:42,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:25:42,439 INFO L471 AbstractCegarLoop]: Abstraction has 860 states and 1252 transitions. [2024-11-07 10:25:42,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-07 10:25:42,439 INFO L276 IsEmpty]: Start isEmpty. Operand 860 states and 1252 transitions. [2024-11-07 10:25:42,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-07 10:25:42,442 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:25:42,442 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:25:42,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-07 10:25:42,443 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:25:42,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:25:42,443 INFO L85 PathProgramCache]: Analyzing trace with hash 561773252, now seen corresponding path program 1 times [2024-11-07 10:25:42,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:25:42,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645151140] [2024-11-07 10:25:42,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:25:42,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:25:42,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:42,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:25:42,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:42,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:25:42,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:42,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:25:42,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:42,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:25:42,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:42,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:25:42,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:42,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:25:42,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:42,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:25:42,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:42,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:25:42,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:42,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 10:25:42,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:42,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 10:25:42,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:42,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 10:25:42,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:42,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 10:25:42,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:42,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-07 10:25:42,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:42,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-07 10:25:42,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:42,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 10:25:42,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:42,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 10:25:42,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:42,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 10:25:42,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:42,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 10:25:42,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:42,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-07 10:25:42,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:42,558 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-07 10:25:42,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:25:42,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645151140] [2024-11-07 10:25:42,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645151140] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:25:42,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:25:42,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 10:25:42,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586690300] [2024-11-07 10:25:42,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:25:42,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 10:25:42,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:25:42,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 10:25:42,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 10:25:42,560 INFO L87 Difference]: Start difference. First operand 860 states and 1252 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-07 10:25:42,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:25:42,669 INFO L93 Difference]: Finished difference Result 1778 states and 2588 transitions. [2024-11-07 10:25:42,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 10:25:42,670 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 153 [2024-11-07 10:25:42,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:25:42,674 INFO L225 Difference]: With dead ends: 1778 [2024-11-07 10:25:42,674 INFO L226 Difference]: Without dead ends: 921 [2024-11-07 10:25:42,675 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-07 10:25:42,675 INFO L432 NwaCegarLoop]: 170 mSDtfsCounter, 78 mSDsluCounter, 472 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 642 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 10:25:42,675 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 642 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 10:25:42,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 921 states. [2024-11-07 10:25:42,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 921 to 845. [2024-11-07 10:25:42,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 845 states, 737 states have (on average 1.3934871099050203) internal successors, (1027), 743 states have internal predecessors, (1027), 98 states have call successors, (98), 9 states have call predecessors, (98), 9 states have return successors, (98), 92 states have call predecessors, (98), 98 states have call successors, (98) [2024-11-07 10:25:42,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 845 states to 845 states and 1223 transitions. [2024-11-07 10:25:42,731 INFO L78 Accepts]: Start accepts. Automaton has 845 states and 1223 transitions. Word has length 153 [2024-11-07 10:25:42,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:25:42,732 INFO L471 AbstractCegarLoop]: Abstraction has 845 states and 1223 transitions. [2024-11-07 10:25:42,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-07 10:25:42,732 INFO L276 IsEmpty]: Start isEmpty. Operand 845 states and 1223 transitions. [2024-11-07 10:25:42,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-07 10:25:42,733 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:25:42,733 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:25:42,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-07 10:25:42,734 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:25:42,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:25:42,734 INFO L85 PathProgramCache]: Analyzing trace with hash -1542718732, now seen corresponding path program 1 times [2024-11-07 10:25:42,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:25:42,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390430512] [2024-11-07 10:25:42,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:25:42,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:25:42,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:44,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:25:44,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:44,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:25:44,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:44,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:25:44,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:44,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:25:44,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:44,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:25:44,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:44,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:25:44,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:44,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:25:44,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:44,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:25:44,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:44,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 10:25:44,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:44,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 10:25:44,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:44,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 10:25:44,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:44,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 10:25:44,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:44,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-07 10:25:44,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:44,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-07 10:25:44,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:44,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 10:25:44,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:44,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 10:25:44,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:44,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 10:25:44,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:44,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 10:25:44,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:44,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-07 10:25:44,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:44,468 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-07 10:25:44,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:25:44,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390430512] [2024-11-07 10:25:44,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390430512] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:25:44,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:25:44,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-07 10:25:44,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60921566] [2024-11-07 10:25:44,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:25:44,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-07 10:25:44,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:25:44,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-07 10:25:44,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2024-11-07 10:25:44,470 INFO L87 Difference]: Start difference. First operand 845 states and 1223 transitions. Second operand has 13 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 13 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-07 10:25:45,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:25:45,798 INFO L93 Difference]: Finished difference Result 2406 states and 3481 transitions. [2024-11-07 10:25:45,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-07 10:25:45,799 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 13 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 153 [2024-11-07 10:25:45,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:25:45,804 INFO L225 Difference]: With dead ends: 2406 [2024-11-07 10:25:45,804 INFO L226 Difference]: Without dead ends: 1564 [2024-11-07 10:25:45,806 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=101, Invalid=361, Unknown=0, NotChecked=0, Total=462 [2024-11-07 10:25:45,806 INFO L432 NwaCegarLoop]: 185 mSDtfsCounter, 341 mSDsluCounter, 1414 mSDsCounter, 0 mSdLazyCounter, 997 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 341 SdHoareTripleChecker+Valid, 1599 SdHoareTripleChecker+Invalid, 1071 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 997 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-07 10:25:45,806 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [341 Valid, 1599 Invalid, 1071 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 997 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-07 10:25:45,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1564 states. [2024-11-07 10:25:45,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1564 to 948. [2024-11-07 10:25:45,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 948 states, 818 states have (on average 1.3863080684596576) internal successors, (1134), 824 states have internal predecessors, (1134), 117 states have call successors, (117), 12 states have call predecessors, (117), 12 states have return successors, (117), 111 states have call predecessors, (117), 117 states have call successors, (117) [2024-11-07 10:25:45,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 948 states to 948 states and 1368 transitions. [2024-11-07 10:25:45,884 INFO L78 Accepts]: Start accepts. Automaton has 948 states and 1368 transitions. Word has length 153 [2024-11-07 10:25:45,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:25:45,884 INFO L471 AbstractCegarLoop]: Abstraction has 948 states and 1368 transitions. [2024-11-07 10:25:45,884 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 13 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-07 10:25:45,885 INFO L276 IsEmpty]: Start isEmpty. Operand 948 states and 1368 transitions. [2024-11-07 10:25:45,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-07 10:25:45,886 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:25:45,886 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:25:45,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-07 10:25:45,886 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:25:45,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:25:45,887 INFO L85 PathProgramCache]: Analyzing trace with hash 788021926, now seen corresponding path program 1 times [2024-11-07 10:25:45,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:25:45,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501461867] [2024-11-07 10:25:45,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:25:45,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:25:45,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:46,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:25:46,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:46,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:25:46,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:46,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:25:46,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:46,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:25:46,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:46,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:25:46,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:46,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:25:46,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:46,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:25:46,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:46,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:25:46,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:46,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 10:25:46,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:46,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 10:25:46,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:46,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 10:25:46,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:46,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 10:25:46,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:46,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-07 10:25:46,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:46,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-07 10:25:46,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:46,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 10:25:46,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:46,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 10:25:46,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:46,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 10:25:46,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:46,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 10:25:46,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:46,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-07 10:25:46,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:46,850 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-07 10:25:46,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:25:46,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501461867] [2024-11-07 10:25:46,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501461867] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:25:46,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:25:46,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-07 10:25:46,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930831037] [2024-11-07 10:25:46,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:25:46,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-07 10:25:46,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:25:46,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-07 10:25:46,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-11-07 10:25:46,851 INFO L87 Difference]: Start difference. First operand 948 states and 1368 transitions. Second operand has 12 states, 12 states have (on average 5.083333333333333) internal successors, (61), 12 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-07 10:25:47,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:25:47,719 INFO L93 Difference]: Finished difference Result 2404 states and 3476 transitions. [2024-11-07 10:25:47,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 10:25:47,719 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.083333333333333) internal successors, (61), 12 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 153 [2024-11-07 10:25:47,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:25:47,724 INFO L225 Difference]: With dead ends: 2404 [2024-11-07 10:25:47,725 INFO L226 Difference]: Without dead ends: 1562 [2024-11-07 10:25:47,726 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=88, Invalid=292, Unknown=0, NotChecked=0, Total=380 [2024-11-07 10:25:47,727 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 530 mSDsluCounter, 1054 mSDsCounter, 0 mSdLazyCounter, 830 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 530 SdHoareTripleChecker+Valid, 1215 SdHoareTripleChecker+Invalid, 915 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 830 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-07 10:25:47,727 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [530 Valid, 1215 Invalid, 915 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 830 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-07 10:25:47,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1562 states. [2024-11-07 10:25:47,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1562 to 986. [2024-11-07 10:25:47,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 986 states, 856 states have (on average 1.3925233644859814) internal successors, (1192), 862 states have internal predecessors, (1192), 117 states have call successors, (117), 12 states have call predecessors, (117), 12 states have return successors, (117), 111 states have call predecessors, (117), 117 states have call successors, (117) [2024-11-07 10:25:47,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 986 states to 986 states and 1426 transitions. [2024-11-07 10:25:47,780 INFO L78 Accepts]: Start accepts. Automaton has 986 states and 1426 transitions. Word has length 153 [2024-11-07 10:25:47,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:25:47,780 INFO L471 AbstractCegarLoop]: Abstraction has 986 states and 1426 transitions. [2024-11-07 10:25:47,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.083333333333333) internal successors, (61), 12 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-07 10:25:47,781 INFO L276 IsEmpty]: Start isEmpty. Operand 986 states and 1426 transitions. [2024-11-07 10:25:47,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-07 10:25:47,782 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:25:47,782 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:25:47,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-07 10:25:47,782 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:25:47,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:25:47,783 INFO L85 PathProgramCache]: Analyzing trace with hash -1078647766, now seen corresponding path program 1 times [2024-11-07 10:25:47,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:25:47,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854858470] [2024-11-07 10:25:47,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:25:47,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:25:47,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:48,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:25:48,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:48,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:25:48,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:48,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:25:48,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:48,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:25:48,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:48,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:25:48,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:48,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:25:48,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:48,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:25:48,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:48,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:25:48,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:48,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 10:25:48,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:48,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 10:25:48,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:48,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 10:25:48,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:48,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 10:25:48,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:48,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-07 10:25:48,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:48,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-07 10:25:48,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:48,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 10:25:48,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:48,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 10:25:48,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:48,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 10:25:48,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:48,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 10:25:48,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:48,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-07 10:25:48,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:48,522 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-07 10:25:48,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:25:48,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854858470] [2024-11-07 10:25:48,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854858470] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:25:48,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:25:48,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-07 10:25:48,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149079622] [2024-11-07 10:25:48,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:25:48,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-07 10:25:48,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:25:48,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-07 10:25:48,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-07 10:25:48,524 INFO L87 Difference]: Start difference. First operand 986 states and 1426 transitions. Second operand has 10 states, 10 states have (on average 6.1) internal successors, (61), 10 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-07 10:25:49,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:25:49,023 INFO L93 Difference]: Finished difference Result 2097 states and 3028 transitions. [2024-11-07 10:25:49,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 10:25:49,023 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.1) internal successors, (61), 10 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 153 [2024-11-07 10:25:49,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:25:49,028 INFO L225 Difference]: With dead ends: 2097 [2024-11-07 10:25:49,028 INFO L226 Difference]: Without dead ends: 1255 [2024-11-07 10:25:49,029 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2024-11-07 10:25:49,030 INFO L432 NwaCegarLoop]: 211 mSDtfsCounter, 451 mSDsluCounter, 736 mSDsCounter, 0 mSdLazyCounter, 528 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 451 SdHoareTripleChecker+Valid, 947 SdHoareTripleChecker+Invalid, 579 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 528 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 10:25:49,030 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [451 Valid, 947 Invalid, 579 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 528 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 10:25:49,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1255 states. [2024-11-07 10:25:49,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1255 to 1065. [2024-11-07 10:25:49,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1065 states, 925 states have (on average 1.3935135135135135) internal successors, (1289), 932 states have internal predecessors, (1289), 126 states have call successors, (126), 13 states have call predecessors, (126), 13 states have return successors, (126), 119 states have call predecessors, (126), 126 states have call successors, (126) [2024-11-07 10:25:49,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1065 states to 1065 states and 1541 transitions. [2024-11-07 10:25:49,097 INFO L78 Accepts]: Start accepts. Automaton has 1065 states and 1541 transitions. Word has length 153 [2024-11-07 10:25:49,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:25:49,098 INFO L471 AbstractCegarLoop]: Abstraction has 1065 states and 1541 transitions. [2024-11-07 10:25:49,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.1) internal successors, (61), 10 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-07 10:25:49,098 INFO L276 IsEmpty]: Start isEmpty. Operand 1065 states and 1541 transitions. [2024-11-07 10:25:49,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-07 10:25:49,099 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:25:49,099 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:25:49,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-07 10:25:49,100 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:25:49,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:25:49,100 INFO L85 PathProgramCache]: Analyzing trace with hash -2052191822, now seen corresponding path program 1 times [2024-11-07 10:25:49,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:25:49,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836048414] [2024-11-07 10:25:49,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:25:49,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:25:49,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:49,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:25:49,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:49,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:25:49,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:49,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:25:49,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:49,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:25:49,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:49,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:25:49,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:49,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:25:49,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:49,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:25:49,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:49,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:25:49,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:49,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 10:25:49,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:49,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 10:25:49,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:49,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 10:25:49,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:49,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 10:25:49,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:49,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-07 10:25:49,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:49,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-07 10:25:49,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:49,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 10:25:49,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:49,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 10:25:49,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:49,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 10:25:49,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:49,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 10:25:49,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:49,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-07 10:25:49,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:49,320 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-07 10:25:49,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:25:49,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836048414] [2024-11-07 10:25:49,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1836048414] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:25:49,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:25:49,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 10:25:49,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194715838] [2024-11-07 10:25:49,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:25:49,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 10:25:49,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:25:49,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 10:25:49,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 10:25:49,322 INFO L87 Difference]: Start difference. First operand 1065 states and 1541 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-07 10:25:49,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:25:49,463 INFO L93 Difference]: Finished difference Result 1986 states and 2876 transitions. [2024-11-07 10:25:49,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 10:25:49,464 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 153 [2024-11-07 10:25:49,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:25:49,468 INFO L225 Difference]: With dead ends: 1986 [2024-11-07 10:25:49,468 INFO L226 Difference]: Without dead ends: 1065 [2024-11-07 10:25:49,469 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-07 10:25:49,469 INFO L432 NwaCegarLoop]: 180 mSDtfsCounter, 4 mSDsluCounter, 444 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 624 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 10:25:49,469 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 624 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 10:25:49,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1065 states. [2024-11-07 10:25:49,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1065 to 1065. [2024-11-07 10:25:49,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1065 states, 925 states have (on average 1.3913513513513514) internal successors, (1287), 932 states have internal predecessors, (1287), 126 states have call successors, (126), 13 states have call predecessors, (126), 13 states have return successors, (126), 119 states have call predecessors, (126), 126 states have call successors, (126) [2024-11-07 10:25:49,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1065 states to 1065 states and 1539 transitions. [2024-11-07 10:25:49,523 INFO L78 Accepts]: Start accepts. Automaton has 1065 states and 1539 transitions. Word has length 153 [2024-11-07 10:25:49,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:25:49,523 INFO L471 AbstractCegarLoop]: Abstraction has 1065 states and 1539 transitions. [2024-11-07 10:25:49,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-07 10:25:49,523 INFO L276 IsEmpty]: Start isEmpty. Operand 1065 states and 1539 transitions. [2024-11-07 10:25:49,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-07 10:25:49,525 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:25:49,525 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:25:49,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-07 10:25:49,525 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:25:49,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:25:49,525 INFO L85 PathProgramCache]: Analyzing trace with hash -1990152208, now seen corresponding path program 1 times [2024-11-07 10:25:49,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:25:49,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902023787] [2024-11-07 10:25:49,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:25:49,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:25:49,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:50,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:25:50,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:50,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:25:50,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:50,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:25:50,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:50,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:25:50,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:50,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:25:50,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:50,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:25:50,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:50,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:25:50,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:50,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:25:50,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:50,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 10:25:50,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:50,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 10:25:50,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:50,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 10:25:50,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:50,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 10:25:50,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:50,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-07 10:25:50,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:50,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-07 10:25:50,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:50,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 10:25:50,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:50,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 10:25:50,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:50,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 10:25:50,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:50,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 10:25:50,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:50,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-07 10:25:50,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:50,545 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-07 10:25:50,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:25:50,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902023787] [2024-11-07 10:25:50,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902023787] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:25:50,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:25:50,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-07 10:25:50,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627002999] [2024-11-07 10:25:50,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:25:50,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-07 10:25:50,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:25:50,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-07 10:25:50,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-07 10:25:50,547 INFO L87 Difference]: Start difference. First operand 1065 states and 1539 transitions. Second operand has 10 states, 10 states have (on average 6.1) internal successors, (61), 10 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-07 10:25:51,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:25:51,254 INFO L93 Difference]: Finished difference Result 2239 states and 3228 transitions. [2024-11-07 10:25:51,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 10:25:51,255 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.1) internal successors, (61), 10 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 153 [2024-11-07 10:25:51,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:25:51,260 INFO L225 Difference]: With dead ends: 2239 [2024-11-07 10:25:51,260 INFO L226 Difference]: Without dead ends: 1318 [2024-11-07 10:25:51,262 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2024-11-07 10:25:51,262 INFO L432 NwaCegarLoop]: 222 mSDtfsCounter, 247 mSDsluCounter, 838 mSDsCounter, 0 mSdLazyCounter, 690 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 1060 SdHoareTripleChecker+Invalid, 692 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 690 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-07 10:25:51,263 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 1060 Invalid, 692 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 690 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-07 10:25:51,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1318 states. [2024-11-07 10:25:51,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1318 to 1071. [2024-11-07 10:25:51,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1071 states, 931 states have (on average 1.3899033297529537) internal successors, (1294), 938 states have internal predecessors, (1294), 126 states have call successors, (126), 13 states have call predecessors, (126), 13 states have return successors, (126), 119 states have call predecessors, (126), 126 states have call successors, (126) [2024-11-07 10:25:51,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1071 states to 1071 states and 1546 transitions. [2024-11-07 10:25:51,324 INFO L78 Accepts]: Start accepts. Automaton has 1071 states and 1546 transitions. Word has length 153 [2024-11-07 10:25:51,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:25:51,324 INFO L471 AbstractCegarLoop]: Abstraction has 1071 states and 1546 transitions. [2024-11-07 10:25:51,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.1) internal successors, (61), 10 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-07 10:25:51,324 INFO L276 IsEmpty]: Start isEmpty. Operand 1071 states and 1546 transitions. [2024-11-07 10:25:51,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-07 10:25:51,326 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:25:51,326 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:25:51,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-07 10:25:51,326 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:25:51,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:25:51,327 INFO L85 PathProgramCache]: Analyzing trace with hash 1718009074, now seen corresponding path program 1 times [2024-11-07 10:25:51,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:25:51,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562879278] [2024-11-07 10:25:51,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:25:51,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:25:51,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:51,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:25:51,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:51,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:25:51,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:51,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:25:51,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:51,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:25:51,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:51,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:25:51,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:51,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:25:51,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:51,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:25:51,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:51,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:25:51,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:51,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 10:25:51,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:51,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 10:25:51,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:51,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 10:25:51,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:51,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 10:25:51,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:52,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-07 10:25:52,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:52,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-07 10:25:52,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:52,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 10:25:52,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:52,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 10:25:52,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:52,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 10:25:52,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:52,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 10:25:52,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:52,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-07 10:25:52,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:52,020 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-07 10:25:52,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:25:52,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562879278] [2024-11-07 10:25:52,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562879278] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:25:52,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:25:52,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-07 10:25:52,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610031642] [2024-11-07 10:25:52,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:25:52,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-07 10:25:52,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:25:52,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-07 10:25:52,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-07 10:25:52,022 INFO L87 Difference]: Start difference. First operand 1071 states and 1546 transitions. Second operand has 10 states, 10 states have (on average 6.1) internal successors, (61), 10 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-07 10:25:52,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:25:52,594 INFO L93 Difference]: Finished difference Result 2245 states and 3233 transitions. [2024-11-07 10:25:52,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 10:25:52,594 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.1) internal successors, (61), 10 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 153 [2024-11-07 10:25:52,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:25:52,599 INFO L225 Difference]: With dead ends: 2245 [2024-11-07 10:25:52,599 INFO L226 Difference]: Without dead ends: 1318 [2024-11-07 10:25:52,601 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2024-11-07 10:25:52,601 INFO L432 NwaCegarLoop]: 252 mSDtfsCounter, 341 mSDsluCounter, 932 mSDsCounter, 0 mSdLazyCounter, 691 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 341 SdHoareTripleChecker+Valid, 1184 SdHoareTripleChecker+Invalid, 712 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 691 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 10:25:52,601 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [341 Valid, 1184 Invalid, 712 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 691 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 10:25:52,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1318 states. [2024-11-07 10:25:52,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1318 to 1071. [2024-11-07 10:25:52,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1071 states, 931 states have (on average 1.3877551020408163) internal successors, (1292), 938 states have internal predecessors, (1292), 126 states have call successors, (126), 13 states have call predecessors, (126), 13 states have return successors, (126), 119 states have call predecessors, (126), 126 states have call successors, (126) [2024-11-07 10:25:52,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1071 states to 1071 states and 1544 transitions. [2024-11-07 10:25:52,705 INFO L78 Accepts]: Start accepts. Automaton has 1071 states and 1544 transitions. Word has length 153 [2024-11-07 10:25:52,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:25:52,706 INFO L471 AbstractCegarLoop]: Abstraction has 1071 states and 1544 transitions. [2024-11-07 10:25:52,706 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.1) internal successors, (61), 10 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-07 10:25:52,706 INFO L276 IsEmpty]: Start isEmpty. Operand 1071 states and 1544 transitions. [2024-11-07 10:25:52,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-07 10:25:52,707 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:25:52,708 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:25:52,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-07 10:25:52,708 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:25:52,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:25:52,708 INFO L85 PathProgramCache]: Analyzing trace with hash 412170648, now seen corresponding path program 1 times [2024-11-07 10:25:52,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:25:52,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745424055] [2024-11-07 10:25:52,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:25:52,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:25:52,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:52,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:25:52,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:52,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:25:52,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:52,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:25:52,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:52,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:25:52,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:52,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:25:52,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:52,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:25:52,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:52,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:25:52,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:52,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:25:52,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:52,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 10:25:52,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:52,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 10:25:52,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:52,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 10:25:52,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:52,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 10:25:52,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:52,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-07 10:25:52,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:52,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-07 10:25:52,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:52,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 10:25:52,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:52,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 10:25:52,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:52,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 10:25:52,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:52,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 10:25:52,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:52,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-07 10:25:52,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:52,802 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-07 10:25:52,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:25:52,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745424055] [2024-11-07 10:25:52,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745424055] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:25:52,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:25:52,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 10:25:52,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247920389] [2024-11-07 10:25:52,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:25:52,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 10:25:52,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:25:52,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 10:25:52,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 10:25:52,803 INFO L87 Difference]: Start difference. First operand 1071 states and 1544 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-07 10:25:52,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:25:52,900 INFO L93 Difference]: Finished difference Result 2032 states and 2929 transitions. [2024-11-07 10:25:52,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 10:25:52,901 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 153 [2024-11-07 10:25:52,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:25:52,907 INFO L225 Difference]: With dead ends: 2032 [2024-11-07 10:25:52,907 INFO L226 Difference]: Without dead ends: 1105 [2024-11-07 10:25:52,909 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-07 10:25:52,909 INFO L432 NwaCegarLoop]: 219 mSDtfsCounter, 81 mSDsluCounter, 567 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 786 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 10:25:52,910 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 786 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 10:25:52,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1105 states. [2024-11-07 10:25:52,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1105 to 1069. [2024-11-07 10:25:52,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1069 states, 929 states have (on average 1.386437029063509) internal successors, (1288), 936 states have internal predecessors, (1288), 126 states have call successors, (126), 13 states have call predecessors, (126), 13 states have return successors, (126), 119 states have call predecessors, (126), 126 states have call successors, (126) [2024-11-07 10:25:52,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1069 states to 1069 states and 1540 transitions. [2024-11-07 10:25:52,972 INFO L78 Accepts]: Start accepts. Automaton has 1069 states and 1540 transitions. Word has length 153 [2024-11-07 10:25:52,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:25:52,972 INFO L471 AbstractCegarLoop]: Abstraction has 1069 states and 1540 transitions. [2024-11-07 10:25:52,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-07 10:25:52,973 INFO L276 IsEmpty]: Start isEmpty. Operand 1069 states and 1540 transitions. [2024-11-07 10:25:52,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-11-07 10:25:52,974 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:25:52,974 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:25:52,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-07 10:25:52,974 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:25:52,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:25:52,975 INFO L85 PathProgramCache]: Analyzing trace with hash 254682777, now seen corresponding path program 1 times [2024-11-07 10:25:52,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:25:52,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706127400] [2024-11-07 10:25:52,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:25:52,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:25:52,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:53,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:25:53,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:53,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:25:53,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:53,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:25:53,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:53,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:25:53,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:53,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:25:53,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:53,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:25:53,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:53,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:25:53,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:53,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:25:53,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:53,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 10:25:53,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:53,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 10:25:53,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:53,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 10:25:53,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:53,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 10:25:53,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:53,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-07 10:25:53,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:53,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-07 10:25:53,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:53,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 10:25:53,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:53,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 10:25:53,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:53,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 10:25:53,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:53,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 10:25:53,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:53,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-07 10:25:53,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:53,037 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-07 10:25:53,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:25:53,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706127400] [2024-11-07 10:25:53,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706127400] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:25:53,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:25:53,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 10:25:53,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051112372] [2024-11-07 10:25:53,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:25:53,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 10:25:53,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:25:53,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 10:25:53,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 10:25:53,039 INFO L87 Difference]: Start difference. First operand 1069 states and 1540 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-07 10:25:53,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:25:53,100 INFO L93 Difference]: Finished difference Result 1923 states and 2769 transitions. [2024-11-07 10:25:53,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 10:25:53,101 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 154 [2024-11-07 10:25:53,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:25:53,105 INFO L225 Difference]: With dead ends: 1923 [2024-11-07 10:25:53,105 INFO L226 Difference]: Without dead ends: 998 [2024-11-07 10:25:53,107 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 10:25:53,107 INFO L432 NwaCegarLoop]: 179 mSDtfsCounter, 0 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 10:25:53,107 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 344 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 10:25:53,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 998 states. [2024-11-07 10:25:53,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 998 to 925. [2024-11-07 10:25:53,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 925 states, 807 states have (on average 1.3903345724907064) internal successors, (1122), 812 states have internal predecessors, (1122), 106 states have call successors, (106), 11 states have call predecessors, (106), 11 states have return successors, (106), 101 states have call predecessors, (106), 106 states have call successors, (106) [2024-11-07 10:25:53,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 925 states to 925 states and 1334 transitions. [2024-11-07 10:25:53,170 INFO L78 Accepts]: Start accepts. Automaton has 925 states and 1334 transitions. Word has length 154 [2024-11-07 10:25:53,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:25:53,170 INFO L471 AbstractCegarLoop]: Abstraction has 925 states and 1334 transitions. [2024-11-07 10:25:53,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-07 10:25:53,170 INFO L276 IsEmpty]: Start isEmpty. Operand 925 states and 1334 transitions. [2024-11-07 10:25:53,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-07 10:25:53,171 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:25:53,171 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:25:53,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-07 10:25:53,172 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:25:53,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:25:53,172 INFO L85 PathProgramCache]: Analyzing trace with hash -301787730, now seen corresponding path program 1 times [2024-11-07 10:25:53,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:25:53,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675475024] [2024-11-07 10:25:53,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:25:53,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:25:53,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:54,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:25:54,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:54,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:25:54,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:54,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:25:54,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:54,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:25:54,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:54,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:25:54,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:54,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:25:54,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:54,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:25:54,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:54,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:25:54,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:54,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 10:25:54,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:54,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 10:25:54,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:54,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 10:25:54,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:54,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 10:25:54,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:54,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-07 10:25:54,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:54,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-07 10:25:54,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:54,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 10:25:54,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:54,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 10:25:54,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:54,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 10:25:54,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:54,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 10:25:54,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:54,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-07 10:25:54,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:54,064 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-07 10:25:54,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:25:54,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675475024] [2024-11-07 10:25:54,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675475024] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:25:54,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:25:54,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-11-07 10:25:54,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163803739] [2024-11-07 10:25:54,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:25:54,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-07 10:25:54,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:25:54,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-07 10:25:54,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2024-11-07 10:25:54,066 INFO L87 Difference]: Start difference. First operand 925 states and 1334 transitions. Second operand has 17 states, 17 states have (on average 3.7058823529411766) internal successors, (63), 17 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-07 10:25:55,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:25:55,253 INFO L93 Difference]: Finished difference Result 2243 states and 3216 transitions. [2024-11-07 10:25:55,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-11-07 10:25:55,253 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.7058823529411766) internal successors, (63), 17 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 155 [2024-11-07 10:25:55,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:25:55,258 INFO L225 Difference]: With dead ends: 2243 [2024-11-07 10:25:55,258 INFO L226 Difference]: Without dead ends: 1462 [2024-11-07 10:25:55,259 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 273 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=222, Invalid=1260, Unknown=0, NotChecked=0, Total=1482 [2024-11-07 10:25:55,259 INFO L432 NwaCegarLoop]: 180 mSDtfsCounter, 701 mSDsluCounter, 1762 mSDsCounter, 0 mSdLazyCounter, 1168 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 701 SdHoareTripleChecker+Valid, 1942 SdHoareTripleChecker+Invalid, 1267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 1168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-07 10:25:55,259 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [701 Valid, 1942 Invalid, 1267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 1168 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-07 10:25:55,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1462 states. [2024-11-07 10:25:55,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1462 to 1037. [2024-11-07 10:25:55,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1037 states, 906 states have (on average 1.3763796909492274) internal successors, (1247), 912 states have internal predecessors, (1247), 117 states have call successors, (117), 13 states have call predecessors, (117), 13 states have return successors, (117), 111 states have call predecessors, (117), 117 states have call successors, (117) [2024-11-07 10:25:55,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1037 states to 1037 states and 1481 transitions. [2024-11-07 10:25:55,327 INFO L78 Accepts]: Start accepts. Automaton has 1037 states and 1481 transitions. Word has length 155 [2024-11-07 10:25:55,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:25:55,327 INFO L471 AbstractCegarLoop]: Abstraction has 1037 states and 1481 transitions. [2024-11-07 10:25:55,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.7058823529411766) internal successors, (63), 17 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-07 10:25:55,327 INFO L276 IsEmpty]: Start isEmpty. Operand 1037 states and 1481 transitions. [2024-11-07 10:25:55,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-07 10:25:55,328 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:25:55,328 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:25:55,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-07 10:25:55,329 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:25:55,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:25:55,329 INFO L85 PathProgramCache]: Analyzing trace with hash -239748116, now seen corresponding path program 1 times [2024-11-07 10:25:55,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:25:55,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428196434] [2024-11-07 10:25:55,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:25:55,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:25:55,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:56,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:25:56,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:56,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:25:56,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:56,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:25:56,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:56,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:25:56,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:56,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:25:56,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:56,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:25:56,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:56,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:25:56,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:56,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:25:56,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:56,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 10:25:56,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:56,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 10:25:56,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:56,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 10:25:56,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:56,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 10:25:56,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:56,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-07 10:25:56,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:56,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-07 10:25:56,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:56,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 10:25:56,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:56,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 10:25:56,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:56,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 10:25:56,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:56,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 10:25:56,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:56,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-07 10:25:56,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:56,133 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-07 10:25:56,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:25:56,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428196434] [2024-11-07 10:25:56,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428196434] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:25:56,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:25:56,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-11-07 10:25:56,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636038414] [2024-11-07 10:25:56,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:25:56,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-07 10:25:56,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:25:56,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-07 10:25:56,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2024-11-07 10:25:56,136 INFO L87 Difference]: Start difference. First operand 1037 states and 1481 transitions. Second operand has 17 states, 16 states have (on average 3.9375) internal successors, (63), 17 states have internal predecessors, (63), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2024-11-07 10:25:57,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:25:57,121 INFO L93 Difference]: Finished difference Result 2330 states and 3312 transitions. [2024-11-07 10:25:57,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-07 10:25:57,121 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 3.9375) internal successors, (63), 17 states have internal predecessors, (63), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) Word has length 155 [2024-11-07 10:25:57,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:25:57,126 INFO L225 Difference]: With dead ends: 2330 [2024-11-07 10:25:57,126 INFO L226 Difference]: Without dead ends: 1528 [2024-11-07 10:25:57,127 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=180, Invalid=750, Unknown=0, NotChecked=0, Total=930 [2024-11-07 10:25:57,128 INFO L432 NwaCegarLoop]: 235 mSDtfsCounter, 849 mSDsluCounter, 2135 mSDsCounter, 0 mSdLazyCounter, 1328 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 849 SdHoareTripleChecker+Valid, 2370 SdHoareTripleChecker+Invalid, 1435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 1328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-07 10:25:57,128 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [849 Valid, 2370 Invalid, 1435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 1328 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-07 10:25:57,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1528 states. [2024-11-07 10:25:57,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1528 to 1071. [2024-11-07 10:25:57,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1071 states, 940 states have (on average 1.377659574468085) internal successors, (1295), 946 states have internal predecessors, (1295), 117 states have call successors, (117), 13 states have call predecessors, (117), 13 states have return successors, (117), 111 states have call predecessors, (117), 117 states have call successors, (117) [2024-11-07 10:25:57,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1071 states to 1071 states and 1529 transitions. [2024-11-07 10:25:57,193 INFO L78 Accepts]: Start accepts. Automaton has 1071 states and 1529 transitions. Word has length 155 [2024-11-07 10:25:57,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:25:57,193 INFO L471 AbstractCegarLoop]: Abstraction has 1071 states and 1529 transitions. [2024-11-07 10:25:57,193 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 3.9375) internal successors, (63), 17 states have internal predecessors, (63), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2024-11-07 10:25:57,193 INFO L276 IsEmpty]: Start isEmpty. Operand 1071 states and 1529 transitions. [2024-11-07 10:25:57,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-07 10:25:57,194 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:25:57,194 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:25:57,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-07 10:25:57,195 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:25:57,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:25:57,195 INFO L85 PathProgramCache]: Analyzing trace with hash 1412848974, now seen corresponding path program 1 times [2024-11-07 10:25:57,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:25:57,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636976661] [2024-11-07 10:25:57,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:25:57,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:25:57,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:58,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:25:58,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:58,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:25:58,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:58,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:25:58,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:58,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:25:58,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:58,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:25:58,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:58,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:25:58,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:58,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:25:58,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:58,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:25:58,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:58,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 10:25:58,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:58,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 10:25:58,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:58,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 10:25:58,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:58,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 10:25:58,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:58,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-07 10:25:58,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:58,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-07 10:25:58,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:58,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 10:25:58,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:58,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 10:25:58,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:58,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 10:25:58,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:58,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 10:25:58,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:58,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-07 10:25:58,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:25:58,254 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-07 10:25:58,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:25:58,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636976661] [2024-11-07 10:25:58,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636976661] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:25:58,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:25:58,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2024-11-07 10:25:58,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188816866] [2024-11-07 10:25:58,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:25:58,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-07 10:25:58,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:25:58,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-07 10:25:58,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=329, Unknown=0, NotChecked=0, Total=380 [2024-11-07 10:25:58,256 INFO L87 Difference]: Start difference. First operand 1071 states and 1529 transitions. Second operand has 20 states, 20 states have (on average 3.15) internal successors, (63), 20 states have internal predecessors, (63), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-07 10:25:59,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:25:59,518 INFO L93 Difference]: Finished difference Result 2111 states and 3013 transitions. [2024-11-07 10:25:59,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-07 10:25:59,518 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.15) internal successors, (63), 20 states have internal predecessors, (63), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 155 [2024-11-07 10:25:59,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:25:59,523 INFO L225 Difference]: With dead ends: 2111 [2024-11-07 10:25:59,523 INFO L226 Difference]: Without dead ends: 1309 [2024-11-07 10:25:59,525 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=163, Invalid=959, Unknown=0, NotChecked=0, Total=1122 [2024-11-07 10:25:59,526 INFO L432 NwaCegarLoop]: 230 mSDtfsCounter, 380 mSDsluCounter, 2442 mSDsCounter, 0 mSdLazyCounter, 1644 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 380 SdHoareTripleChecker+Valid, 2672 SdHoareTripleChecker+Invalid, 1686 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 1644 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-07 10:25:59,526 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [380 Valid, 2672 Invalid, 1686 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 1644 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-07 10:25:59,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1309 states. [2024-11-07 10:25:59,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1309 to 1162. [2024-11-07 10:25:59,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1162 states, 1031 states have (on average 1.3860329776915616) internal successors, (1429), 1037 states have internal predecessors, (1429), 117 states have call successors, (117), 13 states have call predecessors, (117), 13 states have return successors, (117), 111 states have call predecessors, (117), 117 states have call successors, (117) [2024-11-07 10:25:59,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1162 states to 1162 states and 1663 transitions. [2024-11-07 10:25:59,593 INFO L78 Accepts]: Start accepts. Automaton has 1162 states and 1663 transitions. Word has length 155 [2024-11-07 10:25:59,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:25:59,593 INFO L471 AbstractCegarLoop]: Abstraction has 1162 states and 1663 transitions. [2024-11-07 10:25:59,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.15) internal successors, (63), 20 states have internal predecessors, (63), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-07 10:25:59,593 INFO L276 IsEmpty]: Start isEmpty. Operand 1162 states and 1663 transitions. [2024-11-07 10:25:59,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-07 10:25:59,594 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:25:59,594 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:25:59,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-07 10:25:59,595 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:25:59,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:25:59,595 INFO L85 PathProgramCache]: Analyzing trace with hash 826042960, now seen corresponding path program 1 times [2024-11-07 10:25:59,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:25:59,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855367309] [2024-11-07 10:25:59,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:25:59,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:25:59,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:26:00,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:26:00,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:26:00,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:26:00,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:26:00,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:26:00,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:26:00,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:26:00,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:26:00,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:26:00,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:26:00,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:26:00,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:26:00,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:26:00,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:26:00,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:26:00,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:26:00,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 10:26:00,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:26:00,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 10:26:00,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:26:00,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 10:26:00,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:26:00,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 10:26:00,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:26:00,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-07 10:26:00,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:26:00,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-07 10:26:00,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:26:00,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 10:26:00,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:26:00,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 10:26:00,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:26:00,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 10:26:00,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:26:00,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 10:26:00,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:26:00,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-07 10:26:00,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:26:00,209 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-07 10:26:00,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:26:00,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855367309] [2024-11-07 10:26:00,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [855367309] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:26:00,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:26:00,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-07 10:26:00,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281444025] [2024-11-07 10:26:00,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:26:00,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-07 10:26:00,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:26:00,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-07 10:26:00,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-07 10:26:00,211 INFO L87 Difference]: Start difference. First operand 1162 states and 1663 transitions. Second operand has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-07 10:26:00,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:26:00,632 INFO L93 Difference]: Finished difference Result 2204 states and 3134 transitions. [2024-11-07 10:26:00,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 10:26:00,633 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 155 [2024-11-07 10:26:00,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:26:00,638 INFO L225 Difference]: With dead ends: 2204 [2024-11-07 10:26:00,638 INFO L226 Difference]: Without dead ends: 1351 [2024-11-07 10:26:00,639 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2024-11-07 10:26:00,639 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 491 mSDsluCounter, 547 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 491 SdHoareTripleChecker+Valid, 697 SdHoareTripleChecker+Invalid, 487 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 10:26:00,639 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [491 Valid, 697 Invalid, 487 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 401 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 10:26:00,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1351 states. [2024-11-07 10:26:00,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1351 to 1048. [2024-11-07 10:26:00,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1048 states, 937 states have (on average 1.3895410885805763) internal successors, (1302), 941 states have internal predecessors, (1302), 99 states have call successors, (99), 11 states have call predecessors, (99), 11 states have return successors, (99), 95 states have call predecessors, (99), 99 states have call successors, (99) [2024-11-07 10:26:00,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1048 states to 1048 states and 1500 transitions. [2024-11-07 10:26:00,761 INFO L78 Accepts]: Start accepts. Automaton has 1048 states and 1500 transitions. Word has length 155 [2024-11-07 10:26:00,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:26:00,761 INFO L471 AbstractCegarLoop]: Abstraction has 1048 states and 1500 transitions. [2024-11-07 10:26:00,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-07 10:26:00,761 INFO L276 IsEmpty]: Start isEmpty. Operand 1048 states and 1500 transitions. [2024-11-07 10:26:00,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-07 10:26:00,762 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:26:00,762 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:26:00,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-07 10:26:00,763 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:26:00,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:26:00,763 INFO L85 PathProgramCache]: Analyzing trace with hash 903375884, now seen corresponding path program 1 times [2024-11-07 10:26:00,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:26:00,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413539725] [2024-11-07 10:26:00,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:26:00,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:26:00,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:26:00,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:26:00,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:26:00,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:26:00,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:26:00,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:26:00,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:26:00,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:26:00,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:26:00,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:26:00,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:26:00,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:26:00,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:26:00,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:26:00,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:26:00,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:26:00,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:26:00,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 10:26:00,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:26:00,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 10:26:00,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:26:00,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 10:26:00,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:26:00,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 10:26:00,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:26:00,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-07 10:26:00,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:26:00,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-07 10:26:00,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:26:00,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 10:26:00,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:26:00,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 10:26:00,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:26:00,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 10:26:00,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:26:00,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 10:26:00,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:26:00,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-07 10:26:00,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:26:00,912 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-07 10:26:00,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:26:00,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413539725] [2024-11-07 10:26:00,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413539725] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:26:00,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:26:00,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 10:26:00,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847626359] [2024-11-07 10:26:00,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:26:00,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 10:26:00,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:26:00,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 10:26:00,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 10:26:00,913 INFO L87 Difference]: Start difference. First operand 1048 states and 1500 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-07 10:26:01,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:26:01,095 INFO L93 Difference]: Finished difference Result 1796 states and 2567 transitions. [2024-11-07 10:26:01,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 10:26:01,095 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 155 [2024-11-07 10:26:01,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:26:01,098 INFO L225 Difference]: With dead ends: 1796 [2024-11-07 10:26:01,098 INFO L226 Difference]: Without dead ends: 963 [2024-11-07 10:26:01,099 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-07 10:26:01,100 INFO L432 NwaCegarLoop]: 173 mSDtfsCounter, 51 mSDsluCounter, 414 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 587 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 10:26:01,100 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 587 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 10:26:01,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 963 states. [2024-11-07 10:26:01,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 963 to 963. [2024-11-07 10:26:01,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 963 states, 852 states have (on average 1.3767605633802817) internal successors, (1173), 856 states have internal predecessors, (1173), 99 states have call successors, (99), 11 states have call predecessors, (99), 11 states have return successors, (99), 95 states have call predecessors, (99), 99 states have call successors, (99) [2024-11-07 10:26:01,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 963 states to 963 states and 1371 transitions. [2024-11-07 10:26:01,161 INFO L78 Accepts]: Start accepts. Automaton has 963 states and 1371 transitions. Word has length 155 [2024-11-07 10:26:01,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:26:01,162 INFO L471 AbstractCegarLoop]: Abstraction has 963 states and 1371 transitions. [2024-11-07 10:26:01,163 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-07 10:26:01,163 INFO L276 IsEmpty]: Start isEmpty. Operand 963 states and 1371 transitions. [2024-11-07 10:26:01,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-07 10:26:01,164 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:26:01,164 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:26:01,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-07 10:26:01,164 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:26:01,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:26:01,164 INFO L85 PathProgramCache]: Analyzing trace with hash -1867503378, now seen corresponding path program 1 times [2024-11-07 10:26:01,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:26:01,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628172297] [2024-11-07 10:26:01,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:26:01,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:26:01,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:26:01,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:26:01,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:26:01,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:26:01,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:26:01,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:26:01,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:26:01,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:26:01,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:26:01,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:26:01,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:26:01,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:26:01,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:26:01,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:26:01,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:26:01,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:26:01,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:26:01,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 10:26:01,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:26:01,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 10:26:01,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:26:01,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 10:26:01,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:26:01,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 10:26:01,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:26:01,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-07 10:26:01,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:26:01,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-07 10:26:01,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:26:01,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 10:26:01,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:26:01,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 10:26:01,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:26:01,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 10:26:01,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:26:01,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 10:26:01,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:26:01,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-07 10:26:01,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:26:01,506 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-07 10:26:01,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:26:01,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628172297] [2024-11-07 10:26:01,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628172297] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:26:01,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:26:01,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 10:26:01,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010900662] [2024-11-07 10:26:01,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:26:01,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 10:26:01,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:26:01,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 10:26:01,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-07 10:26:01,508 INFO L87 Difference]: Start difference. First operand 963 states and 1371 transitions. Second operand has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-07 10:26:01,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:26:01,860 INFO L93 Difference]: Finished difference Result 1763 states and 2504 transitions. [2024-11-07 10:26:01,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-07 10:26:01,860 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 155 [2024-11-07 10:26:01,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:26:01,866 INFO L225 Difference]: With dead ends: 1763 [2024-11-07 10:26:01,866 INFO L226 Difference]: Without dead ends: 1344 [2024-11-07 10:26:01,867 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2024-11-07 10:26:01,867 INFO L432 NwaCegarLoop]: 194 mSDtfsCounter, 308 mSDsluCounter, 775 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 969 SdHoareTripleChecker+Invalid, 364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 10:26:01,868 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [308 Valid, 969 Invalid, 364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 340 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 10:26:01,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1344 states. [2024-11-07 10:26:01,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1344 to 1097. [2024-11-07 10:26:01,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1097 states, 986 states have (on average 1.3924949290060853) internal successors, (1373), 990 states have internal predecessors, (1373), 99 states have call successors, (99), 11 states have call predecessors, (99), 11 states have return successors, (99), 95 states have call predecessors, (99), 99 states have call successors, (99) [2024-11-07 10:26:01,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1097 states to 1097 states and 1571 transitions. [2024-11-07 10:26:01,951 INFO L78 Accepts]: Start accepts. Automaton has 1097 states and 1571 transitions. Word has length 155 [2024-11-07 10:26:01,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:26:01,951 INFO L471 AbstractCegarLoop]: Abstraction has 1097 states and 1571 transitions. [2024-11-07 10:26:01,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-07 10:26:01,951 INFO L276 IsEmpty]: Start isEmpty. Operand 1097 states and 1571 transitions. [2024-11-07 10:26:01,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-07 10:26:01,952 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:26:01,952 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:26:01,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-07 10:26:01,953 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:26:01,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:26:01,954 INFO L85 PathProgramCache]: Analyzing trace with hash 926008138, now seen corresponding path program 1 times [2024-11-07 10:26:01,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:26:01,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133940082] [2024-11-07 10:26:01,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:26:01,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:26:01,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:26:02,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:26:02,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:26:02,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:26:02,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:26:02,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:26:02,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:26:02,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:26:02,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:26:02,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:26:02,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:26:02,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:26:02,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:26:02,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:26:02,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:26:02,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:26:02,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:26:02,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 10:26:02,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:26:02,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 10:26:02,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:26:02,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 10:26:02,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:26:02,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 10:26:02,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:26:02,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-07 10:26:02,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:26:02,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-07 10:26:02,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:26:02,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 10:26:02,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:26:02,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 10:26:02,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:26:02,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 10:26:02,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:26:02,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 10:26:02,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:26:02,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-07 10:26:02,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:26:02,537 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-07 10:26:02,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:26:02,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133940082] [2024-11-07 10:26:02,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133940082] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:26:02,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:26:02,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-07 10:26:02,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964586301] [2024-11-07 10:26:02,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:26:02,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-07 10:26:02,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:26:02,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-07 10:26:02,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-11-07 10:26:02,539 INFO L87 Difference]: Start difference. First operand 1097 states and 1571 transitions. Second operand has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-07 10:26:02,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:26:02,984 INFO L93 Difference]: Finished difference Result 2153 states and 3067 transitions. [2024-11-07 10:26:02,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 10:26:02,985 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 155 [2024-11-07 10:26:02,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:26:02,992 INFO L225 Difference]: With dead ends: 2153 [2024-11-07 10:26:02,992 INFO L226 Difference]: Without dead ends: 1254 [2024-11-07 10:26:02,993 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2024-11-07 10:26:02,994 INFO L432 NwaCegarLoop]: 236 mSDtfsCounter, 245 mSDsluCounter, 790 mSDsCounter, 0 mSdLazyCounter, 565 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 1026 SdHoareTripleChecker+Invalid, 589 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 565 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 10:26:02,994 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 1026 Invalid, 589 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 565 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 10:26:02,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1254 states. [2024-11-07 10:26:03,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1254 to 1070. [2024-11-07 10:26:03,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1070 states, 959 states have (on average 1.3826903023983317) internal successors, (1326), 963 states have internal predecessors, (1326), 99 states have call successors, (99), 11 states have call predecessors, (99), 11 states have return successors, (99), 95 states have call predecessors, (99), 99 states have call successors, (99) [2024-11-07 10:26:03,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1070 states to 1070 states and 1524 transitions. [2024-11-07 10:26:03,076 INFO L78 Accepts]: Start accepts. Automaton has 1070 states and 1524 transitions. Word has length 155 [2024-11-07 10:26:03,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:26:03,076 INFO L471 AbstractCegarLoop]: Abstraction has 1070 states and 1524 transitions. [2024-11-07 10:26:03,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-07 10:26:03,077 INFO L276 IsEmpty]: Start isEmpty. Operand 1070 states and 1524 transitions. [2024-11-07 10:26:03,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-07 10:26:03,079 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:26:03,079 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:26:03,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-07 10:26:03,080 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:26:03,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:26:03,080 INFO L85 PathProgramCache]: Analyzing trace with hash -940661554, now seen corresponding path program 1 times [2024-11-07 10:26:03,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:26:03,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436304740] [2024-11-07 10:26:03,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:26:03,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:26:03,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat