./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-59.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_fillercode_fillercodesize_ps-cn-25_file-59.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', 'b8b9ffa0f086760a52bbb5b7ce872ecb50536a94abf6bed664eac71cc82e5722'] 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_fillercode_fillercodesize_ps-cn-25_file-59.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 b8b9ffa0f086760a52bbb5b7ce872ecb50536a94abf6bed664eac71cc82e5722 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 05:17:53,803 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 05:17:53,871 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-07 05:17:53,876 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 05:17:53,877 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 05:17:53,897 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 05:17:53,898 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 05:17:53,898 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 05:17:53,898 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 05:17:53,899 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 05:17:53,899 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 05:17:53,899 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 05:17:53,900 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 05:17:53,900 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 05:17:53,900 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 05:17:53,900 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 05:17:53,900 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 05:17:53,901 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 05:17:53,901 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 05:17:53,901 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 05:17:53,901 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 05:17:53,901 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 05:17:53,901 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 05:17:53,901 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 05:17:53,901 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 05:17:53,901 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 05:17:53,901 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 05:17:53,902 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 05:17:53,902 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 05:17:53,902 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 05:17:53,902 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 05:17:53,902 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 05:17:53,902 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 05:17:53,902 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 05:17:53,902 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 05:17:53,903 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 05:17:53,903 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 05:17:53,903 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 05:17:53,903 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 05:17:53,903 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 05:17:53,903 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 05:17:53,903 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 05:17:53,903 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 -> b8b9ffa0f086760a52bbb5b7ce872ecb50536a94abf6bed664eac71cc82e5722 [2024-11-07 05:17:54,089 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 05:17:54,098 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 05:17:54,100 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 05:17:54,101 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 05:17:54,101 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 05:17:54,102 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-59.i [2024-11-07 05:17:55,222 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 05:17:55,426 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 05:17:55,427 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-59.i [2024-11-07 05:17:55,435 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/10d879d87/7cd67b783aad47c5bd83e3ea29fa8b65/FLAGc2f1e66a8 [2024-11-07 05:17:55,449 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/10d879d87/7cd67b783aad47c5bd83e3ea29fa8b65 [2024-11-07 05:17:55,452 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 05:17:55,453 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 05:17:55,455 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 05:17:55,455 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 05:17:55,458 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 05:17:55,459 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 05:17:55" (1/1) ... [2024-11-07 05:17:55,461 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36d482a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:17:55, skipping insertion in model container [2024-11-07 05:17:55,461 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 05:17:55" (1/1) ... [2024-11-07 05:17:55,476 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 05:17:55,571 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_fillercode_fillercodesize_ps-cn-25_file-59.i[915,928] [2024-11-07 05:17:55,614 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 05:17:55,621 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 05:17:55,628 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_fillercode_fillercodesize_ps-cn-25_file-59.i[915,928] [2024-11-07 05:17:55,656 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 05:17:55,675 INFO L204 MainTranslator]: Completed translation [2024-11-07 05:17:55,676 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:17:55 WrapperNode [2024-11-07 05:17:55,676 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 05:17:55,677 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 05:17:55,677 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 05:17:55,677 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 05:17:55,681 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:17:55" (1/1) ... [2024-11-07 05:17:55,694 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:17:55" (1/1) ... [2024-11-07 05:17:55,737 INFO L138 Inliner]: procedures = 26, calls = 40, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 202 [2024-11-07 05:17:55,737 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 05:17:55,738 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 05:17:55,738 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 05:17:55,739 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 05:17:55,745 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:17:55" (1/1) ... [2024-11-07 05:17:55,745 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:17:55" (1/1) ... [2024-11-07 05:17:55,754 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:17:55" (1/1) ... [2024-11-07 05:17:55,777 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-07 05:17:55,778 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:17:55" (1/1) ... [2024-11-07 05:17:55,778 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:17:55" (1/1) ... [2024-11-07 05:17:55,784 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:17:55" (1/1) ... [2024-11-07 05:17:55,787 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:17:55" (1/1) ... [2024-11-07 05:17:55,789 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:17:55" (1/1) ... [2024-11-07 05:17:55,790 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:17:55" (1/1) ... [2024-11-07 05:17:55,792 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 05:17:55,793 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 05:17:55,793 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 05:17:55,793 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 05:17:55,794 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:17:55" (1/1) ... [2024-11-07 05:17:55,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 05:17:55,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 05:17:55,821 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 05:17:55,823 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 05:17:55,841 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 05:17:55,841 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 05:17:55,842 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 05:17:55,842 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 05:17:55,842 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 05:17:55,842 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 05:17:55,919 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 05:17:55,920 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 05:17:56,322 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-11-07 05:17:56,322 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 05:17:56,332 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 05:17:56,333 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 05:17:56,333 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 05:17:56 BoogieIcfgContainer [2024-11-07 05:17:56,333 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 05:17:56,335 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 05:17:56,335 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 05:17:56,339 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 05:17:56,340 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 05:17:55" (1/3) ... [2024-11-07 05:17:56,340 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29ee45a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 05:17:56, skipping insertion in model container [2024-11-07 05:17:56,340 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:17:55" (2/3) ... [2024-11-07 05:17:56,341 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29ee45a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 05:17:56, skipping insertion in model container [2024-11-07 05:17:56,341 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 05:17:56" (3/3) ... [2024-11-07 05:17:56,342 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-25_file-59.i [2024-11-07 05:17:56,352 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 05:17:56,353 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 05:17:56,397 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 05:17:56,405 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;@45d19c35, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 05:17:56,405 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 05:17:56,410 INFO L276 IsEmpty]: Start isEmpty. Operand has 86 states, 56 states have (on average 1.4285714285714286) internal successors, (80), 57 states have internal predecessors, (80), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-07 05:17:56,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-11-07 05:17:56,418 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:17:56,419 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:17:56,419 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:17:56,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:17:56,423 INFO L85 PathProgramCache]: Analyzing trace with hash -1810492343, now seen corresponding path program 1 times [2024-11-07 05:17:56,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 05:17:56,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239680494] [2024-11-07 05:17:56,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:17:56,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 05:17:56,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:17:56,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 05:17:56,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:17:56,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 05:17:56,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:17:56,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 05:17:56,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:17:56,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 05:17:56,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:17:56,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 05:17:56,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:17:56,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 05:17:56,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:17:56,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-07 05:17:56,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:17:56,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 05:17:56,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:17:56,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 05:17:56,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:17:56,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-07 05:17:56,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:17:56,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 05:17:56,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:17:56,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 05:17:56,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:17:56,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 05:17:56,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:17:56,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 05:17:56,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:17:56,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 05:17:56,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:17:56,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 05:17:56,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:17:56,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 05:17:56,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:17:56,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-07 05:17:56,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:17:56,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-07 05:17:56,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:17:56,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-07 05:17:56,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:17:56,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-07 05:17:56,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:17:56,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-07 05:17:56,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:17:56,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-07 05:17:56,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:17:56,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-07 05:17:56,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:17:56,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-07 05:17:56,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:17:56,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-07 05:17:56,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:17:56,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-07 05:17:56,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:17:56,776 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2024-11-07 05:17:56,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 05:17:56,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239680494] [2024-11-07 05:17:56,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239680494] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 05:17:56,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 05:17:56,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 05:17:56,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196452635] [2024-11-07 05:17:56,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 05:17:56,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 05:17:56,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 05:17:56,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 05:17:56,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 05:17:56,805 INFO L87 Difference]: Start difference. First operand has 86 states, 56 states have (on average 1.4285714285714286) internal successors, (80), 57 states have internal predecessors, (80), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) Second operand has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 2 states have call successors, (27) [2024-11-07 05:17:56,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 05:17:56,824 INFO L93 Difference]: Finished difference Result 165 states and 289 transitions. [2024-11-07 05:17:56,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 05:17:56,826 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 2 states have call successors, (27) Word has length 175 [2024-11-07 05:17:56,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 05:17:56,832 INFO L225 Difference]: With dead ends: 165 [2024-11-07 05:17:56,832 INFO L226 Difference]: Without dead ends: 82 [2024-11-07 05:17:56,835 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 83 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 05:17:56,838 INFO L432 NwaCegarLoop]: 125 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, 125 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 05:17:56,840 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 05:17:56,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-11-07 05:17:56,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2024-11-07 05:17:56,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 53 states have (on average 1.3396226415094339) internal successors, (71), 53 states have internal predecessors, (71), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-07 05:17:56,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 125 transitions. [2024-11-07 05:17:56,872 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 125 transitions. Word has length 175 [2024-11-07 05:17:56,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 05:17:56,872 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 125 transitions. [2024-11-07 05:17:56,872 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 2 states have call successors, (27) [2024-11-07 05:17:56,872 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 125 transitions. [2024-11-07 05:17:56,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-11-07 05:17:56,874 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:17:56,874 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:17:56,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 05:17:56,875 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:17:56,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:17:56,875 INFO L85 PathProgramCache]: Analyzing trace with hash 1780209599, now seen corresponding path program 1 times [2024-11-07 05:17:56,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 05:17:56,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907455334] [2024-11-07 05:17:56,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:17:56,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 05:17:56,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:17:57,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 05:17:57,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:17:57,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 05:17:57,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:17:57,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 05:17:57,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:17:57,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 05:17:57,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:17:57,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 05:17:57,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:17:57,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 05:17:57,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:17:57,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-07 05:17:57,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:17:57,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 05:17:57,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:17:57,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 05:17:57,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:17:57,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-07 05:17:57,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:17:57,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 05:17:57,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:17:57,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 05:17:57,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:17:57,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 05:17:57,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:17:57,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 05:17:57,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:17:57,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 05:17:57,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:17:57,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 05:17:57,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:17:57,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 05:17:57,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:17:57,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-07 05:17:57,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:17:57,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-07 05:17:57,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:17:57,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-07 05:17:57,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:17:57,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-07 05:17:57,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:17:57,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-07 05:17:57,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:17:57,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-07 05:17:57,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:17:57,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-07 05:17:57,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:17:57,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-07 05:17:57,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:17:57,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-07 05:17:57,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:17:57,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-07 05:17:57,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:17:57,330 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2024-11-07 05:17:57,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 05:17:57,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907455334] [2024-11-07 05:17:57,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907455334] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 05:17:57,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 05:17:57,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 05:17:57,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671890281] [2024-11-07 05:17:57,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 05:17:57,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 05:17:57,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 05:17:57,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 05:17:57,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 05:17:57,336 INFO L87 Difference]: Start difference. First operand 82 states and 125 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-11-07 05:17:57,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 05:17:57,514 INFO L93 Difference]: Finished difference Result 225 states and 343 transitions. [2024-11-07 05:17:57,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 05:17:57,517 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 175 [2024-11-07 05:17:57,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 05:17:57,521 INFO L225 Difference]: With dead ends: 225 [2024-11-07 05:17:57,522 INFO L226 Difference]: Without dead ends: 146 [2024-11-07 05:17:57,522 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 05:17:57,524 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 96 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 309 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.1s IncrementalHoareTripleChecker+Time [2024-11-07 05:17:57,525 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 309 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 05:17:57,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2024-11-07 05:17:57,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 143. [2024-11-07 05:17:57,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 93 states have (on average 1.3333333333333333) internal successors, (124), 94 states have internal predecessors, (124), 47 states have call successors, (47), 2 states have call predecessors, (47), 2 states have return successors, (47), 46 states have call predecessors, (47), 47 states have call successors, (47) [2024-11-07 05:17:57,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 218 transitions. [2024-11-07 05:17:57,556 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 218 transitions. Word has length 175 [2024-11-07 05:17:57,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 05:17:57,557 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 218 transitions. [2024-11-07 05:17:57,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-11-07 05:17:57,557 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 218 transitions. [2024-11-07 05:17:57,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-11-07 05:17:57,559 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:17:57,559 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:17:57,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 05:17:57,560 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:17:57,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:17:57,560 INFO L85 PathProgramCache]: Analyzing trace with hash 769092349, now seen corresponding path program 1 times [2024-11-07 05:17:57,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 05:17:57,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615770485] [2024-11-07 05:17:57,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:17:57,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 05:17:57,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:17:57,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 05:17:57,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:17:57,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 05:17:57,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:17:57,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 05:17:57,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:17:57,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 05:17:57,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:17:57,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 05:17:57,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:17:57,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 05:17:57,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:17:57,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-07 05:17:57,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:17:57,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 05:17:57,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:17:57,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 05:17:57,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:17:57,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-07 05:17:57,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:17:57,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 05:17:57,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:17:57,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 05:17:57,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:17:57,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 05:17:57,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:17:57,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 05:17:57,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:17:57,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 05:17:57,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:17:57,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 05:17:57,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:17:57,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 05:17:57,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:17:57,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-07 05:17:57,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:17:57,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-07 05:17:57,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:17:57,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-07 05:17:57,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:17:57,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-07 05:17:57,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:17:57,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-07 05:17:57,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:17:57,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-07 05:17:57,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:17:57,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-07 05:17:57,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:17:57,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-07 05:17:57,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:17:57,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-07 05:17:57,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:17:57,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-07 05:17:57,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:17:57,943 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2024-11-07 05:17:57,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 05:17:57,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615770485] [2024-11-07 05:17:57,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615770485] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 05:17:57,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 05:17:57,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 05:17:57,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149288932] [2024-11-07 05:17:57,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 05:17:57,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 05:17:57,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 05:17:57,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 05:17:57,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 05:17:57,946 INFO L87 Difference]: Start difference. First operand 143 states and 218 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-11-07 05:17:57,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 05:17:57,991 INFO L93 Difference]: Finished difference Result 422 states and 647 transitions. [2024-11-07 05:17:57,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 05:17:57,992 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 175 [2024-11-07 05:17:57,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 05:17:57,995 INFO L225 Difference]: With dead ends: 422 [2024-11-07 05:17:57,995 INFO L226 Difference]: Without dead ends: 282 [2024-11-07 05:17:58,000 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 55 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 05:17:58,000 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 71 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 05:17:58,001 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 273 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 05:17:58,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2024-11-07 05:17:58,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 280. [2024-11-07 05:17:58,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 181 states have (on average 1.3314917127071824) internal successors, (241), 183 states have internal predecessors, (241), 94 states have call successors, (94), 4 states have call predecessors, (94), 4 states have return successors, (94), 92 states have call predecessors, (94), 94 states have call successors, (94) [2024-11-07 05:17:58,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 429 transitions. [2024-11-07 05:17:58,058 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 429 transitions. Word has length 175 [2024-11-07 05:17:58,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 05:17:58,058 INFO L471 AbstractCegarLoop]: Abstraction has 280 states and 429 transitions. [2024-11-07 05:17:58,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-11-07 05:17:58,059 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 429 transitions. [2024-11-07 05:17:58,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-11-07 05:17:58,062 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:17:58,062 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:17:58,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 05:17:58,063 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:17:58,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:17:58,063 INFO L85 PathProgramCache]: Analyzing trace with hash -1590851278, now seen corresponding path program 1 times [2024-11-07 05:17:58,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 05:17:58,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824300732] [2024-11-07 05:17:58,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:17:58,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 05:17:58,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:17:58,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 05:17:58,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:17:58,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 05:17:58,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:17:58,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 05:17:58,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:17:58,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 05:17:58,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:17:58,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 05:17:58,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:17:58,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 05:17:58,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:17:58,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-07 05:17:58,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:17:58,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 05:17:58,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:17:58,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 05:17:58,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:17:58,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-07 05:17:58,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:17:58,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 05:17:58,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:17:58,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 05:17:58,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:17:58,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 05:17:58,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:17:58,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 05:17:58,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:17:58,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 05:17:58,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:17:58,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 05:17:58,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:17:58,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 05:17:58,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:17:58,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-07 05:17:58,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:17:58,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-07 05:17:58,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:17:58,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-07 05:17:58,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:17:58,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-07 05:17:58,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:17:58,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-07 05:17:58,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:17:58,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-07 05:17:58,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:17:58,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-07 05:17:58,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:17:58,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-07 05:17:58,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:17:58,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-07 05:17:58,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:17:58,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-07 05:17:58,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:17:58,255 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2024-11-07 05:17:58,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 05:17:58,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824300732] [2024-11-07 05:17:58,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824300732] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 05:17:58,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 05:17:58,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 05:17:58,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528156363] [2024-11-07 05:17:58,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 05:17:58,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 05:17:58,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 05:17:58,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 05:17:58,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 05:17:58,257 INFO L87 Difference]: Start difference. First operand 280 states and 429 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-11-07 05:17:58,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 05:17:58,295 INFO L93 Difference]: Finished difference Result 557 states and 855 transitions. [2024-11-07 05:17:58,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 05:17:58,298 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 176 [2024-11-07 05:17:58,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 05:17:58,302 INFO L225 Difference]: With dead ends: 557 [2024-11-07 05:17:58,303 INFO L226 Difference]: Without dead ends: 280 [2024-11-07 05:17:58,304 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 58 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 05:17:58,305 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 0 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 05:17:58,305 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 237 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 05:17:58,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2024-11-07 05:17:58,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 279. [2024-11-07 05:17:58,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 180 states have (on average 1.3111111111111111) internal successors, (236), 182 states have internal predecessors, (236), 94 states have call successors, (94), 4 states have call predecessors, (94), 4 states have return successors, (94), 92 states have call predecessors, (94), 94 states have call successors, (94) [2024-11-07 05:17:58,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 424 transitions. [2024-11-07 05:17:58,340 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 424 transitions. Word has length 176 [2024-11-07 05:17:58,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 05:17:58,340 INFO L471 AbstractCegarLoop]: Abstraction has 279 states and 424 transitions. [2024-11-07 05:17:58,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-11-07 05:17:58,341 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 424 transitions. [2024-11-07 05:17:58,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-11-07 05:17:58,342 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:17:58,342 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:17:58,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 05:17:58,342 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:17:58,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:17:58,343 INFO L85 PathProgramCache]: Analyzing trace with hash 1692998768, now seen corresponding path program 1 times [2024-11-07 05:17:58,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 05:17:58,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13657322] [2024-11-07 05:17:58,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:17:58,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 05:17:58,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:17:58,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 05:17:58,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:17:58,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 05:17:58,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:17:58,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 05:17:58,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:17:58,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 05:17:58,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:17:58,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 05:17:58,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:17:58,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 05:17:58,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:17:58,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-07 05:17:58,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:17:58,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 05:17:58,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:17:58,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 05:17:58,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:17:58,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-07 05:17:58,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:17:58,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 05:17:58,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:17:58,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 05:17:58,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:17:58,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 05:17:58,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:17:58,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 05:17:58,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:17:58,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 05:17:58,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:17:58,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 05:17:58,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:17:58,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 05:17:58,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:17:58,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-07 05:17:58,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:17:58,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-07 05:17:58,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:17:58,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-07 05:17:58,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:17:58,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-07 05:17:58,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:17:58,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-07 05:17:58,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:17:58,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-07 05:17:58,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:17:58,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-07 05:17:58,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:17:58,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-07 05:17:58,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:17:58,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-07 05:17:58,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:17:58,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-07 05:17:58,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:17:58,595 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2024-11-07 05:17:58,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 05:17:58,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13657322] [2024-11-07 05:17:58,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13657322] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 05:17:58,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 05:17:58,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 05:17:58,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662778699] [2024-11-07 05:17:58,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 05:17:58,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 05:17:58,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 05:17:58,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 05:17:58,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 05:17:58,597 INFO L87 Difference]: Start difference. First operand 279 states and 424 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-11-07 05:17:58,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 05:17:58,719 INFO L93 Difference]: Finished difference Result 687 states and 1040 transitions. [2024-11-07 05:17:58,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 05:17:58,719 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 176 [2024-11-07 05:17:58,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 05:17:58,722 INFO L225 Difference]: With dead ends: 687 [2024-11-07 05:17:58,722 INFO L226 Difference]: Without dead ends: 411 [2024-11-07 05:17:58,723 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 05:17:58,724 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 85 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 05:17:58,724 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 356 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 05:17:58,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2024-11-07 05:17:58,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 358. [2024-11-07 05:17:58,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 358 states, 230 states have (on average 1.2695652173913043) internal successors, (292), 232 states have internal predecessors, (292), 121 states have call successors, (121), 6 states have call predecessors, (121), 6 states have return successors, (121), 119 states have call predecessors, (121), 121 states have call successors, (121) [2024-11-07 05:17:58,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 534 transitions. [2024-11-07 05:17:58,761 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 534 transitions. Word has length 176 [2024-11-07 05:17:58,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 05:17:58,762 INFO L471 AbstractCegarLoop]: Abstraction has 358 states and 534 transitions. [2024-11-07 05:17:58,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-11-07 05:17:58,762 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 534 transitions. [2024-11-07 05:17:58,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-07 05:17:58,764 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:17:58,764 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:17:58,764 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 05:17:58,764 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:17:58,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:17:58,764 INFO L85 PathProgramCache]: Analyzing trace with hash -1751997195, now seen corresponding path program 1 times [2024-11-07 05:17:58,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 05:17:58,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565453966] [2024-11-07 05:17:58,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:17:58,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 05:17:58,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:17:58,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 05:17:58,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:17:58,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 05:17:58,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:17:58,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 05:17:58,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:17:58,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 05:17:58,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:17:58,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 05:17:58,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:17:58,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 05:17:58,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:17:58,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-07 05:17:58,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:17:58,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 05:17:58,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:17:58,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 05:17:58,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:17:58,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-07 05:17:58,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:17:58,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 05:17:58,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:17:58,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 05:17:58,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:17:58,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 05:17:58,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:17:58,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 05:17:58,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:17:58,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 05:17:58,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:17:58,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 05:17:58,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:17:58,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 05:17:58,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:17:58,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-07 05:17:58,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:17:58,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-07 05:17:58,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:17:58,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-07 05:17:58,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:17:58,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-07 05:17:58,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:17:58,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-07 05:17:58,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:17:58,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-07 05:17:58,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:17:59,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-07 05:17:59,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:17:59,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-07 05:17:59,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:17:59,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-07 05:17:59,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:17:59,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-07 05:17:59,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:17:59,006 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2024-11-07 05:17:59,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 05:17:59,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565453966] [2024-11-07 05:17:59,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565453966] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 05:17:59,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 05:17:59,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 05:17:59,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336841051] [2024-11-07 05:17:59,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 05:17:59,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 05:17:59,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 05:17:59,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 05:17:59,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 05:17:59,009 INFO L87 Difference]: Start difference. First operand 358 states and 534 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-11-07 05:17:59,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 05:17:59,073 INFO L93 Difference]: Finished difference Result 909 states and 1348 transitions. [2024-11-07 05:17:59,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 05:17:59,074 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 177 [2024-11-07 05:17:59,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 05:17:59,078 INFO L225 Difference]: With dead ends: 909 [2024-11-07 05:17:59,078 INFO L226 Difference]: Without dead ends: 610 [2024-11-07 05:17:59,079 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 56 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 05:17:59,080 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 87 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 05:17:59,080 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 283 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 05:17:59,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2024-11-07 05:17:59,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 604. [2024-11-07 05:17:59,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 604 states, 408 states have (on average 1.2818627450980393) internal successors, (523), 414 states have internal predecessors, (523), 185 states have call successors, (185), 10 states have call predecessors, (185), 10 states have return successors, (185), 179 states have call predecessors, (185), 185 states have call successors, (185) [2024-11-07 05:17:59,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 893 transitions. [2024-11-07 05:17:59,162 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 893 transitions. Word has length 177 [2024-11-07 05:17:59,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 05:17:59,164 INFO L471 AbstractCegarLoop]: Abstraction has 604 states and 893 transitions. [2024-11-07 05:17:59,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-11-07 05:17:59,165 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 893 transitions. [2024-11-07 05:17:59,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-07 05:17:59,166 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:17:59,166 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:17:59,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 05:17:59,167 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:17:59,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:17:59,167 INFO L85 PathProgramCache]: Analyzing trace with hash 854026359, now seen corresponding path program 1 times [2024-11-07 05:17:59,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 05:17:59,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34040314] [2024-11-07 05:17:59,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:17:59,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 05:17:59,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:17:59,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 05:17:59,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:17:59,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 05:17:59,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:17:59,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 05:17:59,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:17:59,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 05:17:59,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:17:59,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 05:17:59,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:17:59,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 05:17:59,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:17:59,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-07 05:17:59,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:17:59,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 05:17:59,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:17:59,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 05:17:59,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:17:59,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-07 05:17:59,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:17:59,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 05:17:59,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:17:59,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 05:17:59,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:17:59,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 05:17:59,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:17:59,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 05:17:59,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:17:59,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 05:17:59,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:17:59,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 05:17:59,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:17:59,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 05:17:59,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:17:59,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-07 05:17:59,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:17:59,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-07 05:17:59,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:17:59,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-07 05:17:59,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:17:59,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-07 05:17:59,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:17:59,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-07 05:17:59,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:17:59,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-07 05:17:59,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:17:59,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-07 05:17:59,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:17:59,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-07 05:17:59,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:17:59,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-07 05:17:59,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:17:59,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-07 05:17:59,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:17:59,434 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2024-11-07 05:17:59,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 05:17:59,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34040314] [2024-11-07 05:17:59,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34040314] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 05:17:59,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 05:17:59,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 05:17:59,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019969870] [2024-11-07 05:17:59,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 05:17:59,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 05:17:59,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 05:17:59,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 05:17:59,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 05:17:59,446 INFO L87 Difference]: Start difference. First operand 604 states and 893 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-11-07 05:17:59,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 05:17:59,628 INFO L93 Difference]: Finished difference Result 1666 states and 2488 transitions. [2024-11-07 05:17:59,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 05:17:59,629 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 177 [2024-11-07 05:17:59,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 05:17:59,635 INFO L225 Difference]: With dead ends: 1666 [2024-11-07 05:17:59,636 INFO L226 Difference]: Without dead ends: 1168 [2024-11-07 05:17:59,637 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 05:17:59,638 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 110 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 05:17:59,638 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 344 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 05:17:59,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1168 states. [2024-11-07 05:17:59,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1168 to 1100. [2024-11-07 05:17:59,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1100 states, 738 states have (on average 1.2777777777777777) internal successors, (943), 750 states have internal predecessors, (943), 343 states have call successors, (343), 18 states have call predecessors, (343), 18 states have return successors, (343), 331 states have call predecessors, (343), 343 states have call successors, (343) [2024-11-07 05:17:59,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1100 states to 1100 states and 1629 transitions. [2024-11-07 05:17:59,763 INFO L78 Accepts]: Start accepts. Automaton has 1100 states and 1629 transitions. Word has length 177 [2024-11-07 05:17:59,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 05:17:59,763 INFO L471 AbstractCegarLoop]: Abstraction has 1100 states and 1629 transitions. [2024-11-07 05:17:59,763 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-11-07 05:17:59,763 INFO L276 IsEmpty]: Start isEmpty. Operand 1100 states and 1629 transitions. [2024-11-07 05:17:59,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-11-07 05:17:59,765 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:17:59,765 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:17:59,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 05:17:59,765 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:17:59,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:17:59,765 INFO L85 PathProgramCache]: Analyzing trace with hash 2098796613, now seen corresponding path program 1 times [2024-11-07 05:17:59,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 05:17:59,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945205668] [2024-11-07 05:17:59,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:17:59,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 05:17:59,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:18:00,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 05:18:00,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:18:00,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 05:18:00,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:18:00,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 05:18:00,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:18:00,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 05:18:00,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:18:00,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 05:18:00,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:18:00,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 05:18:00,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:18:00,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-07 05:18:00,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:18:00,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 05:18:00,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:18:00,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 05:18:00,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:18:00,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-07 05:18:00,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:18:00,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 05:18:00,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:18:00,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 05:18:00,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:18:00,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 05:18:00,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:18:00,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 05:18:00,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:18:00,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 05:18:00,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:18:00,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 05:18:00,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:18:00,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 05:18:00,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:18:00,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-07 05:18:00,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:18:00,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-07 05:18:00,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:18:00,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-07 05:18:00,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:18:00,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-07 05:18:00,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:18:00,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-07 05:18:00,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:18:00,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-07 05:18:00,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:18:00,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-07 05:18:00,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:18:00,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-07 05:18:00,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:18:00,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-07 05:18:00,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:18:00,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-07 05:18:00,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:18:00,214 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 36 proven. 42 refuted. 0 times theorem prover too weak. 1326 trivial. 0 not checked. [2024-11-07 05:18:00,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 05:18:00,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945205668] [2024-11-07 05:18:00,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945205668] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 05:18:00,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [915206683] [2024-11-07 05:18:00,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:18:00,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 05:18:00,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 05:18:00,218 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 05:18:00,219 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-07 05:18:00,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:18:00,343 INFO L255 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-07 05:18:00,353 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 05:18:00,937 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 722 proven. 42 refuted. 0 times theorem prover too weak. 640 trivial. 0 not checked. [2024-11-07 05:18:00,937 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 05:18:01,335 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 36 proven. 42 refuted. 0 times theorem prover too weak. 1326 trivial. 0 not checked. [2024-11-07 05:18:01,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [915206683] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 05:18:01,335 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 05:18:01,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 8] total 18 [2024-11-07 05:18:01,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869792034] [2024-11-07 05:18:01,336 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 05:18:01,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-07 05:18:01,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 05:18:01,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-07 05:18:01,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=239, Unknown=0, NotChecked=0, Total=306 [2024-11-07 05:18:01,337 INFO L87 Difference]: Start difference. First operand 1100 states and 1629 transitions. Second operand has 18 states, 18 states have (on average 6.722222222222222) internal successors, (121), 18 states have internal predecessors, (121), 5 states have call successors, (68), 3 states have call predecessors, (68), 6 states have return successors, (69), 5 states have call predecessors, (69), 5 states have call successors, (69) [2024-11-07 05:18:02,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 05:18:02,515 INFO L93 Difference]: Finished difference Result 3558 states and 5142 transitions. [2024-11-07 05:18:02,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-11-07 05:18:02,516 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 6.722222222222222) internal successors, (121), 18 states have internal predecessors, (121), 5 states have call successors, (68), 3 states have call predecessors, (68), 6 states have return successors, (69), 5 states have call predecessors, (69), 5 states have call successors, (69) Word has length 178 [2024-11-07 05:18:02,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 05:18:02,534 INFO L225 Difference]: With dead ends: 3558 [2024-11-07 05:18:02,534 INFO L226 Difference]: Without dead ends: 2564 [2024-11-07 05:18:02,539 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 442 GetRequests, 400 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 439 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=366, Invalid=1440, Unknown=0, NotChecked=0, Total=1806 [2024-11-07 05:18:02,540 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 520 mSDsluCounter, 753 mSDsCounter, 0 mSdLazyCounter, 928 mSolverCounterSat, 275 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 560 SdHoareTripleChecker+Valid, 905 SdHoareTripleChecker+Invalid, 1203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 275 IncrementalHoareTripleChecker+Valid, 928 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-07 05:18:02,540 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [560 Valid, 905 Invalid, 1203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [275 Valid, 928 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-07 05:18:02,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2564 states. [2024-11-07 05:18:02,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2564 to 1240. [2024-11-07 05:18:02,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1240 states, 861 states have (on average 1.2473867595818815) internal successors, (1074), 873 states have internal predecessors, (1074), 343 states have call successors, (343), 35 states have call predecessors, (343), 35 states have return successors, (343), 331 states have call predecessors, (343), 343 states have call successors, (343) [2024-11-07 05:18:02,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1240 states to 1240 states and 1760 transitions. [2024-11-07 05:18:02,698 INFO L78 Accepts]: Start accepts. Automaton has 1240 states and 1760 transitions. Word has length 178 [2024-11-07 05:18:02,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 05:18:02,699 INFO L471 AbstractCegarLoop]: Abstraction has 1240 states and 1760 transitions. [2024-11-07 05:18:02,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 6.722222222222222) internal successors, (121), 18 states have internal predecessors, (121), 5 states have call successors, (68), 3 states have call predecessors, (68), 6 states have return successors, (69), 5 states have call predecessors, (69), 5 states have call successors, (69) [2024-11-07 05:18:02,699 INFO L276 IsEmpty]: Start isEmpty. Operand 1240 states and 1760 transitions. [2024-11-07 05:18:02,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-11-07 05:18:02,701 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:18:02,701 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:18:02,716 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-07 05:18:02,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 05:18:02,902 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:18:02,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:18:02,902 INFO L85 PathProgramCache]: Analyzing trace with hash 323789251, now seen corresponding path program 1 times [2024-11-07 05:18:02,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 05:18:02,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000467967] [2024-11-07 05:18:02,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:18:02,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 05:18:03,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-07 05:18:03,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [915040585] [2024-11-07 05:18:03,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:18:03,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 05:18:03,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 05:18:03,039 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 05:18:03,041 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-07 05:18:03,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:18:03,169 INFO L255 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-11-07 05:18:03,178 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 05:18:05,186 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 338 proven. 300 refuted. 0 times theorem prover too weak. 766 trivial. 0 not checked. [2024-11-07 05:18:05,187 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 05:18:40,236 WARN L286 SmtUtils]: Spent 5.09s on a formula simplification that was a NOOP. DAG size: 49 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-07 05:18:51,602 WARN L286 SmtUtils]: Spent 6.85s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)