./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-86.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_fillercodestructure_normal_file-86.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', '6148f57821a61bb66da81c5e9fb13250aa14d609ed7f31d3b9237ae5f0b8d661'] 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_fillercodestructure_normal_file-86.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 6148f57821a61bb66da81c5e9fb13250aa14d609ed7f31d3b9237ae5f0b8d661 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 07:31:45,810 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 07:31:45,886 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-07 07:31:45,895 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 07:31:45,896 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 07:31:45,929 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 07:31:45,930 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 07:31:45,930 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 07:31:45,931 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 07:31:45,931 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 07:31:45,932 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 07:31:45,932 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 07:31:45,932 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 07:31:45,933 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 07:31:45,933 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 07:31:45,934 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 07:31:45,934 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 07:31:45,935 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 07:31:45,935 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 07:31:45,935 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 07:31:45,935 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 07:31:45,935 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 07:31:45,935 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 07:31:45,935 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 07:31:45,935 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 07:31:45,935 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 07:31:45,936 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 07:31:45,936 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 07:31:45,936 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 07:31:45,936 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 07:31:45,936 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 07:31:45,937 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 07:31:45,937 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 07:31:45,937 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 07:31:45,937 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 07:31:45,937 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 07:31:45,937 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 07:31:45,938 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 07:31:45,938 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 07:31:45,938 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 07:31:45,938 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 07:31:45,938 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 07:31:45,938 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 -> 6148f57821a61bb66da81c5e9fb13250aa14d609ed7f31d3b9237ae5f0b8d661 [2024-11-07 07:31:46,263 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 07:31:46,274 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 07:31:46,277 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 07:31:46,278 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 07:31:46,278 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 07:31:46,279 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-86.i [2024-11-07 07:31:47,537 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 07:31:47,768 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 07:31:47,768 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-86.i [2024-11-07 07:31:47,781 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/51a8e4e65/4dbdf3ff18e64759b1307491902da526/FLAGaddcdd613 [2024-11-07 07:31:47,801 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/51a8e4e65/4dbdf3ff18e64759b1307491902da526 [2024-11-07 07:31:47,804 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 07:31:47,806 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 07:31:47,809 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 07:31:47,809 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 07:31:47,813 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 07:31:47,814 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 07:31:47" (1/1) ... [2024-11-07 07:31:47,815 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@627bae2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:31:47, skipping insertion in model container [2024-11-07 07:31:47,817 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 07:31:47" (1/1) ... [2024-11-07 07:31:47,834 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 07:31:47,972 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_fillercodestructure_normal_file-86.i[913,926] [2024-11-07 07:31:48,043 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 07:31:48,059 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 07:31:48,068 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_fillercodestructure_normal_file-86.i[913,926] [2024-11-07 07:31:48,112 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 07:31:48,131 INFO L204 MainTranslator]: Completed translation [2024-11-07 07:31:48,132 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:31:48 WrapperNode [2024-11-07 07:31:48,133 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 07:31:48,134 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 07:31:48,134 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 07:31:48,134 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 07:31:48,140 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:31:48" (1/1) ... [2024-11-07 07:31:48,148 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:31:48" (1/1) ... [2024-11-07 07:31:48,183 INFO L138 Inliner]: procedures = 26, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 127 [2024-11-07 07:31:48,187 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 07:31:48,192 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 07:31:48,192 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 07:31:48,193 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 07:31:48,202 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:31:48" (1/1) ... [2024-11-07 07:31:48,203 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:31:48" (1/1) ... [2024-11-07 07:31:48,206 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:31:48" (1/1) ... [2024-11-07 07:31:48,224 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 07:31:48,224 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:31:48" (1/1) ... [2024-11-07 07:31:48,224 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:31:48" (1/1) ... [2024-11-07 07:31:48,230 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:31:48" (1/1) ... [2024-11-07 07:31:48,237 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:31:48" (1/1) ... [2024-11-07 07:31:48,239 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:31:48" (1/1) ... [2024-11-07 07:31:48,242 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:31:48" (1/1) ... [2024-11-07 07:31:48,246 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 07:31:48,246 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 07:31:48,247 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 07:31:48,247 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 07:31:48,248 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:31:48" (1/1) ... [2024-11-07 07:31:48,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 07:31:48,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 07:31:48,285 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 07:31:48,290 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 07:31:48,314 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 07:31:48,314 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 07:31:48,314 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 07:31:48,315 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 07:31:48,315 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 07:31:48,315 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 07:31:48,400 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 07:31:48,401 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 07:31:48,849 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-11-07 07:31:48,850 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 07:31:48,861 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 07:31:48,861 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 07:31:48,862 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:31:48 BoogieIcfgContainer [2024-11-07 07:31:48,862 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 07:31:48,865 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 07:31:48,865 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 07:31:48,869 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 07:31:48,870 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 07:31:47" (1/3) ... [2024-11-07 07:31:48,870 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39d3c8a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 07:31:48, skipping insertion in model container [2024-11-07 07:31:48,871 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:31:48" (2/3) ... [2024-11-07 07:31:48,871 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39d3c8a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 07:31:48, skipping insertion in model container [2024-11-07 07:31:48,871 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:31:48" (3/3) ... [2024-11-07 07:31:48,873 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_normal_file-86.i [2024-11-07 07:31:48,887 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 07:31:48,888 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 07:31:48,952 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 07:31:48,965 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;@63873eab, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 07:31:48,965 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 07:31:48,970 INFO L276 IsEmpty]: Start isEmpty. Operand has 55 states, 37 states have (on average 1.4054054054054055) internal successors, (52), 38 states have internal predecessors, (52), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-07 07:31:48,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-07 07:31:48,979 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:31:48,979 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:31:48,980 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:31:48,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:31:48,984 INFO L85 PathProgramCache]: Analyzing trace with hash -1399999483, now seen corresponding path program 1 times [2024-11-07 07:31:48,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:31:48,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611071425] [2024-11-07 07:31:48,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:31:48,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:31:49,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:31:49,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 07:31:49,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:31:49,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 07:31:49,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:31:49,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 07:31:49,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:31:49,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 07:31:49,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:31:49,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 07:31:49,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:31:49,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 07:31:49,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:31:49,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 07:31:49,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:31:49,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 07:31:49,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:31:49,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 07:31:49,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:31:49,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 07:31:49,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:31:49,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 07:31:49,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:31:49,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 07:31:49,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:31:49,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-07 07:31:49,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:31:49,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 07:31:49,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:31:49,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-07 07:31:49,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:31:49,391 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-07 07:31:49,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:31:49,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611071425] [2024-11-07 07:31:49,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611071425] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:31:49,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:31:49,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 07:31:49,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351282955] [2024-11-07 07:31:49,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:31:49,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 07:31:49,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:31:49,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 07:31:49,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 07:31:49,426 INFO L87 Difference]: Start difference. First operand has 55 states, 37 states have (on average 1.4054054054054055) internal successors, (52), 38 states have internal predecessors, (52), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-07 07:31:49,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:31:49,450 INFO L93 Difference]: Finished difference Result 103 states and 173 transitions. [2024-11-07 07:31:49,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 07:31:49,451 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 101 [2024-11-07 07:31:49,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:31:49,459 INFO L225 Difference]: With dead ends: 103 [2024-11-07 07:31:49,459 INFO L226 Difference]: Without dead ends: 51 [2024-11-07 07:31:49,463 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 47 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 07:31:49,467 INFO L432 NwaCegarLoop]: 75 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, 75 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 07:31:49,469 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 07:31:49,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-11-07 07:31:49,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2024-11-07 07:31:49,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 34 states have internal predecessors, (45), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-07 07:31:49,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 75 transitions. [2024-11-07 07:31:49,518 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 75 transitions. Word has length 101 [2024-11-07 07:31:49,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:31:49,518 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 75 transitions. [2024-11-07 07:31:49,519 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-07 07:31:49,519 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 75 transitions. [2024-11-07 07:31:49,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-07 07:31:49,523 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:31:49,523 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:31:49,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 07:31:49,524 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:31:49,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:31:49,525 INFO L85 PathProgramCache]: Analyzing trace with hash 1736788935, now seen corresponding path program 1 times [2024-11-07 07:31:49,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:31:49,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8106179] [2024-11-07 07:31:49,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:31:49,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:31:49,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:31:49,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 07:31:49,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:31:49,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 07:31:49,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:31:49,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 07:31:49,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:31:50,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 07:31:50,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:31:50,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 07:31:50,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:31:50,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 07:31:50,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:31:50,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 07:31:50,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:31:50,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 07:31:50,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:31:50,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 07:31:50,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:31:50,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 07:31:50,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:31:50,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 07:31:50,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:31:50,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 07:31:50,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:31:50,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-07 07:31:50,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:31:50,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 07:31:50,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:31:50,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-07 07:31:50,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:31:50,102 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-07 07:31:50,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:31:50,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8106179] [2024-11-07 07:31:50,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [8106179] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:31:50,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:31:50,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 07:31:50,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710608773] [2024-11-07 07:31:50,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:31:50,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 07:31:50,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:31:50,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 07:31:50,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 07:31:50,110 INFO L87 Difference]: Start difference. First operand 51 states and 75 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-07 07:31:50,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:31:50,336 INFO L93 Difference]: Finished difference Result 148 states and 220 transitions. [2024-11-07 07:31:50,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 07:31:50,337 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 101 [2024-11-07 07:31:50,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:31:50,339 INFO L225 Difference]: With dead ends: 148 [2024-11-07 07:31:50,339 INFO L226 Difference]: Without dead ends: 100 [2024-11-07 07:31:50,340 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-07 07:31:50,341 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 67 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 07:31:50,341 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 240 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 07:31:50,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-11-07 07:31:50,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 80. [2024-11-07 07:31:50,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 47 states have (on average 1.2340425531914894) internal successors, (58), 47 states have internal predecessors, (58), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-07 07:31:50,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 118 transitions. [2024-11-07 07:31:50,360 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 118 transitions. Word has length 101 [2024-11-07 07:31:50,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:31:50,361 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 118 transitions. [2024-11-07 07:31:50,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-07 07:31:50,361 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 118 transitions. [2024-11-07 07:31:50,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-07 07:31:50,363 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:31:50,364 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:31:50,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 07:31:50,364 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:31:50,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:31:50,365 INFO L85 PathProgramCache]: Analyzing trace with hash 725671685, now seen corresponding path program 1 times [2024-11-07 07:31:50,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:31:50,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185371634] [2024-11-07 07:31:50,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:31:50,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:31:50,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:31:55,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 07:31:55,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:31:55,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 07:31:55,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:31:55,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 07:31:55,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:31:55,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 07:31:55,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:31:55,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 07:31:55,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:31:55,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 07:31:55,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:31:55,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 07:31:55,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:31:55,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 07:31:55,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:31:55,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 07:31:55,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:31:55,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 07:31:55,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:31:55,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 07:31:55,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:31:55,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 07:31:55,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:31:55,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-07 07:31:55,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:31:55,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 07:31:55,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:31:55,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-07 07:31:55,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:31:55,219 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-07 07:31:55,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:31:55,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185371634] [2024-11-07 07:31:55,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1185371634] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:31:55,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:31:55,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-07 07:31:55,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871183453] [2024-11-07 07:31:55,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:31:55,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-07 07:31:55,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:31:55,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-07 07:31:55,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2024-11-07 07:31:55,223 INFO L87 Difference]: Start difference. First operand 80 states and 118 transitions. Second operand has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 states have internal predecessors, (29), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-07 07:31:56,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:31:56,470 INFO L93 Difference]: Finished difference Result 204 states and 296 transitions. [2024-11-07 07:31:56,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 07:31:56,471 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 states have internal predecessors, (29), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 101 [2024-11-07 07:31:56,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:31:56,474 INFO L225 Difference]: With dead ends: 204 [2024-11-07 07:31:56,474 INFO L226 Difference]: Without dead ends: 156 [2024-11-07 07:31:56,475 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=166, Invalid=484, Unknown=0, NotChecked=0, Total=650 [2024-11-07 07:31:56,476 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 217 mSDsluCounter, 430 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 497 SdHoareTripleChecker+Invalid, 377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-07 07:31:56,476 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 497 Invalid, 377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 327 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-07 07:31:56,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2024-11-07 07:31:56,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 97. [2024-11-07 07:31:56,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 64 states have (on average 1.265625) internal successors, (81), 64 states have internal predecessors, (81), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-07 07:31:56,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 141 transitions. [2024-11-07 07:31:56,500 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 141 transitions. Word has length 101 [2024-11-07 07:31:56,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:31:56,501 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 141 transitions. [2024-11-07 07:31:56,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 states have internal predecessors, (29), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-07 07:31:56,502 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 141 transitions. [2024-11-07 07:31:56,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-07 07:31:56,504 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:31:56,505 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:31:56,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 07:31:56,505 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:31:56,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:31:56,506 INFO L85 PathProgramCache]: Analyzing trace with hash 1426736263, now seen corresponding path program 1 times [2024-11-07 07:31:56,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:31:56,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965883721] [2024-11-07 07:31:56,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:31:56,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:31:56,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:31:56,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 07:31:56,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:31:56,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 07:31:56,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:31:56,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 07:31:56,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:31:56,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 07:31:56,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:31:56,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 07:31:56,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:31:56,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 07:31:56,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:31:56,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 07:31:56,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:31:56,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 07:31:56,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:31:56,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 07:31:56,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:31:56,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 07:31:56,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:31:56,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 07:31:56,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:31:56,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 07:31:56,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:31:56,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-07 07:31:56,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:31:56,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 07:31:56,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:31:56,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-07 07:31:56,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:31:56,642 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-07 07:31:56,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:31:56,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965883721] [2024-11-07 07:31:56,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965883721] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:31:56,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:31:56,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 07:31:56,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340914341] [2024-11-07 07:31:56,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:31:56,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 07:31:56,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:31:56,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 07:31:56,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 07:31:56,644 INFO L87 Difference]: Start difference. First operand 97 states and 141 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-07 07:31:56,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:31:56,686 INFO L93 Difference]: Finished difference Result 192 states and 283 transitions. [2024-11-07 07:31:56,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 07:31:56,686 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 101 [2024-11-07 07:31:56,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:31:56,691 INFO L225 Difference]: With dead ends: 192 [2024-11-07 07:31:56,692 INFO L226 Difference]: Without dead ends: 144 [2024-11-07 07:31:56,693 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 32 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 07:31:56,694 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 67 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 07:31:56,697 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 150 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 07:31:56,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2024-11-07 07:31:56,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 142. [2024-11-07 07:31:56,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 93 states have (on average 1.2580645161290323) internal successors, (117), 93 states have internal predecessors, (117), 45 states have call successors, (45), 3 states have call predecessors, (45), 3 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2024-11-07 07:31:56,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 207 transitions. [2024-11-07 07:31:56,726 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 207 transitions. Word has length 101 [2024-11-07 07:31:56,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:31:56,728 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 207 transitions. [2024-11-07 07:31:56,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-07 07:31:56,728 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 207 transitions. [2024-11-07 07:31:56,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-07 07:31:56,729 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:31:56,730 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:31:56,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 07:31:56,730 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:31:56,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:31:56,731 INFO L85 PathProgramCache]: Analyzing trace with hash 862330139, now seen corresponding path program 1 times [2024-11-07 07:31:56,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:31:56,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855441062] [2024-11-07 07:31:56,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:31:56,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:31:56,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:31:56,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 07:31:56,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:31:57,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 07:31:57,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:31:57,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 07:31:57,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:31:57,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 07:31:57,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:31:57,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 07:31:57,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:31:57,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 07:31:57,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:31:57,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 07:31:57,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:31:57,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 07:31:57,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:31:57,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 07:31:57,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:31:57,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 07:31:57,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:31:57,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 07:31:57,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:31:57,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 07:31:57,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:31:57,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-07 07:31:57,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:31:57,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 07:31:57,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:31:57,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-07 07:31:57,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:31:57,033 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-07 07:31:57,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:31:57,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855441062] [2024-11-07 07:31:57,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [855441062] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:31:57,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:31:57,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 07:31:57,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000519314] [2024-11-07 07:31:57,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:31:57,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 07:31:57,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:31:57,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 07:31:57,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-07 07:31:57,036 INFO L87 Difference]: Start difference. First operand 142 states and 207 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-07 07:31:57,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:31:57,088 INFO L93 Difference]: Finished difference Result 247 states and 361 transitions. [2024-11-07 07:31:57,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 07:31:57,089 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 102 [2024-11-07 07:31:57,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:31:57,090 INFO L225 Difference]: With dead ends: 247 [2024-11-07 07:31:57,090 INFO L226 Difference]: Without dead ends: 151 [2024-11-07 07:31:57,091 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-07 07:31:57,091 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 6 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 07:31:57,092 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 196 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 07:31:57,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2024-11-07 07:31:57,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 142. [2024-11-07 07:31:57,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 93 states have (on average 1.2258064516129032) internal successors, (114), 93 states have internal predecessors, (114), 45 states have call successors, (45), 3 states have call predecessors, (45), 3 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2024-11-07 07:31:57,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 204 transitions. [2024-11-07 07:31:57,130 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 204 transitions. Word has length 102 [2024-11-07 07:31:57,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:31:57,132 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 204 transitions. [2024-11-07 07:31:57,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-07 07:31:57,132 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 204 transitions. [2024-11-07 07:31:57,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-07 07:31:57,136 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:31:57,136 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:31:57,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 07:31:57,137 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:31:57,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:31:57,137 INFO L85 PathProgramCache]: Analyzing trace with hash -1657629795, now seen corresponding path program 1 times [2024-11-07 07:31:57,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:31:57,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124689642] [2024-11-07 07:31:57,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:31:57,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:31:57,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:32:03,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 07:32:03,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:32:03,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 07:32:03,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:32:03,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 07:32:03,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:32:03,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 07:32:03,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:32:03,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 07:32:03,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:32:03,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 07:32:03,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:32:03,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 07:32:03,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:32:03,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 07:32:03,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:32:03,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 07:32:03,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:32:03,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 07:32:03,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:32:03,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 07:32:03,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:32:03,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 07:32:03,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:32:03,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-07 07:32:03,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:32:03,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 07:32:03,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:32:03,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-07 07:32:03,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:32:03,418 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-07 07:32:03,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:32:03,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124689642] [2024-11-07 07:32:03,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124689642] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:32:03,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:32:03,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-07 07:32:03,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926765774] [2024-11-07 07:32:03,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:32:03,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-07 07:32:03,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:32:03,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-07 07:32:03,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2024-11-07 07:32:03,422 INFO L87 Difference]: Start difference. First operand 142 states and 204 transitions. Second operand has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-07 07:32:07,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:32:07,521 INFO L93 Difference]: Finished difference Result 197 states and 265 transitions. [2024-11-07 07:32:07,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-07 07:32:07,521 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 102 [2024-11-07 07:32:07,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:32:07,523 INFO L225 Difference]: With dead ends: 197 [2024-11-07 07:32:07,523 INFO L226 Difference]: Without dead ends: 195 [2024-11-07 07:32:07,524 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=250, Invalid=742, Unknown=0, NotChecked=0, Total=992 [2024-11-07 07:32:07,524 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 215 mSDsluCounter, 431 mSDsCounter, 0 mSdLazyCounter, 452 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 489 SdHoareTripleChecker+Invalid, 498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 452 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-07 07:32:07,525 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 489 Invalid, 498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 452 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-07 07:32:07,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2024-11-07 07:32:07,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 140. [2024-11-07 07:32:07,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 91 states have (on average 1.2197802197802199) internal successors, (111), 91 states have internal predecessors, (111), 45 states have call successors, (45), 3 states have call predecessors, (45), 3 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2024-11-07 07:32:07,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 201 transitions. [2024-11-07 07:32:07,553 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 201 transitions. Word has length 102 [2024-11-07 07:32:07,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:32:07,553 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 201 transitions. [2024-11-07 07:32:07,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-07 07:32:07,554 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 201 transitions. [2024-11-07 07:32:07,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-07 07:32:07,555 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:32:07,555 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:32:07,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 07:32:07,555 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:32:07,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:32:07,556 INFO L85 PathProgramCache]: Analyzing trace with hash 1074487553, now seen corresponding path program 1 times [2024-11-07 07:32:07,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:32:07,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497701684] [2024-11-07 07:32:07,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:32:07,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:32:07,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:32:10,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 07:32:10,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:32:10,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 07:32:10,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:32:10,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 07:32:10,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:32:10,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 07:32:10,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:32:10,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 07:32:10,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:32:10,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 07:32:10,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:32:10,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 07:32:10,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:32:10,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 07:32:10,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:32:10,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 07:32:10,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:32:10,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 07:32:10,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:32:10,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 07:32:10,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:32:10,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 07:32:10,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:32:10,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-07 07:32:10,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:32:10,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 07:32:10,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:32:10,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-07 07:32:10,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:32:10,212 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-07 07:32:10,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:32:10,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497701684] [2024-11-07 07:32:10,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497701684] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:32:10,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:32:10,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-07 07:32:10,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001920128] [2024-11-07 07:32:10,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:32:10,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-07 07:32:10,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:32:10,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-07 07:32:10,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2024-11-07 07:32:10,215 INFO L87 Difference]: Start difference. First operand 140 states and 201 transitions. Second operand has 15 states, 15 states have (on average 2.0) internal successors, (30), 15 states have internal predecessors, (30), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-07 07:32:11,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:32:11,169 INFO L93 Difference]: Finished difference Result 195 states and 263 transitions. [2024-11-07 07:32:11,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-07 07:32:11,169 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.0) internal successors, (30), 15 states have internal predecessors, (30), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 102 [2024-11-07 07:32:11,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:32:11,171 INFO L225 Difference]: With dead ends: 195 [2024-11-07 07:32:11,171 INFO L226 Difference]: Without dead ends: 193 [2024-11-07 07:32:11,171 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=191, Invalid=565, Unknown=0, NotChecked=0, Total=756 [2024-11-07 07:32:11,172 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 268 mSDsluCounter, 362 mSDsCounter, 0 mSdLazyCounter, 392 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 07:32:11,172 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [268 Valid, 428 Invalid, 454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 392 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 07:32:11,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2024-11-07 07:32:11,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 143. [2024-11-07 07:32:11,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 94 states have (on average 1.2234042553191489) internal successors, (115), 94 states have internal predecessors, (115), 45 states have call successors, (45), 3 states have call predecessors, (45), 3 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2024-11-07 07:32:11,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 205 transitions. [2024-11-07 07:32:11,194 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 205 transitions. Word has length 102 [2024-11-07 07:32:11,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:32:11,195 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 205 transitions. [2024-11-07 07:32:11,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.0) internal successors, (30), 15 states have internal predecessors, (30), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-07 07:32:11,195 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 205 transitions. [2024-11-07 07:32:11,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-07 07:32:11,196 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:32:11,196 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:32:11,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 07:32:11,196 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:32:11,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:32:11,197 INFO L85 PathProgramCache]: Analyzing trace with hash -2101752518, now seen corresponding path program 1 times [2024-11-07 07:32:11,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:32:11,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135954720] [2024-11-07 07:32:11,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:32:11,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:32:11,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:32:17,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 07:32:17,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:32:17,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 07:32:17,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:32:17,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 07:32:17,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:32:17,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 07:32:17,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:32:17,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 07:32:17,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:32:17,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 07:32:17,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:32:17,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 07:32:17,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:32:17,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 07:32:17,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:32:17,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 07:32:17,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:32:17,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 07:32:17,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:32:17,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 07:32:17,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:32:17,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 07:32:17,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:32:17,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-07 07:32:17,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:32:17,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 07:32:17,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:32:17,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-07 07:32:17,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:32:17,624 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-07 07:32:17,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:32:17,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135954720] [2024-11-07 07:32:17,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135954720] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:32:17,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:32:17,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-07 07:32:17,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985967110] [2024-11-07 07:32:17,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:32:17,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-07 07:32:17,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:32:17,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-07 07:32:17,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2024-11-07 07:32:17,627 INFO L87 Difference]: Start difference. First operand 143 states and 205 transitions. Second operand has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-07 07:32:23,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:32:23,085 INFO L93 Difference]: Finished difference Result 211 states and 283 transitions. [2024-11-07 07:32:23,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-07 07:32:23,086 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 102 [2024-11-07 07:32:23,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:32:23,087 INFO L225 Difference]: With dead ends: 211 [2024-11-07 07:32:23,087 INFO L226 Difference]: Without dead ends: 209 [2024-11-07 07:32:23,088 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=262, Invalid=730, Unknown=0, NotChecked=0, Total=992 [2024-11-07 07:32:23,088 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 220 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-07 07:32:23,088 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 417 Invalid, 368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-07 07:32:23,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2024-11-07 07:32:23,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 153. [2024-11-07 07:32:23,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 104 states have (on average 1.2307692307692308) internal successors, (128), 104 states have internal predecessors, (128), 45 states have call successors, (45), 3 states have call predecessors, (45), 3 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2024-11-07 07:32:23,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 218 transitions. [2024-11-07 07:32:23,109 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 218 transitions. Word has length 102 [2024-11-07 07:32:23,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:32:23,109 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 218 transitions. [2024-11-07 07:32:23,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-07 07:32:23,110 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 218 transitions. [2024-11-07 07:32:23,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-07 07:32:23,111 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:32:23,112 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:32:23,112 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 07:32:23,112 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:32:23,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:32:23,112 INFO L85 PathProgramCache]: Analyzing trace with hash -1421694148, now seen corresponding path program 1 times [2024-11-07 07:32:23,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:32:23,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779772824] [2024-11-07 07:32:23,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:32:23,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:32:23,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:32:28,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 07:32:28,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:32:28,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 07:32:28,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:32:28,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 07:32:28,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:32:28,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 07:32:28,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:32:28,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 07:32:28,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:32:28,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 07:32:28,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:32:28,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 07:32:28,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:32:28,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 07:32:28,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:32:28,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 07:32:28,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:32:28,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 07:32:28,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:32:28,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 07:32:28,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:32:28,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 07:32:28,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:32:28,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-07 07:32:28,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:32:28,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 07:32:28,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:32:28,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-07 07:32:28,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:32:28,400 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-07 07:32:28,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:32:28,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779772824] [2024-11-07 07:32:28,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779772824] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:32:28,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:32:28,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-07 07:32:28,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436880195] [2024-11-07 07:32:28,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:32:28,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-07 07:32:28,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:32:28,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-07 07:32:28,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2024-11-07 07:32:28,403 INFO L87 Difference]: Start difference. First operand 153 states and 218 transitions. Second operand has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-07 07:32:33,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:32:33,706 INFO L93 Difference]: Finished difference Result 207 states and 278 transitions. [2024-11-07 07:32:33,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-07 07:32:33,707 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 102 [2024-11-07 07:32:33,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:32:33,709 INFO L225 Difference]: With dead ends: 207 [2024-11-07 07:32:33,709 INFO L226 Difference]: Without dead ends: 205 [2024-11-07 07:32:33,709 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=281, Invalid=711, Unknown=0, NotChecked=0, Total=992 [2024-11-07 07:32:33,710 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 214 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 450 SdHoareTripleChecker+Invalid, 351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-07 07:32:33,710 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 450 Invalid, 351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-07 07:32:33,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2024-11-07 07:32:33,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 153. [2024-11-07 07:32:33,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 104 states have (on average 1.2307692307692308) internal successors, (128), 104 states have internal predecessors, (128), 45 states have call successors, (45), 3 states have call predecessors, (45), 3 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2024-11-07 07:32:33,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 218 transitions. [2024-11-07 07:32:33,727 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 218 transitions. Word has length 102 [2024-11-07 07:32:33,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:32:33,727 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 218 transitions. [2024-11-07 07:32:33,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-07 07:32:33,728 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 218 transitions. [2024-11-07 07:32:33,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-07 07:32:33,729 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:32:33,729 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:32:33,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-07 07:32:33,729 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:32:33,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:32:33,730 INFO L85 PathProgramCache]: Analyzing trace with hash 206585705, now seen corresponding path program 1 times [2024-11-07 07:32:33,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:32:33,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137460657] [2024-11-07 07:32:33,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:32:33,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:32:33,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:32:37,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 07:32:37,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:32:37,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 07:32:37,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:32:37,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 07:32:37,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:32:37,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 07:32:37,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:32:37,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 07:32:37,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:32:37,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 07:32:37,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:32:37,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 07:32:37,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:32:37,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 07:32:37,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:32:37,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 07:32:37,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:32:37,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 07:32:37,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:32:37,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 07:32:37,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:32:37,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 07:32:37,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:32:37,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-07 07:32:37,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:32:37,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 07:32:37,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:32:37,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-07 07:32:37,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:32:37,997 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-07 07:32:37,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:32:37,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137460657] [2024-11-07 07:32:37,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137460657] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:32:37,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:32:37,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-07 07:32:37,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281720344] [2024-11-07 07:32:37,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:32:37,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-07 07:32:37,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:32:37,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-07 07:32:37,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2024-11-07 07:32:37,999 INFO L87 Difference]: Start difference. First operand 153 states and 218 transitions. Second operand has 16 states, 16 states have (on average 1.9375) internal successors, (31), 16 states have internal predecessors, (31), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-07 07:32:40,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:32:40,270 INFO L93 Difference]: Finished difference Result 195 states and 264 transitions. [2024-11-07 07:32:40,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-07 07:32:40,271 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.9375) internal successors, (31), 16 states have internal predecessors, (31), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 103 [2024-11-07 07:32:40,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:32:40,273 INFO L225 Difference]: With dead ends: 195 [2024-11-07 07:32:40,273 INFO L226 Difference]: Without dead ends: 193 [2024-11-07 07:32:40,274 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=228, Invalid=642, Unknown=0, NotChecked=0, Total=870 [2024-11-07 07:32:40,274 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 238 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 462 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 524 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 462 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-07 07:32:40,275 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [238 Valid, 404 Invalid, 524 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 462 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-07 07:32:40,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2024-11-07 07:32:40,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 150. [2024-11-07 07:32:40,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 101 states have (on average 1.2277227722772277) internal successors, (124), 101 states have internal predecessors, (124), 45 states have call successors, (45), 3 states have call predecessors, (45), 3 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2024-11-07 07:32:40,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 214 transitions. [2024-11-07 07:32:40,287 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 214 transitions. Word has length 103 [2024-11-07 07:32:40,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:32:40,288 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 214 transitions. [2024-11-07 07:32:40,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.9375) internal successors, (31), 16 states have internal predecessors, (31), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-07 07:32:40,288 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 214 transitions. [2024-11-07 07:32:40,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-07 07:32:40,289 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:32:40,289 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:32:40,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-07 07:32:40,289 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:32:40,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:32:40,290 INFO L85 PathProgramCache]: Analyzing trace with hash 886533128, now seen corresponding path program 1 times [2024-11-07 07:32:40,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:32:40,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671415433] [2024-11-07 07:32:40,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:32:40,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:32:40,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:32:45,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 07:32:45,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:32:45,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 07:32:45,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:32:45,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 07:32:45,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:32:45,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 07:32:45,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:32:45,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 07:32:45,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:32:45,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 07:32:45,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:32:45,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 07:32:45,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:32:45,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 07:32:45,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:32:45,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 07:32:45,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:32:45,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 07:32:45,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:32:45,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 07:32:45,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:32:45,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 07:32:45,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:32:45,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-07 07:32:45,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:32:45,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 07:32:45,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:32:45,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-07 07:32:45,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:32:45,807 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-07 07:32:45,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:32:45,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671415433] [2024-11-07 07:32:45,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671415433] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:32:45,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:32:45,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2024-11-07 07:32:45,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678950616] [2024-11-07 07:32:45,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:32:45,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-07 07:32:45,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:32:45,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-07 07:32:45,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2024-11-07 07:32:45,810 INFO L87 Difference]: Start difference. First operand 150 states and 214 transitions. Second operand has 18 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 18 states have internal predecessors, (31), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2024-11-07 07:32:49,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:32:49,939 INFO L93 Difference]: Finished difference Result 213 states and 284 transitions. [2024-11-07 07:32:49,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-07 07:32:49,940 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 18 states have internal predecessors, (31), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) Word has length 103 [2024-11-07 07:32:49,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:32:49,942 INFO L225 Difference]: With dead ends: 213 [2024-11-07 07:32:49,942 INFO L226 Difference]: Without dead ends: 211 [2024-11-07 07:32:49,942 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 215 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=336, Invalid=854, Unknown=0, NotChecked=0, Total=1190 [2024-11-07 07:32:49,943 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 369 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 455 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 369 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 582 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 455 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-07 07:32:49,943 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [369 Valid, 418 Invalid, 582 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 455 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-07 07:32:49,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2024-11-07 07:32:49,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 153. [2024-11-07 07:32:49,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 104 states have (on average 1.2307692307692308) internal successors, (128), 104 states have internal predecessors, (128), 45 states have call successors, (45), 3 states have call predecessors, (45), 3 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2024-11-07 07:32:49,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 218 transitions. [2024-11-07 07:32:49,963 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 218 transitions. Word has length 103 [2024-11-07 07:32:49,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:32:49,963 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 218 transitions. [2024-11-07 07:32:49,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 18 states have internal predecessors, (31), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2024-11-07 07:32:49,964 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 218 transitions. [2024-11-07 07:32:49,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-07 07:32:49,964 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:32:49,964 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:32:49,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-07 07:32:49,965 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:32:49,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:32:49,965 INFO L85 PathProgramCache]: Analyzing trace with hash -674469778, now seen corresponding path program 1 times [2024-11-07 07:32:49,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:32:49,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540241906] [2024-11-07 07:32:49,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:32:49,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:32:50,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:32:55,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 07:32:55,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:32:55,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 07:32:55,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:32:55,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 07:32:55,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:32:55,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 07:32:55,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:32:55,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 07:32:55,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:32:55,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 07:32:55,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:32:55,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 07:32:55,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:32:55,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 07:32:55,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:32:55,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 07:32:55,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:32:55,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 07:32:55,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:32:55,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 07:32:55,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:32:55,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 07:32:55,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:32:55,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-07 07:32:55,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:32:55,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 07:32:55,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:32:55,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-07 07:32:55,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:32:55,748 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-07 07:32:55,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:32:55,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540241906] [2024-11-07 07:32:55,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540241906] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:32:55,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:32:55,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2024-11-07 07:32:55,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220763512] [2024-11-07 07:32:55,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:32:55,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-07 07:32:55,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:32:55,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-07 07:32:55,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=290, Unknown=0, NotChecked=0, Total=342 [2024-11-07 07:32:55,750 INFO L87 Difference]: Start difference. First operand 153 states and 218 transitions. Second operand has 19 states, 19 states have (on average 1.631578947368421) internal successors, (31), 19 states have internal predecessors, (31), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2024-11-07 07:33:02,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:33:02,604 INFO L93 Difference]: Finished difference Result 211 states and 282 transitions. [2024-11-07 07:33:02,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-07 07:33:02,606 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.631578947368421) internal successors, (31), 19 states have internal predecessors, (31), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) Word has length 103 [2024-11-07 07:33:02,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:33:02,608 INFO L225 Difference]: With dead ends: 211 [2024-11-07 07:33:02,608 INFO L226 Difference]: Without dead ends: 209 [2024-11-07 07:33:02,608 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 259 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=339, Invalid=993, Unknown=0, NotChecked=0, Total=1332 [2024-11-07 07:33:02,609 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 309 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 571 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 309 SdHoareTripleChecker+Valid, 443 SdHoareTripleChecker+Invalid, 668 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 571 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-07 07:33:02,610 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [309 Valid, 443 Invalid, 668 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 571 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-07 07:33:02,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2024-11-07 07:33:02,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 156. [2024-11-07 07:33:02,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 107 states have (on average 1.233644859813084) internal successors, (132), 107 states have internal predecessors, (132), 45 states have call successors, (45), 3 states have call predecessors, (45), 3 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2024-11-07 07:33:02,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 222 transitions. [2024-11-07 07:33:02,625 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 222 transitions. Word has length 103 [2024-11-07 07:33:02,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:33:02,626 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 222 transitions. [2024-11-07 07:33:02,627 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.631578947368421) internal successors, (31), 19 states have internal predecessors, (31), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2024-11-07 07:33:02,627 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 222 transitions. [2024-11-07 07:33:02,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-07 07:33:02,628 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:33:02,628 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:33:02,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-07 07:33:02,629 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:33:02,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:33:02,630 INFO L85 PathProgramCache]: Analyzing trace with hash 493506118, now seen corresponding path program 1 times [2024-11-07 07:33:02,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:33:02,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940448045] [2024-11-07 07:33:02,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:33:02,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:33:02,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:33:07,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 07:33:07,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:33:07,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 07:33:07,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:33:07,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 07:33:07,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:33:07,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 07:33:07,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:33:07,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 07:33:07,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:33:07,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 07:33:07,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat