./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w128_d16_e0.c --full-output --architecture 64bit -------------------------------------------------------------------------------- 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/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w128_d16_e0.c', '-s', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-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', '64bit', '--witnessprinter.graph.data.programhash', '52aaa0332eefa406b14bf0040bc722ffbb83771cf03ec10c7d17ac8a4e45d63a'] 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/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w128_d16_e0.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-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 64bit --witnessprinter.graph.data.programhash 52aaa0332eefa406b14bf0040bc722ffbb83771cf03ec10c7d17ac8a4e45d63a --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 02:40:18,823 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 02:40:18,904 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-11-07 02:40:18,911 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 02:40:18,911 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 02:40:18,937 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 02:40:18,940 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 02:40:18,940 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 02:40:18,941 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 02:40:18,942 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 02:40:18,942 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 02:40:18,942 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 02:40:18,942 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 02:40:18,942 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 02:40:18,942 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 02:40:18,942 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 02:40:18,942 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 02:40:18,942 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 02:40:18,943 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 02:40:18,943 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 02:40:18,943 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 02:40:18,943 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 02:40:18,943 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 02:40:18,943 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 02:40:18,943 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 02:40:18,943 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 02:40:18,943 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 02:40:18,943 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 02:40:18,943 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 02:40:18,943 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 02:40:18,943 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 02:40:18,943 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 02:40:18,944 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 02:40:18,944 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 02:40:18,944 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 02:40:18,944 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 02:40:18,944 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 02:40:18,944 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 02:40:18,944 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 02:40:18,944 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 52aaa0332eefa406b14bf0040bc722ffbb83771cf03ec10c7d17ac8a4e45d63a [2024-11-07 02:40:19,245 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 02:40:19,257 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 02:40:19,260 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 02:40:19,261 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 02:40:19,261 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 02:40:19,262 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w128_d16_e0.c [2024-11-07 02:40:20,637 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 02:40:20,895 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 02:40:20,898 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w128_d16_e0.c [2024-11-07 02:40:20,913 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e998328c3/2d97556bf5e54d13a5e970cbcb7470a9/FLAG544e63cf4 [2024-11-07 02:40:20,929 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e998328c3/2d97556bf5e54d13a5e970cbcb7470a9 [2024-11-07 02:40:20,932 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 02:40:20,933 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 02:40:20,934 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 02:40:20,934 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 02:40:20,939 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 02:40:20,942 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 02:40:20" (1/1) ... [2024-11-07 02:40:20,943 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21b72594 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:40:20, skipping insertion in model container [2024-11-07 02:40:20,944 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 02:40:20" (1/1) ... [2024-11-07 02:40:20,979 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 02:40:21,096 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/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w128_d16_e0.c[1335,1348] [2024-11-07 02:40:21,267 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 02:40:21,280 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 02:40:21,291 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/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w128_d16_e0.c[1335,1348] [2024-11-07 02:40:21,420 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 02:40:21,433 INFO L204 MainTranslator]: Completed translation [2024-11-07 02:40:21,434 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:40:21 WrapperNode [2024-11-07 02:40:21,434 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 02:40:21,435 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 02:40:21,435 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 02:40:21,435 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 02:40:21,440 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:40:21" (1/1) ... [2024-11-07 02:40:21,470 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:40:21" (1/1) ... [2024-11-07 02:40:21,623 INFO L138 Inliner]: procedures = 18, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1977 [2024-11-07 02:40:21,624 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 02:40:21,624 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 02:40:21,624 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 02:40:21,624 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 02:40:21,630 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:40:21" (1/1) ... [2024-11-07 02:40:21,630 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:40:21" (1/1) ... [2024-11-07 02:40:21,665 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:40:21" (1/1) ... [2024-11-07 02:40:21,767 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 02:40:21,768 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:40:21" (1/1) ... [2024-11-07 02:40:21,768 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:40:21" (1/1) ... [2024-11-07 02:40:21,807 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:40:21" (1/1) ... [2024-11-07 02:40:21,822 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:40:21" (1/1) ... [2024-11-07 02:40:21,837 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:40:21" (1/1) ... [2024-11-07 02:40:21,846 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:40:21" (1/1) ... [2024-11-07 02:40:21,897 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 02:40:21,899 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 02:40:21,899 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 02:40:21,899 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 02:40:21,900 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:40:21" (1/1) ... [2024-11-07 02:40:21,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 02:40:21,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 02:40:21,921 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 02:40:21,923 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 02:40:21,940 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 02:40:21,940 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 02:40:21,940 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 02:40:21,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 02:40:21,940 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 02:40:21,941 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 02:40:22,147 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 02:40:22,148 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 02:40:23,768 INFO L? ?]: Removed 1091 outVars from TransFormulas that were not future-live. [2024-11-07 02:40:23,768 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 02:40:23,797 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 02:40:23,798 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 02:40:23,798 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 02:40:23 BoogieIcfgContainer [2024-11-07 02:40:23,798 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 02:40:23,800 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 02:40:23,800 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 02:40:23,804 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 02:40:23,804 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 02:40:20" (1/3) ... [2024-11-07 02:40:23,804 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2739bb29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 02:40:23, skipping insertion in model container [2024-11-07 02:40:23,805 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:40:21" (2/3) ... [2024-11-07 02:40:23,805 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2739bb29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 02:40:23, skipping insertion in model container [2024-11-07 02:40:23,805 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 02:40:23" (3/3) ... [2024-11-07 02:40:23,806 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.circular_pointer_top_w128_d16_e0.c [2024-11-07 02:40:23,816 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 02:40:23,816 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 02:40:23,880 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 02:40:23,890 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;@4e3f392f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 02:40:23,890 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 02:40:23,895 INFO L276 IsEmpty]: Start isEmpty. Operand has 552 states, 546 states have (on average 1.4945054945054945) internal successors, (816), 547 states have internal predecessors, (816), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-07 02:40:23,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-07 02:40:23,907 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:40:23,908 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:40:23,909 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:40:23,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:40:23,912 INFO L85 PathProgramCache]: Analyzing trace with hash -570647152, now seen corresponding path program 1 times [2024-11-07 02:40:23,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 02:40:23,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030814660] [2024-11-07 02:40:23,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:40:23,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 02:40:24,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:24,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 02:40:24,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:24,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-07 02:40:24,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:24,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-07 02:40:24,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:24,380 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-07 02:40:24,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 02:40:24,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030814660] [2024-11-07 02:40:24,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030814660] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 02:40:24,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 02:40:24,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 02:40:24,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024210349] [2024-11-07 02:40:24,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 02:40:24,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 02:40:24,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 02:40:24,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 02:40:24,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 02:40:24,409 INFO L87 Difference]: Start difference. First operand has 552 states, 546 states have (on average 1.4945054945054945) internal successors, (816), 547 states have internal predecessors, (816), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 68.5) internal successors, (137), 2 states have internal predecessors, (137), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-07 02:40:24,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:40:24,461 INFO L93 Difference]: Finished difference Result 999 states and 1493 transitions. [2024-11-07 02:40:24,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 02:40:24,463 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 68.5) internal successors, (137), 2 states have internal predecessors, (137), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 149 [2024-11-07 02:40:24,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:40:24,469 INFO L225 Difference]: With dead ends: 999 [2024-11-07 02:40:24,469 INFO L226 Difference]: Without dead ends: 549 [2024-11-07 02:40:24,472 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 11 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 02:40:24,473 INFO L432 NwaCegarLoop]: 817 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, 817 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 02:40:24,474 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 817 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 02:40:24,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2024-11-07 02:40:24,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 549. [2024-11-07 02:40:24,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 549 states, 544 states have (on average 1.4908088235294117) internal successors, (811), 544 states have internal predecessors, (811), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-07 02:40:24,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 817 transitions. [2024-11-07 02:40:24,515 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 817 transitions. Word has length 149 [2024-11-07 02:40:24,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:40:24,515 INFO L471 AbstractCegarLoop]: Abstraction has 549 states and 817 transitions. [2024-11-07 02:40:24,516 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 68.5) internal successors, (137), 2 states have internal predecessors, (137), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-07 02:40:24,516 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 817 transitions. [2024-11-07 02:40:24,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-07 02:40:24,520 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:40:24,520 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:40:24,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 02:40:24,520 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:40:24,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:40:24,520 INFO L85 PathProgramCache]: Analyzing trace with hash 1154250, now seen corresponding path program 1 times [2024-11-07 02:40:24,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 02:40:24,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948930839] [2024-11-07 02:40:24,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:40:24,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 02:40:24,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:25,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 02:40:25,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:25,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-07 02:40:25,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:25,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-07 02:40:25,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:25,488 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-07 02:40:25,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 02:40:25,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948930839] [2024-11-07 02:40:25,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948930839] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 02:40:25,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 02:40:25,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 02:40:25,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253520838] [2024-11-07 02:40:25,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 02:40:25,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 02:40:25,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 02:40:25,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 02:40:25,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 02:40:25,491 INFO L87 Difference]: Start difference. First operand 549 states and 817 transitions. Second operand has 4 states, 4 states have (on average 34.25) internal successors, (137), 4 states have internal predecessors, (137), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-07 02:40:25,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:40:25,528 INFO L93 Difference]: Finished difference Result 553 states and 821 transitions. [2024-11-07 02:40:25,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 02:40:25,531 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.25) internal successors, (137), 4 states have internal predecessors, (137), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 149 [2024-11-07 02:40:25,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:40:25,534 INFO L225 Difference]: With dead ends: 553 [2024-11-07 02:40:25,534 INFO L226 Difference]: Without dead ends: 551 [2024-11-07 02:40:25,535 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 02:40:25,535 INFO L432 NwaCegarLoop]: 815 mSDtfsCounter, 0 mSDsluCounter, 1624 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2439 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 02:40:25,536 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2439 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 02:40:25,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2024-11-07 02:40:25,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 551. [2024-11-07 02:40:25,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 551 states, 546 states have (on average 1.489010989010989) internal successors, (813), 546 states have internal predecessors, (813), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-07 02:40:25,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 819 transitions. [2024-11-07 02:40:25,551 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 819 transitions. Word has length 149 [2024-11-07 02:40:25,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:40:25,553 INFO L471 AbstractCegarLoop]: Abstraction has 551 states and 819 transitions. [2024-11-07 02:40:25,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.25) internal successors, (137), 4 states have internal predecessors, (137), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-07 02:40:25,553 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 819 transitions. [2024-11-07 02:40:25,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-07 02:40:25,556 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:40:25,556 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:40:25,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 02:40:25,557 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:40:25,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:40:25,557 INFO L85 PathProgramCache]: Analyzing trace with hash 37477728, now seen corresponding path program 1 times [2024-11-07 02:40:25,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 02:40:25,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810012444] [2024-11-07 02:40:25,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:40:25,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 02:40:25,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:26,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 02:40:26,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:26,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-07 02:40:26,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:26,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-07 02:40:26,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:26,046 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-07 02:40:26,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 02:40:26,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810012444] [2024-11-07 02:40:26,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810012444] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 02:40:26,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 02:40:26,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 02:40:26,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512512877] [2024-11-07 02:40:26,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 02:40:26,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 02:40:26,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 02:40:26,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 02:40:26,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 02:40:26,050 INFO L87 Difference]: Start difference. First operand 551 states and 819 transitions. Second operand has 5 states, 5 states have (on average 27.6) internal successors, (138), 5 states have internal predecessors, (138), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-07 02:40:26,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:40:26,498 INFO L93 Difference]: Finished difference Result 1371 states and 2041 transitions. [2024-11-07 02:40:26,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 02:40:26,499 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 27.6) internal successors, (138), 5 states have internal predecessors, (138), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 150 [2024-11-07 02:40:26,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:40:26,503 INFO L225 Difference]: With dead ends: 1371 [2024-11-07 02:40:26,504 INFO L226 Difference]: Without dead ends: 551 [2024-11-07 02:40:26,506 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-07 02:40:26,513 INFO L432 NwaCegarLoop]: 861 mSDtfsCounter, 1618 mSDsluCounter, 1490 mSDsCounter, 0 mSdLazyCounter, 302 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1618 SdHoareTripleChecker+Valid, 2351 SdHoareTripleChecker+Invalid, 339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 02:40:26,514 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1618 Valid, 2351 Invalid, 339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 302 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 02:40:26,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2024-11-07 02:40:26,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 551. [2024-11-07 02:40:26,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 551 states, 546 states have (on average 1.4871794871794872) internal successors, (812), 546 states have internal predecessors, (812), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-07 02:40:26,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 818 transitions. [2024-11-07 02:40:26,524 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 818 transitions. Word has length 150 [2024-11-07 02:40:26,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:40:26,525 INFO L471 AbstractCegarLoop]: Abstraction has 551 states and 818 transitions. [2024-11-07 02:40:26,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.6) internal successors, (138), 5 states have internal predecessors, (138), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-07 02:40:26,525 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 818 transitions. [2024-11-07 02:40:26,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-07 02:40:26,526 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:40:26,526 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:40:26,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 02:40:26,526 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:40:26,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:40:26,527 INFO L85 PathProgramCache]: Analyzing trace with hash 1675368076, now seen corresponding path program 1 times [2024-11-07 02:40:26,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 02:40:26,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969266654] [2024-11-07 02:40:26,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:40:26,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 02:40:26,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:26,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 02:40:26,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:26,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-07 02:40:26,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:26,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-07 02:40:26,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:26,878 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-07 02:40:26,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 02:40:26,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969266654] [2024-11-07 02:40:26,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969266654] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 02:40:26,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 02:40:26,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 02:40:26,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51415984] [2024-11-07 02:40:26,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 02:40:26,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 02:40:26,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 02:40:26,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 02:40:26,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 02:40:26,880 INFO L87 Difference]: Start difference. First operand 551 states and 818 transitions. Second operand has 4 states, 4 states have (on average 34.75) internal successors, (139), 4 states have internal predecessors, (139), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-07 02:40:26,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:40:26,910 INFO L93 Difference]: Finished difference Result 1002 states and 1487 transitions. [2024-11-07 02:40:26,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 02:40:26,911 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.75) internal successors, (139), 4 states have internal predecessors, (139), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 151 [2024-11-07 02:40:26,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:40:26,913 INFO L225 Difference]: With dead ends: 1002 [2024-11-07 02:40:26,913 INFO L226 Difference]: Without dead ends: 553 [2024-11-07 02:40:26,914 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 02:40:26,914 INFO L432 NwaCegarLoop]: 814 mSDtfsCounter, 0 mSDsluCounter, 1618 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2432 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 02:40:26,915 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2432 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 02:40:26,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2024-11-07 02:40:26,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 553. [2024-11-07 02:40:26,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 553 states, 548 states have (on average 1.4854014598540146) internal successors, (814), 548 states have internal predecessors, (814), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-07 02:40:26,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 820 transitions. [2024-11-07 02:40:26,925 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 820 transitions. Word has length 151 [2024-11-07 02:40:26,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:40:26,925 INFO L471 AbstractCegarLoop]: Abstraction has 553 states and 820 transitions. [2024-11-07 02:40:26,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.75) internal successors, (139), 4 states have internal predecessors, (139), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-07 02:40:26,926 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 820 transitions. [2024-11-07 02:40:26,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-07 02:40:26,927 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:40:26,927 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:40:26,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 02:40:26,927 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:40:26,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:40:26,927 INFO L85 PathProgramCache]: Analyzing trace with hash -701162313, now seen corresponding path program 1 times [2024-11-07 02:40:26,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 02:40:26,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676236483] [2024-11-07 02:40:26,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:40:26,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 02:40:27,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:27,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 02:40:27,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:27,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-07 02:40:27,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:27,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-07 02:40:27,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:27,392 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-07 02:40:27,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 02:40:27,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676236483] [2024-11-07 02:40:27,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676236483] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 02:40:27,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 02:40:27,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 02:40:27,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738113661] [2024-11-07 02:40:27,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 02:40:27,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 02:40:27,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 02:40:27,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 02:40:27,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 02:40:27,394 INFO L87 Difference]: Start difference. First operand 553 states and 820 transitions. Second operand has 4 states, 4 states have (on average 35.0) internal successors, (140), 4 states have internal predecessors, (140), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-07 02:40:27,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:40:27,539 INFO L93 Difference]: Finished difference Result 1004 states and 1488 transitions. [2024-11-07 02:40:27,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 02:40:27,540 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 35.0) internal successors, (140), 4 states have internal predecessors, (140), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 152 [2024-11-07 02:40:27,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:40:27,542 INFO L225 Difference]: With dead ends: 1004 [2024-11-07 02:40:27,542 INFO L226 Difference]: Without dead ends: 553 [2024-11-07 02:40:27,543 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 02:40:27,543 INFO L432 NwaCegarLoop]: 734 mSDtfsCounter, 694 mSDsluCounter, 736 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 694 SdHoareTripleChecker+Valid, 1470 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 02:40:27,543 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [694 Valid, 1470 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 02:40:27,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2024-11-07 02:40:27,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 553. [2024-11-07 02:40:27,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 553 states, 548 states have (on average 1.4835766423357664) internal successors, (813), 548 states have internal predecessors, (813), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-07 02:40:27,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 819 transitions. [2024-11-07 02:40:27,554 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 819 transitions. Word has length 152 [2024-11-07 02:40:27,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:40:27,554 INFO L471 AbstractCegarLoop]: Abstraction has 553 states and 819 transitions. [2024-11-07 02:40:27,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.0) internal successors, (140), 4 states have internal predecessors, (140), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-07 02:40:27,555 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 819 transitions. [2024-11-07 02:40:27,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-07 02:40:27,556 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:40:27,556 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:40:27,556 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 02:40:27,556 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:40:27,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:40:27,557 INFO L85 PathProgramCache]: Analyzing trace with hash 1766175453, now seen corresponding path program 1 times [2024-11-07 02:40:27,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 02:40:27,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069684295] [2024-11-07 02:40:27,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:40:27,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 02:40:27,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:27,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 02:40:27,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:27,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-07 02:40:27,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:27,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-07 02:40:27,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:27,873 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-07 02:40:27,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 02:40:27,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069684295] [2024-11-07 02:40:27,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069684295] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 02:40:27,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 02:40:27,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 02:40:27,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633336258] [2024-11-07 02:40:27,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 02:40:27,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 02:40:27,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 02:40:27,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 02:40:27,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 02:40:27,875 INFO L87 Difference]: Start difference. First operand 553 states and 819 transitions. Second operand has 5 states, 5 states have (on average 28.2) internal successors, (141), 5 states have internal predecessors, (141), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-07 02:40:27,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:40:27,994 INFO L93 Difference]: Finished difference Result 1010 states and 1494 transitions. [2024-11-07 02:40:27,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 02:40:27,994 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.2) internal successors, (141), 5 states have internal predecessors, (141), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 153 [2024-11-07 02:40:27,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:40:27,997 INFO L225 Difference]: With dead ends: 1010 [2024-11-07 02:40:27,997 INFO L226 Difference]: Without dead ends: 553 [2024-11-07 02:40:27,997 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-07 02:40:27,998 INFO L432 NwaCegarLoop]: 806 mSDtfsCounter, 705 mSDsluCounter, 1544 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 705 SdHoareTripleChecker+Valid, 2350 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 02:40:27,998 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [705 Valid, 2350 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 02:40:27,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2024-11-07 02:40:28,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 553. [2024-11-07 02:40:28,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 553 states, 548 states have (on average 1.4817518248175183) internal successors, (812), 548 states have internal predecessors, (812), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-07 02:40:28,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 818 transitions. [2024-11-07 02:40:28,008 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 818 transitions. Word has length 153 [2024-11-07 02:40:28,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:40:28,009 INFO L471 AbstractCegarLoop]: Abstraction has 553 states and 818 transitions. [2024-11-07 02:40:28,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.2) internal successors, (141), 5 states have internal predecessors, (141), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-07 02:40:28,009 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 818 transitions. [2024-11-07 02:40:28,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-11-07 02:40:28,010 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:40:28,010 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:40:28,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 02:40:28,010 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:40:28,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:40:28,011 INFO L85 PathProgramCache]: Analyzing trace with hash -855293822, now seen corresponding path program 1 times [2024-11-07 02:40:28,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 02:40:28,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119782683] [2024-11-07 02:40:28,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:40:28,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 02:40:28,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:28,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 02:40:28,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:28,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-07 02:40:28,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:28,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-07 02:40:28,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:28,301 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-07 02:40:28,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 02:40:28,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119782683] [2024-11-07 02:40:28,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119782683] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 02:40:28,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 02:40:28,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 02:40:28,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760293952] [2024-11-07 02:40:28,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 02:40:28,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 02:40:28,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 02:40:28,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 02:40:28,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-07 02:40:28,303 INFO L87 Difference]: Start difference. First operand 553 states and 818 transitions. Second operand has 5 states, 5 states have (on average 28.4) internal successors, (142), 5 states have internal predecessors, (142), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-07 02:40:28,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:40:28,439 INFO L93 Difference]: Finished difference Result 1004 states and 1484 transitions. [2024-11-07 02:40:28,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 02:40:28,448 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.4) internal successors, (142), 5 states have internal predecessors, (142), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 154 [2024-11-07 02:40:28,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:40:28,450 INFO L225 Difference]: With dead ends: 1004 [2024-11-07 02:40:28,450 INFO L226 Difference]: Without dead ends: 553 [2024-11-07 02:40:28,450 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-07 02:40:28,451 INFO L432 NwaCegarLoop]: 734 mSDtfsCounter, 802 mSDsluCounter, 743 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 805 SdHoareTripleChecker+Valid, 1477 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 02:40:28,451 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [805 Valid, 1477 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 02:40:28,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2024-11-07 02:40:28,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 553. [2024-11-07 02:40:28,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 553 states, 548 states have (on average 1.47992700729927) internal successors, (811), 548 states have internal predecessors, (811), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-07 02:40:28,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 817 transitions. [2024-11-07 02:40:28,460 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 817 transitions. Word has length 154 [2024-11-07 02:40:28,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:40:28,461 INFO L471 AbstractCegarLoop]: Abstraction has 553 states and 817 transitions. [2024-11-07 02:40:28,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.4) internal successors, (142), 5 states have internal predecessors, (142), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-07 02:40:28,461 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 817 transitions. [2024-11-07 02:40:28,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-07 02:40:28,462 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:40:28,462 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:40:28,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 02:40:28,462 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:40:28,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:40:28,463 INFO L85 PathProgramCache]: Analyzing trace with hash -2129133724, now seen corresponding path program 1 times [2024-11-07 02:40:28,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 02:40:28,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327791928] [2024-11-07 02:40:28,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:40:28,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 02:40:28,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:28,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 02:40:28,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:28,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-07 02:40:28,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:28,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-07 02:40:28,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:28,802 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-07 02:40:28,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 02:40:28,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327791928] [2024-11-07 02:40:28,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327791928] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 02:40:28,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 02:40:28,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 02:40:28,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480774439] [2024-11-07 02:40:28,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 02:40:28,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 02:40:28,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 02:40:28,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 02:40:28,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-07 02:40:28,804 INFO L87 Difference]: Start difference. First operand 553 states and 817 transitions. Second operand has 5 states, 5 states have (on average 28.6) internal successors, (143), 5 states have internal predecessors, (143), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-07 02:40:28,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:40:28,949 INFO L93 Difference]: Finished difference Result 1004 states and 1482 transitions. [2024-11-07 02:40:28,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 02:40:28,949 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.6) internal successors, (143), 5 states have internal predecessors, (143), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 155 [2024-11-07 02:40:28,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:40:28,951 INFO L225 Difference]: With dead ends: 1004 [2024-11-07 02:40:28,951 INFO L226 Difference]: Without dead ends: 553 [2024-11-07 02:40:28,952 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-07 02:40:28,952 INFO L432 NwaCegarLoop]: 734 mSDtfsCounter, 1487 mSDsluCounter, 736 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1490 SdHoareTripleChecker+Valid, 1470 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 02:40:28,953 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1490 Valid, 1470 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 02:40:28,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2024-11-07 02:40:28,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 553. [2024-11-07 02:40:28,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 553 states, 548 states have (on average 1.4781021897810218) internal successors, (810), 548 states have internal predecessors, (810), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-07 02:40:28,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 816 transitions. [2024-11-07 02:40:28,962 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 816 transitions. Word has length 155 [2024-11-07 02:40:28,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:40:28,963 INFO L471 AbstractCegarLoop]: Abstraction has 553 states and 816 transitions. [2024-11-07 02:40:28,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.6) internal successors, (143), 5 states have internal predecessors, (143), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-07 02:40:28,963 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 816 transitions. [2024-11-07 02:40:28,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-07 02:40:28,964 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:40:28,964 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:40:28,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 02:40:28,964 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:40:28,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:40:28,965 INFO L85 PathProgramCache]: Analyzing trace with hash 713065065, now seen corresponding path program 1 times [2024-11-07 02:40:28,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 02:40:28,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96606470] [2024-11-07 02:40:28,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:40:28,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 02:40:29,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:29,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 02:40:29,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:29,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-07 02:40:29,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:29,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-07 02:40:29,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:29,267 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-07 02:40:29,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 02:40:29,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96606470] [2024-11-07 02:40:29,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [96606470] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 02:40:29,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 02:40:29,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 02:40:29,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860524220] [2024-11-07 02:40:29,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 02:40:29,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 02:40:29,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 02:40:29,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 02:40:29,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-07 02:40:29,269 INFO L87 Difference]: Start difference. First operand 553 states and 816 transitions. Second operand has 5 states, 5 states have (on average 28.8) internal successors, (144), 5 states have internal predecessors, (144), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-07 02:40:29,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:40:29,409 INFO L93 Difference]: Finished difference Result 1004 states and 1480 transitions. [2024-11-07 02:40:29,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 02:40:29,409 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.8) internal successors, (144), 5 states have internal predecessors, (144), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 156 [2024-11-07 02:40:29,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:40:29,412 INFO L225 Difference]: With dead ends: 1004 [2024-11-07 02:40:29,412 INFO L226 Difference]: Without dead ends: 553 [2024-11-07 02:40:29,413 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-07 02:40:29,413 INFO L432 NwaCegarLoop]: 734 mSDtfsCounter, 1473 mSDsluCounter, 736 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1476 SdHoareTripleChecker+Valid, 1470 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 02:40:29,414 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1476 Valid, 1470 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 02:40:29,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2024-11-07 02:40:29,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 553. [2024-11-07 02:40:29,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 553 states, 548 states have (on average 1.4762773722627738) internal successors, (809), 548 states have internal predecessors, (809), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-07 02:40:29,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 815 transitions. [2024-11-07 02:40:29,425 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 815 transitions. Word has length 156 [2024-11-07 02:40:29,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:40:29,425 INFO L471 AbstractCegarLoop]: Abstraction has 553 states and 815 transitions. [2024-11-07 02:40:29,425 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.8) internal successors, (144), 5 states have internal predecessors, (144), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-07 02:40:29,426 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 815 transitions. [2024-11-07 02:40:29,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-07 02:40:29,427 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:40:29,427 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:40:29,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-07 02:40:29,427 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:40:29,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:40:29,427 INFO L85 PathProgramCache]: Analyzing trace with hash 1875276132, now seen corresponding path program 1 times [2024-11-07 02:40:29,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 02:40:29,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410311503] [2024-11-07 02:40:29,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:40:29,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 02:40:29,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:29,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 02:40:29,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:29,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-07 02:40:29,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:29,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-07 02:40:29,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:29,738 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-07 02:40:29,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 02:40:29,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410311503] [2024-11-07 02:40:29,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410311503] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 02:40:29,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 02:40:29,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 02:40:29,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237035839] [2024-11-07 02:40:29,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 02:40:29,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 02:40:29,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 02:40:29,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 02:40:29,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-07 02:40:29,739 INFO L87 Difference]: Start difference. First operand 553 states and 815 transitions. Second operand has 5 states, 5 states have (on average 29.0) internal successors, (145), 5 states have internal predecessors, (145), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-07 02:40:29,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:40:29,887 INFO L93 Difference]: Finished difference Result 1004 states and 1478 transitions. [2024-11-07 02:40:29,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 02:40:29,887 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.0) internal successors, (145), 5 states have internal predecessors, (145), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 157 [2024-11-07 02:40:29,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:40:29,890 INFO L225 Difference]: With dead ends: 1004 [2024-11-07 02:40:29,890 INFO L226 Difference]: Without dead ends: 553 [2024-11-07 02:40:29,890 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-07 02:40:29,891 INFO L432 NwaCegarLoop]: 734 mSDtfsCounter, 787 mSDsluCounter, 743 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 790 SdHoareTripleChecker+Valid, 1477 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 02:40:29,891 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [790 Valid, 1477 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 02:40:29,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2024-11-07 02:40:29,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 553. [2024-11-07 02:40:29,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 553 states, 548 states have (on average 1.4744525547445255) internal successors, (808), 548 states have internal predecessors, (808), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-07 02:40:29,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 814 transitions. [2024-11-07 02:40:29,902 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 814 transitions. Word has length 157 [2024-11-07 02:40:29,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:40:29,902 INFO L471 AbstractCegarLoop]: Abstraction has 553 states and 814 transitions. [2024-11-07 02:40:29,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.0) internal successors, (145), 5 states have internal predecessors, (145), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-07 02:40:29,902 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 814 transitions. [2024-11-07 02:40:29,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-07 02:40:29,903 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:40:29,904 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:40:29,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-07 02:40:29,904 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:40:29,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:40:29,904 INFO L85 PathProgramCache]: Analyzing trace with hash 459471362, now seen corresponding path program 1 times [2024-11-07 02:40:29,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 02:40:29,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70545473] [2024-11-07 02:40:29,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:40:29,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 02:40:29,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:30,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 02:40:30,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:30,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-07 02:40:30,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:30,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-07 02:40:30,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:30,191 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-07 02:40:30,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 02:40:30,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70545473] [2024-11-07 02:40:30,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70545473] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 02:40:30,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 02:40:30,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 02:40:30,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584950244] [2024-11-07 02:40:30,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 02:40:30,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 02:40:30,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 02:40:30,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 02:40:30,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-07 02:40:30,193 INFO L87 Difference]: Start difference. First operand 553 states and 814 transitions. Second operand has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-07 02:40:30,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:40:30,332 INFO L93 Difference]: Finished difference Result 1004 states and 1476 transitions. [2024-11-07 02:40:30,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 02:40:30,333 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 158 [2024-11-07 02:40:30,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:40:30,335 INFO L225 Difference]: With dead ends: 1004 [2024-11-07 02:40:30,335 INFO L226 Difference]: Without dead ends: 553 [2024-11-07 02:40:30,336 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-07 02:40:30,336 INFO L432 NwaCegarLoop]: 734 mSDtfsCounter, 1457 mSDsluCounter, 736 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1460 SdHoareTripleChecker+Valid, 1470 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 02:40:30,337 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1460 Valid, 1470 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 02:40:30,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2024-11-07 02:40:30,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 553. [2024-11-07 02:40:30,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 553 states, 548 states have (on average 1.4726277372262773) internal successors, (807), 548 states have internal predecessors, (807), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-07 02:40:30,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 813 transitions. [2024-11-07 02:40:30,347 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 813 transitions. Word has length 158 [2024-11-07 02:40:30,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:40:30,348 INFO L471 AbstractCegarLoop]: Abstraction has 553 states and 813 transitions. [2024-11-07 02:40:30,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-07 02:40:30,348 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 813 transitions. [2024-11-07 02:40:30,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-07 02:40:30,349 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:40:30,349 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:40:30,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-07 02:40:30,350 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:40:30,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:40:30,350 INFO L85 PathProgramCache]: Analyzing trace with hash 436656029, now seen corresponding path program 1 times [2024-11-07 02:40:30,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 02:40:30,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026592418] [2024-11-07 02:40:30,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:40:30,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 02:40:30,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:30,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 02:40:30,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:30,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-07 02:40:30,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:30,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-07 02:40:30,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:30,605 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-07 02:40:30,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 02:40:30,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026592418] [2024-11-07 02:40:30,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026592418] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 02:40:30,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 02:40:30,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 02:40:30,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792853414] [2024-11-07 02:40:30,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 02:40:30,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 02:40:30,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 02:40:30,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 02:40:30,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-07 02:40:30,607 INFO L87 Difference]: Start difference. First operand 553 states and 813 transitions. Second operand has 5 states, 5 states have (on average 29.4) internal successors, (147), 5 states have internal predecessors, (147), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-07 02:40:30,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:40:30,745 INFO L93 Difference]: Finished difference Result 1004 states and 1474 transitions. [2024-11-07 02:40:30,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 02:40:30,745 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.4) internal successors, (147), 5 states have internal predecessors, (147), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 159 [2024-11-07 02:40:30,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:40:30,747 INFO L225 Difference]: With dead ends: 1004 [2024-11-07 02:40:30,747 INFO L226 Difference]: Without dead ends: 553 [2024-11-07 02:40:30,748 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-07 02:40:30,748 INFO L432 NwaCegarLoop]: 734 mSDtfsCounter, 1449 mSDsluCounter, 736 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1452 SdHoareTripleChecker+Valid, 1470 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 02:40:30,748 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1452 Valid, 1470 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 02:40:30,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2024-11-07 02:40:30,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 553. [2024-11-07 02:40:30,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 553 states, 548 states have (on average 1.4708029197080292) internal successors, (806), 548 states have internal predecessors, (806), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-07 02:40:30,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 812 transitions. [2024-11-07 02:40:30,758 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 812 transitions. Word has length 159 [2024-11-07 02:40:30,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:40:30,758 INFO L471 AbstractCegarLoop]: Abstraction has 553 states and 812 transitions. [2024-11-07 02:40:30,759 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.4) internal successors, (147), 5 states have internal predecessors, (147), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-07 02:40:30,759 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 812 transitions. [2024-11-07 02:40:30,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-07 02:40:30,760 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:40:30,760 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:40:30,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-07 02:40:30,760 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:40:30,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:40:30,760 INFO L85 PathProgramCache]: Analyzing trace with hash -519943653, now seen corresponding path program 1 times [2024-11-07 02:40:30,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 02:40:30,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964082464] [2024-11-07 02:40:30,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:40:30,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 02:40:30,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:31,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 02:40:31,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:31,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-07 02:40:31,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:31,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-07 02:40:31,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:31,115 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-07 02:40:31,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 02:40:31,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964082464] [2024-11-07 02:40:31,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964082464] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 02:40:31,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 02:40:31,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 02:40:31,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049214181] [2024-11-07 02:40:31,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 02:40:31,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 02:40:31,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 02:40:31,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 02:40:31,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 02:40:31,117 INFO L87 Difference]: Start difference. First operand 553 states and 812 transitions. Second operand has 4 states, 4 states have (on average 37.0) internal successors, (148), 4 states have internal predecessors, (148), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-07 02:40:31,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:40:31,206 INFO L93 Difference]: Finished difference Result 1004 states and 1472 transitions. [2024-11-07 02:40:31,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 02:40:31,206 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 37.0) internal successors, (148), 4 states have internal predecessors, (148), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 160 [2024-11-07 02:40:31,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:40:31,208 INFO L225 Difference]: With dead ends: 1004 [2024-11-07 02:40:31,208 INFO L226 Difference]: Without dead ends: 553 [2024-11-07 02:40:31,209 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 02:40:31,209 INFO L432 NwaCegarLoop]: 766 mSDtfsCounter, 694 mSDsluCounter, 768 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 694 SdHoareTripleChecker+Valid, 1534 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 02:40:31,209 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [694 Valid, 1534 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 02:40:31,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2024-11-07 02:40:31,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 553. [2024-11-07 02:40:31,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 553 states, 548 states have (on average 1.468978102189781) internal successors, (805), 548 states have internal predecessors, (805), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-07 02:40:31,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 811 transitions. [2024-11-07 02:40:31,220 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 811 transitions. Word has length 160 [2024-11-07 02:40:31,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:40:31,221 INFO L471 AbstractCegarLoop]: Abstraction has 553 states and 811 transitions. [2024-11-07 02:40:31,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.0) internal successors, (148), 4 states have internal predecessors, (148), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-07 02:40:31,221 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 811 transitions. [2024-11-07 02:40:31,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-11-07 02:40:31,222 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:40:31,222 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:40:31,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-07 02:40:31,222 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:40:31,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:40:31,223 INFO L85 PathProgramCache]: Analyzing trace with hash -1776440099, now seen corresponding path program 1 times [2024-11-07 02:40:31,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 02:40:31,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966534380] [2024-11-07 02:40:31,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:40:31,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 02:40:31,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:31,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 02:40:31,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:31,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-07 02:40:31,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:31,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-07 02:40:31,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:31,626 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-07 02:40:31,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 02:40:31,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966534380] [2024-11-07 02:40:31,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [966534380] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 02:40:31,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 02:40:31,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 02:40:31,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25866587] [2024-11-07 02:40:31,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 02:40:31,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 02:40:31,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 02:40:31,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 02:40:31,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 02:40:31,629 INFO L87 Difference]: Start difference. First operand 553 states and 811 transitions. Second operand has 5 states, 5 states have (on average 29.8) internal successors, (149), 5 states have internal predecessors, (149), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-07 02:40:31,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:40:31,736 INFO L93 Difference]: Finished difference Result 1010 states and 1478 transitions. [2024-11-07 02:40:31,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 02:40:31,737 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.8) internal successors, (149), 5 states have internal predecessors, (149), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 161 [2024-11-07 02:40:31,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:40:31,740 INFO L225 Difference]: With dead ends: 1010 [2024-11-07 02:40:31,740 INFO L226 Difference]: Without dead ends: 553 [2024-11-07 02:40:31,741 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-07 02:40:31,741 INFO L432 NwaCegarLoop]: 798 mSDtfsCounter, 705 mSDsluCounter, 1568 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 705 SdHoareTripleChecker+Valid, 2366 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 02:40:31,742 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [705 Valid, 2366 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 02:40:31,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2024-11-07 02:40:31,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 553. [2024-11-07 02:40:31,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 553 states, 548 states have (on average 1.467153284671533) internal successors, (804), 548 states have internal predecessors, (804), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-07 02:40:31,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 810 transitions. [2024-11-07 02:40:31,759 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 810 transitions. Word has length 161 [2024-11-07 02:40:31,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:40:31,759 INFO L471 AbstractCegarLoop]: Abstraction has 553 states and 810 transitions. [2024-11-07 02:40:31,759 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.8) internal successors, (149), 5 states have internal predecessors, (149), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-07 02:40:31,759 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 810 transitions. [2024-11-07 02:40:31,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-07 02:40:31,761 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:40:31,761 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:40:31,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-07 02:40:31,762 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:40:31,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:40:31,762 INFO L85 PathProgramCache]: Analyzing trace with hash 2145028966, now seen corresponding path program 1 times [2024-11-07 02:40:31,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 02:40:31,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386313222] [2024-11-07 02:40:31,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:40:31,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 02:40:31,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:32,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 02:40:32,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:32,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-07 02:40:32,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:32,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-07 02:40:32,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:32,059 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-07 02:40:32,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 02:40:32,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386313222] [2024-11-07 02:40:32,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386313222] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 02:40:32,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 02:40:32,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 02:40:32,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607039165] [2024-11-07 02:40:32,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 02:40:32,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 02:40:32,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 02:40:32,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 02:40:32,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-07 02:40:32,062 INFO L87 Difference]: Start difference. First operand 553 states and 810 transitions. Second operand has 5 states, 5 states have (on average 30.0) internal successors, (150), 5 states have internal predecessors, (150), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-07 02:40:32,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:40:32,157 INFO L93 Difference]: Finished difference Result 1004 states and 1468 transitions. [2024-11-07 02:40:32,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 02:40:32,157 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 30.0) internal successors, (150), 5 states have internal predecessors, (150), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 162 [2024-11-07 02:40:32,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:40:32,160 INFO L225 Difference]: With dead ends: 1004 [2024-11-07 02:40:32,160 INFO L226 Difference]: Without dead ends: 553 [2024-11-07 02:40:32,161 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-07 02:40:32,162 INFO L432 NwaCegarLoop]: 766 mSDtfsCounter, 794 mSDsluCounter, 775 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 797 SdHoareTripleChecker+Valid, 1541 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 02:40:32,162 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [797 Valid, 1541 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 02:40:32,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2024-11-07 02:40:32,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 553. [2024-11-07 02:40:32,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 553 states, 548 states have (on average 1.4653284671532847) internal successors, (803), 548 states have internal predecessors, (803), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-07 02:40:32,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 809 transitions. [2024-11-07 02:40:32,172 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 809 transitions. Word has length 162 [2024-11-07 02:40:32,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:40:32,173 INFO L471 AbstractCegarLoop]: Abstraction has 553 states and 809 transitions. [2024-11-07 02:40:32,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.0) internal successors, (150), 5 states have internal predecessors, (150), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-07 02:40:32,173 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 809 transitions. [2024-11-07 02:40:32,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-11-07 02:40:32,174 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:40:32,175 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:40:32,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-07 02:40:32,175 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:40:32,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:40:32,176 INFO L85 PathProgramCache]: Analyzing trace with hash -1462540316, now seen corresponding path program 1 times [2024-11-07 02:40:32,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 02:40:32,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695820179] [2024-11-07 02:40:32,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:40:32,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 02:40:32,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:32,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 02:40:32,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:32,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-07 02:40:32,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:32,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-07 02:40:32,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:32,430 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-07 02:40:32,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 02:40:32,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695820179] [2024-11-07 02:40:32,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695820179] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 02:40:32,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 02:40:32,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 02:40:32,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832083660] [2024-11-07 02:40:32,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 02:40:32,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 02:40:32,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 02:40:32,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 02:40:32,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-07 02:40:32,431 INFO L87 Difference]: Start difference. First operand 553 states and 809 transitions. Second operand has 5 states, 5 states have (on average 30.2) internal successors, (151), 5 states have internal predecessors, (151), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-07 02:40:32,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:40:32,521 INFO L93 Difference]: Finished difference Result 1004 states and 1466 transitions. [2024-11-07 02:40:32,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 02:40:32,521 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 30.2) internal successors, (151), 5 states have internal predecessors, (151), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 163 [2024-11-07 02:40:32,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:40:32,523 INFO L225 Difference]: With dead ends: 1004 [2024-11-07 02:40:32,523 INFO L226 Difference]: Without dead ends: 553 [2024-11-07 02:40:32,524 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-07 02:40:32,525 INFO L432 NwaCegarLoop]: 766 mSDtfsCounter, 1479 mSDsluCounter, 768 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1482 SdHoareTripleChecker+Valid, 1534 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 02:40:32,525 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1482 Valid, 1534 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 02:40:32,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2024-11-07 02:40:32,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 553. [2024-11-07 02:40:32,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 553 states, 548 states have (on average 1.4635036496350364) internal successors, (802), 548 states have internal predecessors, (802), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-07 02:40:32,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 808 transitions. [2024-11-07 02:40:32,536 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 808 transitions. Word has length 163 [2024-11-07 02:40:32,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:40:32,536 INFO L471 AbstractCegarLoop]: Abstraction has 553 states and 808 transitions. [2024-11-07 02:40:32,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.2) internal successors, (151), 5 states have internal predecessors, (151), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-07 02:40:32,537 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 808 transitions. [2024-11-07 02:40:32,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-11-07 02:40:32,537 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:40:32,538 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:40:32,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-07 02:40:32,538 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:40:32,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:40:32,538 INFO L85 PathProgramCache]: Analyzing trace with hash 2004832973, now seen corresponding path program 1 times [2024-11-07 02:40:32,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 02:40:32,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927458512] [2024-11-07 02:40:32,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:40:32,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 02:40:32,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:32,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 02:40:32,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:32,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-07 02:40:32,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:32,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-07 02:40:32,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:32,867 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-07 02:40:32,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 02:40:32,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927458512] [2024-11-07 02:40:32,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927458512] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 02:40:32,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 02:40:32,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 02:40:32,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878583649] [2024-11-07 02:40:32,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 02:40:32,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 02:40:32,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 02:40:32,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 02:40:32,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 02:40:32,868 INFO L87 Difference]: Start difference. First operand 553 states and 808 transitions. Second operand has 4 states, 4 states have (on average 38.0) internal successors, (152), 4 states have internal predecessors, (152), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-07 02:40:32,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:40:32,926 INFO L93 Difference]: Finished difference Result 1004 states and 1464 transitions. [2024-11-07 02:40:32,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 02:40:32,926 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.0) internal successors, (152), 4 states have internal predecessors, (152), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 164 [2024-11-07 02:40:32,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:40:32,928 INFO L225 Difference]: With dead ends: 1004 [2024-11-07 02:40:32,928 INFO L226 Difference]: Without dead ends: 553 [2024-11-07 02:40:32,929 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 02:40:32,930 INFO L432 NwaCegarLoop]: 782 mSDtfsCounter, 699 mSDsluCounter, 784 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 699 SdHoareTripleChecker+Valid, 1566 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 02:40:32,930 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [699 Valid, 1566 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 02:40:32,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2024-11-07 02:40:32,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 553. [2024-11-07 02:40:32,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 553 states, 548 states have (on average 1.4598540145985401) internal successors, (800), 548 states have internal predecessors, (800), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-07 02:40:32,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 806 transitions. [2024-11-07 02:40:32,943 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 806 transitions. Word has length 164 [2024-11-07 02:40:32,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:40:32,943 INFO L471 AbstractCegarLoop]: Abstraction has 553 states and 806 transitions. [2024-11-07 02:40:32,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.0) internal successors, (152), 4 states have internal predecessors, (152), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-07 02:40:32,943 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 806 transitions. [2024-11-07 02:40:32,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-11-07 02:40:32,944 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:40:32,944 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:40:32,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-07 02:40:32,945 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:40:32,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:40:32,945 INFO L85 PathProgramCache]: Analyzing trace with hash -1458968950, now seen corresponding path program 1 times [2024-11-07 02:40:32,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 02:40:32,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829903395] [2024-11-07 02:40:32,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:40:32,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 02:40:33,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:33,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 02:40:33,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:33,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-07 02:40:33,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:33,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-07 02:40:33,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:33,215 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-07 02:40:33,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 02:40:33,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829903395] [2024-11-07 02:40:33,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829903395] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 02:40:33,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 02:40:33,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 02:40:33,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120351391] [2024-11-07 02:40:33,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 02:40:33,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 02:40:33,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 02:40:33,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 02:40:33,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-07 02:40:33,216 INFO L87 Difference]: Start difference. First operand 553 states and 806 transitions. Second operand has 5 states, 5 states have (on average 30.8) internal successors, (154), 5 states have internal predecessors, (154), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-07 02:40:33,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:40:33,272 INFO L93 Difference]: Finished difference Result 1004 states and 1460 transitions. [2024-11-07 02:40:33,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 02:40:33,272 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 30.8) internal successors, (154), 5 states have internal predecessors, (154), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 166 [2024-11-07 02:40:33,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:40:33,274 INFO L225 Difference]: With dead ends: 1004 [2024-11-07 02:40:33,274 INFO L226 Difference]: Without dead ends: 553 [2024-11-07 02:40:33,275 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-07 02:40:33,275 INFO L432 NwaCegarLoop]: 782 mSDtfsCounter, 789 mSDsluCounter, 791 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 792 SdHoareTripleChecker+Valid, 1573 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 02:40:33,275 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [792 Valid, 1573 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 02:40:33,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2024-11-07 02:40:33,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 553. [2024-11-07 02:40:33,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 553 states, 548 states have (on average 1.4580291970802919) internal successors, (799), 548 states have internal predecessors, (799), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-07 02:40:33,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 805 transitions. [2024-11-07 02:40:33,286 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 805 transitions. Word has length 166 [2024-11-07 02:40:33,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:40:33,287 INFO L471 AbstractCegarLoop]: Abstraction has 553 states and 805 transitions. [2024-11-07 02:40:33,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.8) internal successors, (154), 5 states have internal predecessors, (154), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-07 02:40:33,287 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 805 transitions. [2024-11-07 02:40:33,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-07 02:40:33,288 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:40:33,288 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:40:33,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-07 02:40:33,288 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:40:33,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:40:33,289 INFO L85 PathProgramCache]: Analyzing trace with hash 2035593486, now seen corresponding path program 1 times [2024-11-07 02:40:33,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 02:40:33,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811152019] [2024-11-07 02:40:33,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:40:33,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 02:40:33,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:33,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 02:40:33,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:33,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-07 02:40:33,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:33,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-07 02:40:33,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:33,612 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-07 02:40:33,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 02:40:33,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811152019] [2024-11-07 02:40:33,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811152019] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 02:40:33,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 02:40:33,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 02:40:33,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244015221] [2024-11-07 02:40:33,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 02:40:33,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 02:40:33,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 02:40:33,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 02:40:33,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 02:40:33,614 INFO L87 Difference]: Start difference. First operand 553 states and 805 transitions. Second operand has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-07 02:40:33,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:40:33,666 INFO L93 Difference]: Finished difference Result 1004 states and 1458 transitions. [2024-11-07 02:40:33,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 02:40:33,666 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 167 [2024-11-07 02:40:33,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:40:33,668 INFO L225 Difference]: With dead ends: 1004 [2024-11-07 02:40:33,668 INFO L226 Difference]: Without dead ends: 553 [2024-11-07 02:40:33,669 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 02:40:33,669 INFO L432 NwaCegarLoop]: 785 mSDtfsCounter, 734 mSDsluCounter, 787 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 736 SdHoareTripleChecker+Valid, 1572 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 02:40:33,669 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [736 Valid, 1572 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 02:40:33,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2024-11-07 02:40:33,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 553. [2024-11-07 02:40:33,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 553 states, 548 states have (on average 1.4562043795620438) internal successors, (798), 548 states have internal predecessors, (798), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-07 02:40:33,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 804 transitions. [2024-11-07 02:40:33,680 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 804 transitions. Word has length 167 [2024-11-07 02:40:33,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:40:33,680 INFO L471 AbstractCegarLoop]: Abstraction has 553 states and 804 transitions. [2024-11-07 02:40:33,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-07 02:40:33,680 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 804 transitions. [2024-11-07 02:40:33,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-07 02:40:33,681 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:40:33,681 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:40:33,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-07 02:40:33,681 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:40:33,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:40:33,682 INFO L85 PathProgramCache]: Analyzing trace with hash 116921244, now seen corresponding path program 1 times [2024-11-07 02:40:33,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 02:40:33,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343067775] [2024-11-07 02:40:33,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:40:33,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 02:40:33,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:34,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 02:40:34,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:34,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 02:40:34,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:34,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-07 02:40:34,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:34,017 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-07 02:40:34,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 02:40:34,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343067775] [2024-11-07 02:40:34,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343067775] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 02:40:34,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 02:40:34,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 02:40:34,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979994554] [2024-11-07 02:40:34,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 02:40:34,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 02:40:34,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 02:40:34,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 02:40:34,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 02:40:34,020 INFO L87 Difference]: Start difference. First operand 553 states and 804 transitions. Second operand has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 states have internal predecessors, (156), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-07 02:40:34,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:40:34,080 INFO L93 Difference]: Finished difference Result 1004 states and 1456 transitions. [2024-11-07 02:40:34,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 02:40:34,080 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 states have internal predecessors, (156), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 168 [2024-11-07 02:40:34,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:40:34,082 INFO L225 Difference]: With dead ends: 1004 [2024-11-07 02:40:34,082 INFO L226 Difference]: Without dead ends: 553 [2024-11-07 02:40:34,083 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 02:40:34,085 INFO L432 NwaCegarLoop]: 785 mSDtfsCounter, 732 mSDsluCounter, 787 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 734 SdHoareTripleChecker+Valid, 1572 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 02:40:34,085 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [734 Valid, 1572 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 02:40:34,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2024-11-07 02:40:34,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 553. [2024-11-07 02:40:34,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 553 states, 548 states have (on average 1.4543795620437956) internal successors, (797), 548 states have internal predecessors, (797), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-07 02:40:34,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 803 transitions. [2024-11-07 02:40:34,100 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 803 transitions. Word has length 168 [2024-11-07 02:40:34,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:40:34,100 INFO L471 AbstractCegarLoop]: Abstraction has 553 states and 803 transitions. [2024-11-07 02:40:34,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 states have internal predecessors, (156), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-07 02:40:34,100 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 803 transitions. [2024-11-07 02:40:34,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-07 02:40:34,101 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:40:34,101 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:40:34,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-07 02:40:34,102 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:40:34,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:40:34,102 INFO L85 PathProgramCache]: Analyzing trace with hash -2032439125, now seen corresponding path program 1 times [2024-11-07 02:40:34,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 02:40:34,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641938239] [2024-11-07 02:40:34,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:40:34,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 02:40:34,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:34,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 02:40:34,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:34,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-07 02:40:34,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:34,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 02:40:34,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:34,747 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-07 02:40:34,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 02:40:34,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641938239] [2024-11-07 02:40:34,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [641938239] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 02:40:34,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 02:40:34,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 02:40:34,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131551076] [2024-11-07 02:40:34,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 02:40:34,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 02:40:34,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 02:40:34,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 02:40:34,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 02:40:34,749 INFO L87 Difference]: Start difference. First operand 553 states and 803 transitions. Second operand has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-07 02:40:34,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:40:34,960 INFO L93 Difference]: Finished difference Result 1010 states and 1462 transitions. [2024-11-07 02:40:34,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 02:40:34,961 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 169 [2024-11-07 02:40:34,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:40:34,963 INFO L225 Difference]: With dead ends: 1010 [2024-11-07 02:40:34,963 INFO L226 Difference]: Without dead ends: 557 [2024-11-07 02:40:34,964 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 02:40:34,964 INFO L432 NwaCegarLoop]: 793 mSDtfsCounter, 2 mSDsluCounter, 2186 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2979 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 02:40:34,964 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2979 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 02:40:34,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2024-11-07 02:40:34,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 555. [2024-11-07 02:40:34,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 555 states, 550 states have (on average 1.4527272727272726) internal successors, (799), 550 states have internal predecessors, (799), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-07 02:40:34,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 805 transitions. [2024-11-07 02:40:34,978 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 805 transitions. Word has length 169 [2024-11-07 02:40:34,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:40:34,978 INFO L471 AbstractCegarLoop]: Abstraction has 555 states and 805 transitions. [2024-11-07 02:40:34,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-07 02:40:34,979 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 805 transitions. [2024-11-07 02:40:34,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-11-07 02:40:34,980 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:40:34,980 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:40:34,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-07 02:40:34,981 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:40:34,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:40:34,981 INFO L85 PathProgramCache]: Analyzing trace with hash -1239712212, now seen corresponding path program 1 times [2024-11-07 02:40:34,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 02:40:34,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487920745] [2024-11-07 02:40:34,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:40:34,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 02:40:35,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:35,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 02:40:35,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:35,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-07 02:40:35,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:35,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 02:40:35,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:35,386 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-07 02:40:35,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 02:40:35,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487920745] [2024-11-07 02:40:35,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487920745] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 02:40:35,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 02:40:35,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 02:40:35,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835552759] [2024-11-07 02:40:35,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 02:40:35,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 02:40:35,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 02:40:35,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 02:40:35,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 02:40:35,389 INFO L87 Difference]: Start difference. First operand 555 states and 805 transitions. Second operand has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-07 02:40:35,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:40:35,542 INFO L93 Difference]: Finished difference Result 1008 states and 1458 transitions. [2024-11-07 02:40:35,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 02:40:35,543 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 170 [2024-11-07 02:40:35,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:40:35,545 INFO L225 Difference]: With dead ends: 1008 [2024-11-07 02:40:35,545 INFO L226 Difference]: Without dead ends: 555 [2024-11-07 02:40:35,547 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 02:40:35,549 INFO L432 NwaCegarLoop]: 761 mSDtfsCounter, 684 mSDsluCounter, 763 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 684 SdHoareTripleChecker+Valid, 1524 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 02:40:35,550 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [684 Valid, 1524 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 02:40:35,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2024-11-07 02:40:35,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 555. [2024-11-07 02:40:35,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 555 states, 550 states have (on average 1.450909090909091) internal successors, (798), 550 states have internal predecessors, (798), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-07 02:40:35,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 804 transitions. [2024-11-07 02:40:35,564 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 804 transitions. Word has length 170 [2024-11-07 02:40:35,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:40:35,564 INFO L471 AbstractCegarLoop]: Abstraction has 555 states and 804 transitions. [2024-11-07 02:40:35,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-07 02:40:35,565 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 804 transitions. [2024-11-07 02:40:35,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-07 02:40:35,566 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:40:35,566 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:40:35,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-07 02:40:35,567 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:40:35,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:40:35,567 INFO L85 PathProgramCache]: Analyzing trace with hash -1094471960, now seen corresponding path program 1 times [2024-11-07 02:40:35,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 02:40:35,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829704406] [2024-11-07 02:40:35,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:40:35,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 02:40:35,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:35,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 02:40:35,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:35,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-07 02:40:35,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:35,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 02:40:35,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:35,992 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-07 02:40:35,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 02:40:35,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829704406] [2024-11-07 02:40:35,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829704406] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 02:40:35,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 02:40:35,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 02:40:35,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660368969] [2024-11-07 02:40:35,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 02:40:35,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 02:40:35,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 02:40:35,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 02:40:35,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-07 02:40:35,995 INFO L87 Difference]: Start difference. First operand 555 states and 804 transitions. Second operand has 5 states, 5 states have (on average 31.8) internal successors, (159), 5 states have internal predecessors, (159), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-07 02:40:36,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:40:36,087 INFO L93 Difference]: Finished difference Result 1008 states and 1456 transitions. [2024-11-07 02:40:36,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 02:40:36,087 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.8) internal successors, (159), 5 states have internal predecessors, (159), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 171 [2024-11-07 02:40:36,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:40:36,089 INFO L225 Difference]: With dead ends: 1008 [2024-11-07 02:40:36,089 INFO L226 Difference]: Without dead ends: 555 [2024-11-07 02:40:36,089 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-07 02:40:36,090 INFO L432 NwaCegarLoop]: 761 mSDtfsCounter, 682 mSDsluCounter, 770 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 682 SdHoareTripleChecker+Valid, 1531 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 02:40:36,090 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [682 Valid, 1531 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 02:40:36,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2024-11-07 02:40:36,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 555. [2024-11-07 02:40:36,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 555 states, 550 states have (on average 1.449090909090909) internal successors, (797), 550 states have internal predecessors, (797), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-07 02:40:36,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 803 transitions. [2024-11-07 02:40:36,101 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 803 transitions. Word has length 171 [2024-11-07 02:40:36,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:40:36,102 INFO L471 AbstractCegarLoop]: Abstraction has 555 states and 803 transitions. [2024-11-07 02:40:36,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.8) internal successors, (159), 5 states have internal predecessors, (159), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-07 02:40:36,102 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 803 transitions. [2024-11-07 02:40:36,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-11-07 02:40:36,103 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:40:36,103 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:40:36,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-07 02:40:36,103 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:40:36,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:40:36,103 INFO L85 PathProgramCache]: Analyzing trace with hash 801073965, now seen corresponding path program 1 times [2024-11-07 02:40:36,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 02:40:36,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726544760] [2024-11-07 02:40:36,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:40:36,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 02:40:36,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:36,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 02:40:36,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:36,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-07 02:40:36,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:36,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 02:40:36,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:36,445 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-07 02:40:36,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 02:40:36,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726544760] [2024-11-07 02:40:36,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726544760] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 02:40:36,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 02:40:36,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 02:40:36,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769386649] [2024-11-07 02:40:36,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 02:40:36,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 02:40:36,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 02:40:36,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 02:40:36,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-07 02:40:36,447 INFO L87 Difference]: Start difference. First operand 555 states and 803 transitions. Second operand has 5 states, 5 states have (on average 32.0) internal successors, (160), 5 states have internal predecessors, (160), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-07 02:40:36,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:40:36,557 INFO L93 Difference]: Finished difference Result 1008 states and 1454 transitions. [2024-11-07 02:40:36,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 02:40:36,558 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 32.0) internal successors, (160), 5 states have internal predecessors, (160), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 172 [2024-11-07 02:40:36,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:40:36,560 INFO L225 Difference]: With dead ends: 1008 [2024-11-07 02:40:36,560 INFO L226 Difference]: Without dead ends: 555 [2024-11-07 02:40:36,561 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-07 02:40:36,562 INFO L432 NwaCegarLoop]: 761 mSDtfsCounter, 681 mSDsluCounter, 770 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 681 SdHoareTripleChecker+Valid, 1531 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 02:40:36,562 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [681 Valid, 1531 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 02:40:36,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2024-11-07 02:40:36,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 555. [2024-11-07 02:40:36,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 555 states, 550 states have (on average 1.4472727272727273) internal successors, (796), 550 states have internal predecessors, (796), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-07 02:40:36,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 802 transitions. [2024-11-07 02:40:36,579 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 802 transitions. Word has length 172 [2024-11-07 02:40:36,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:40:36,580 INFO L471 AbstractCegarLoop]: Abstraction has 555 states and 802 transitions. [2024-11-07 02:40:36,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 32.0) internal successors, (160), 5 states have internal predecessors, (160), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-07 02:40:36,580 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 802 transitions. [2024-11-07 02:40:36,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-11-07 02:40:36,582 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:40:36,582 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:40:36,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-07 02:40:36,582 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:40:36,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:40:36,583 INFO L85 PathProgramCache]: Analyzing trace with hash 1945385383, now seen corresponding path program 1 times [2024-11-07 02:40:36,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 02:40:36,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569172152] [2024-11-07 02:40:36,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:40:36,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 02:40:36,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:37,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 02:40:37,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:37,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-07 02:40:37,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:37,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 02:40:37,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:37,205 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-07 02:40:37,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 02:40:37,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569172152] [2024-11-07 02:40:37,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569172152] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 02:40:37,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 02:40:37,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 02:40:37,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396937542] [2024-11-07 02:40:37,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 02:40:37,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 02:40:37,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 02:40:37,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 02:40:37,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 02:40:37,208 INFO L87 Difference]: Start difference. First operand 555 states and 802 transitions. Second operand has 5 states, 5 states have (on average 32.2) internal successors, (161), 5 states have internal predecessors, (161), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-07 02:40:37,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:40:37,620 INFO L93 Difference]: Finished difference Result 1010 states and 1455 transitions. [2024-11-07 02:40:37,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 02:40:37,621 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 32.2) internal successors, (161), 5 states have internal predecessors, (161), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 173 [2024-11-07 02:40:37,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:40:37,623 INFO L225 Difference]: With dead ends: 1010 [2024-11-07 02:40:37,624 INFO L226 Difference]: Without dead ends: 557 [2024-11-07 02:40:37,625 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 02:40:37,625 INFO L432 NwaCegarLoop]: 606 mSDtfsCounter, 697 mSDsluCounter, 1191 mSDsCounter, 0 mSdLazyCounter, 583 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 697 SdHoareTripleChecker+Valid, 1797 SdHoareTripleChecker+Invalid, 583 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 02:40:37,626 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [697 Valid, 1797 Invalid, 583 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 583 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 02:40:37,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2024-11-07 02:40:37,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 556. [2024-11-07 02:40:37,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 556 states, 551 states have (on average 1.4464609800362977) internal successors, (797), 551 states have internal predecessors, (797), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-07 02:40:37,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 803 transitions. [2024-11-07 02:40:37,647 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 803 transitions. Word has length 173 [2024-11-07 02:40:37,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:40:37,647 INFO L471 AbstractCegarLoop]: Abstraction has 556 states and 803 transitions. [2024-11-07 02:40:37,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 32.2) internal successors, (161), 5 states have internal predecessors, (161), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-07 02:40:37,648 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 803 transitions. [2024-11-07 02:40:37,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-11-07 02:40:37,650 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:40:37,650 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:40:37,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-07 02:40:37,650 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:40:37,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:40:37,651 INFO L85 PathProgramCache]: Analyzing trace with hash -1981593280, now seen corresponding path program 1 times [2024-11-07 02:40:37,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 02:40:37,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126558857] [2024-11-07 02:40:37,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:40:37,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 02:40:37,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:37,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 02:40:37,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:37,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-07 02:40:37,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:37,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 02:40:37,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:37,997 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-07 02:40:37,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 02:40:37,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126558857] [2024-11-07 02:40:37,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126558857] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 02:40:37,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 02:40:37,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 02:40:37,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365648561] [2024-11-07 02:40:37,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 02:40:37,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 02:40:37,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 02:40:37,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 02:40:37,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 02:40:37,999 INFO L87 Difference]: Start difference. First operand 556 states and 803 transitions. Second operand has 4 states, 4 states have (on average 40.25) internal successors, (161), 4 states have internal predecessors, (161), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-07 02:40:38,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:40:38,199 INFO L93 Difference]: Finished difference Result 1012 states and 1456 transitions. [2024-11-07 02:40:38,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 02:40:38,199 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 40.25) internal successors, (161), 4 states have internal predecessors, (161), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 173 [2024-11-07 02:40:38,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:40:38,202 INFO L225 Difference]: With dead ends: 1012 [2024-11-07 02:40:38,202 INFO L226 Difference]: Without dead ends: 556 [2024-11-07 02:40:38,203 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 02:40:38,203 INFO L432 NwaCegarLoop]: 791 mSDtfsCounter, 2 mSDsluCounter, 1392 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2183 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 02:40:38,204 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2183 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 02:40:38,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2024-11-07 02:40:38,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 556. [2024-11-07 02:40:38,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 556 states, 551 states have (on average 1.4446460980036298) internal successors, (796), 551 states have internal predecessors, (796), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-07 02:40:38,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 802 transitions. [2024-11-07 02:40:38,215 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 802 transitions. Word has length 173 [2024-11-07 02:40:38,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:40:38,215 INFO L471 AbstractCegarLoop]: Abstraction has 556 states and 802 transitions. [2024-11-07 02:40:38,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.25) internal successors, (161), 4 states have internal predecessors, (161), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-07 02:40:38,215 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 802 transitions. [2024-11-07 02:40:38,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2024-11-07 02:40:38,216 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:40:38,216 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:40:38,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-07 02:40:38,217 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:40:38,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:40:38,218 INFO L85 PathProgramCache]: Analyzing trace with hash -1674695829, now seen corresponding path program 1 times [2024-11-07 02:40:38,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 02:40:38,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779332859] [2024-11-07 02:40:38,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:40:38,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 02:40:38,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:38,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 02:40:38,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:38,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-07 02:40:38,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:38,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 02:40:38,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:38,493 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-07 02:40:38,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 02:40:38,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779332859] [2024-11-07 02:40:38,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779332859] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 02:40:38,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 02:40:38,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 02:40:38,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705370023] [2024-11-07 02:40:38,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 02:40:38,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 02:40:38,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 02:40:38,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 02:40:38,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 02:40:38,496 INFO L87 Difference]: Start difference. First operand 556 states and 802 transitions. Second operand has 4 states, 4 states have (on average 40.5) internal successors, (162), 4 states have internal predecessors, (162), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-07 02:40:38,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:40:38,665 INFO L93 Difference]: Finished difference Result 1010 states and 1452 transitions. [2024-11-07 02:40:38,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 02:40:38,668 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 40.5) internal successors, (162), 4 states have internal predecessors, (162), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 174 [2024-11-07 02:40:38,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:40:38,670 INFO L225 Difference]: With dead ends: 1010 [2024-11-07 02:40:38,670 INFO L226 Difference]: Without dead ends: 556 [2024-11-07 02:40:38,671 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 02:40:38,672 INFO L432 NwaCegarLoop]: 721 mSDtfsCounter, 664 mSDsluCounter, 723 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 664 SdHoareTripleChecker+Valid, 1444 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 02:40:38,673 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [664 Valid, 1444 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 02:40:38,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2024-11-07 02:40:38,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 556. [2024-11-07 02:40:38,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 556 states, 551 states have (on average 1.442831215970962) internal successors, (795), 551 states have internal predecessors, (795), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-07 02:40:38,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 801 transitions. [2024-11-07 02:40:38,690 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 801 transitions. Word has length 174 [2024-11-07 02:40:38,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:40:38,691 INFO L471 AbstractCegarLoop]: Abstraction has 556 states and 801 transitions. [2024-11-07 02:40:38,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.5) internal successors, (162), 4 states have internal predecessors, (162), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-07 02:40:38,691 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 801 transitions. [2024-11-07 02:40:38,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-11-07 02:40:38,693 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:40:38,693 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:40:38,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-07 02:40:38,693 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:40:38,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:40:38,694 INFO L85 PathProgramCache]: Analyzing trace with hash 1897304265, now seen corresponding path program 1 times [2024-11-07 02:40:38,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 02:40:38,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725985498] [2024-11-07 02:40:38,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:40:38,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 02:40:38,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:39,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 02:40:39,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:39,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-07 02:40:39,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:39,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 02:40:39,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:39,160 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-07 02:40:39,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 02:40:39,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725985498] [2024-11-07 02:40:39,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725985498] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 02:40:39,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 02:40:39,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 02:40:39,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64741611] [2024-11-07 02:40:39,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 02:40:39,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 02:40:39,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 02:40:39,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 02:40:39,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-07 02:40:39,162 INFO L87 Difference]: Start difference. First operand 556 states and 801 transitions. Second operand has 5 states, 5 states have (on average 32.6) internal successors, (163), 5 states have internal predecessors, (163), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-07 02:40:39,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:40:39,313 INFO L93 Difference]: Finished difference Result 1010 states and 1450 transitions. [2024-11-07 02:40:39,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 02:40:39,313 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 32.6) internal successors, (163), 5 states have internal predecessors, (163), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 175 [2024-11-07 02:40:39,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:40:39,316 INFO L225 Difference]: With dead ends: 1010 [2024-11-07 02:40:39,316 INFO L226 Difference]: Without dead ends: 556 [2024-11-07 02:40:39,317 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-07 02:40:39,317 INFO L432 NwaCegarLoop]: 721 mSDtfsCounter, 662 mSDsluCounter, 730 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 662 SdHoareTripleChecker+Valid, 1451 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 02:40:39,317 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [662 Valid, 1451 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 02:40:39,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2024-11-07 02:40:39,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 556. [2024-11-07 02:40:39,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 556 states, 551 states have (on average 1.441016333938294) internal successors, (794), 551 states have internal predecessors, (794), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-07 02:40:39,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 800 transitions. [2024-11-07 02:40:39,328 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 800 transitions. Word has length 175 [2024-11-07 02:40:39,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:40:39,328 INFO L471 AbstractCegarLoop]: Abstraction has 556 states and 800 transitions. [2024-11-07 02:40:39,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 32.6) internal successors, (163), 5 states have internal predecessors, (163), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-07 02:40:39,329 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 800 transitions. [2024-11-07 02:40:39,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-11-07 02:40:39,330 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:40:39,330 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:40:39,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-07 02:40:39,330 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:40:39,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:40:39,330 INFO L85 PathProgramCache]: Analyzing trace with hash 1574184492, now seen corresponding path program 1 times [2024-11-07 02:40:39,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 02:40:39,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289954820] [2024-11-07 02:40:39,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:40:39,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 02:40:39,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:39,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 02:40:39,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:39,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-07 02:40:39,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:39,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 02:40:39,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:39,741 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-07 02:40:39,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 02:40:39,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289954820] [2024-11-07 02:40:39,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289954820] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 02:40:39,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 02:40:39,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 02:40:39,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263818457] [2024-11-07 02:40:39,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 02:40:39,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 02:40:39,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 02:40:39,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 02:40:39,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-07 02:40:39,743 INFO L87 Difference]: Start difference. First operand 556 states and 800 transitions. Second operand has 5 states, 5 states have (on average 32.8) internal successors, (164), 5 states have internal predecessors, (164), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-07 02:40:39,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:40:39,939 INFO L93 Difference]: Finished difference Result 1010 states and 1448 transitions. [2024-11-07 02:40:39,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 02:40:39,940 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 32.8) internal successors, (164), 5 states have internal predecessors, (164), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 176 [2024-11-07 02:40:39,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:40:39,944 INFO L225 Difference]: With dead ends: 1010 [2024-11-07 02:40:39,944 INFO L226 Difference]: Without dead ends: 556 [2024-11-07 02:40:39,945 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-07 02:40:39,945 INFO L432 NwaCegarLoop]: 721 mSDtfsCounter, 661 mSDsluCounter, 730 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 661 SdHoareTripleChecker+Valid, 1451 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 02:40:39,949 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [661 Valid, 1451 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 02:40:39,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2024-11-07 02:40:39,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 556. [2024-11-07 02:40:39,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 556 states, 551 states have (on average 1.4392014519056262) internal successors, (793), 551 states have internal predecessors, (793), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-07 02:40:39,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 799 transitions. [2024-11-07 02:40:39,965 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 799 transitions. Word has length 176 [2024-11-07 02:40:39,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:40:39,966 INFO L471 AbstractCegarLoop]: Abstraction has 556 states and 799 transitions. [2024-11-07 02:40:39,966 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 32.8) internal successors, (164), 5 states have internal predecessors, (164), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-07 02:40:39,966 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 799 transitions. [2024-11-07 02:40:39,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-07 02:40:39,967 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:40:39,968 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:40:39,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-07 02:40:39,968 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:40:39,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:40:39,968 INFO L85 PathProgramCache]: Analyzing trace with hash 89470408, now seen corresponding path program 1 times [2024-11-07 02:40:39,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 02:40:39,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171062156] [2024-11-07 02:40:39,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:40:39,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 02:40:40,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:40,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 02:40:40,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:40,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-07 02:40:40,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:40,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 02:40:40,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:40,351 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-07 02:40:40,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 02:40:40,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171062156] [2024-11-07 02:40:40,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171062156] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 02:40:40,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 02:40:40,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 02:40:40,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979859337] [2024-11-07 02:40:40,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 02:40:40,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 02:40:40,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 02:40:40,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 02:40:40,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-07 02:40:40,353 INFO L87 Difference]: Start difference. First operand 556 states and 799 transitions. Second operand has 5 states, 5 states have (on average 33.0) internal successors, (165), 5 states have internal predecessors, (165), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-07 02:40:40,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:40:40,489 INFO L93 Difference]: Finished difference Result 1010 states and 1446 transitions. [2024-11-07 02:40:40,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 02:40:40,489 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.0) internal successors, (165), 5 states have internal predecessors, (165), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 177 [2024-11-07 02:40:40,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:40:40,491 INFO L225 Difference]: With dead ends: 1010 [2024-11-07 02:40:40,491 INFO L226 Difference]: Without dead ends: 556 [2024-11-07 02:40:40,492 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-07 02:40:40,493 INFO L432 NwaCegarLoop]: 721 mSDtfsCounter, 660 mSDsluCounter, 730 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 660 SdHoareTripleChecker+Valid, 1451 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 02:40:40,493 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [660 Valid, 1451 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 02:40:40,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2024-11-07 02:40:40,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 556. [2024-11-07 02:40:40,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 556 states, 551 states have (on average 1.4373865698729582) internal successors, (792), 551 states have internal predecessors, (792), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-07 02:40:40,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 798 transitions. [2024-11-07 02:40:40,504 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 798 transitions. Word has length 177 [2024-11-07 02:40:40,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:40:40,504 INFO L471 AbstractCegarLoop]: Abstraction has 556 states and 798 transitions. [2024-11-07 02:40:40,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.0) internal successors, (165), 5 states have internal predecessors, (165), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-07 02:40:40,504 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 798 transitions. [2024-11-07 02:40:40,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-11-07 02:40:40,505 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:40:40,505 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:40:40,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-07 02:40:40,506 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:40:40,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:40:40,506 INFO L85 PathProgramCache]: Analyzing trace with hash 2004024685, now seen corresponding path program 1 times [2024-11-07 02:40:40,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 02:40:40,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984985572] [2024-11-07 02:40:40,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:40:40,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 02:40:40,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:40,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 02:40:40,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:40,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-07 02:40:40,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:40,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 02:40:40,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:40,788 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-07 02:40:40,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 02:40:40,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984985572] [2024-11-07 02:40:40,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984985572] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 02:40:40,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 02:40:40,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 02:40:40,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788407395] [2024-11-07 02:40:40,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 02:40:40,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 02:40:40,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 02:40:40,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 02:40:40,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 02:40:40,789 INFO L87 Difference]: Start difference. First operand 556 states and 798 transitions. Second operand has 4 states, 4 states have (on average 41.5) internal successors, (166), 4 states have internal predecessors, (166), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-07 02:40:40,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:40:40,890 INFO L93 Difference]: Finished difference Result 1010 states and 1444 transitions. [2024-11-07 02:40:40,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 02:40:40,891 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 41.5) internal successors, (166), 4 states have internal predecessors, (166), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 178 [2024-11-07 02:40:40,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:40:40,892 INFO L225 Difference]: With dead ends: 1010 [2024-11-07 02:40:40,892 INFO L226 Difference]: Without dead ends: 556 [2024-11-07 02:40:40,893 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 02:40:40,893 INFO L432 NwaCegarLoop]: 721 mSDtfsCounter, 644 mSDsluCounter, 723 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 644 SdHoareTripleChecker+Valid, 1444 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 02:40:40,894 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [644 Valid, 1444 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 02:40:40,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2024-11-07 02:40:40,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 556. [2024-11-07 02:40:40,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 556 states, 551 states have (on average 1.4355716878402904) internal successors, (791), 551 states have internal predecessors, (791), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-07 02:40:40,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 797 transitions. [2024-11-07 02:40:40,905 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 797 transitions. Word has length 178 [2024-11-07 02:40:40,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:40:40,905 INFO L471 AbstractCegarLoop]: Abstraction has 556 states and 797 transitions. [2024-11-07 02:40:40,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 41.5) internal successors, (166), 4 states have internal predecessors, (166), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-07 02:40:40,905 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 797 transitions. [2024-11-07 02:40:40,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-07 02:40:40,906 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:40:40,907 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:40:40,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-07 02:40:40,907 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:40:40,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:40:40,907 INFO L85 PathProgramCache]: Analyzing trace with hash 967624263, now seen corresponding path program 1 times [2024-11-07 02:40:40,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 02:40:40,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364824345] [2024-11-07 02:40:40,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:40:40,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 02:40:41,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:41,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 02:40:41,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:41,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-07 02:40:41,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:41,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 02:40:41,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:41,247 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-07 02:40:41,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 02:40:41,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364824345] [2024-11-07 02:40:41,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364824345] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 02:40:41,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 02:40:41,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 02:40:41,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018829785] [2024-11-07 02:40:41,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 02:40:41,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 02:40:41,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 02:40:41,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 02:40:41,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-07 02:40:41,249 INFO L87 Difference]: Start difference. First operand 556 states and 797 transitions. Second operand has 5 states, 5 states have (on average 33.4) internal successors, (167), 5 states have internal predecessors, (167), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-07 02:40:41,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:40:41,383 INFO L93 Difference]: Finished difference Result 1010 states and 1442 transitions. [2024-11-07 02:40:41,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 02:40:41,383 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.4) internal successors, (167), 5 states have internal predecessors, (167), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 179 [2024-11-07 02:40:41,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:40:41,386 INFO L225 Difference]: With dead ends: 1010 [2024-11-07 02:40:41,386 INFO L226 Difference]: Without dead ends: 556 [2024-11-07 02:40:41,388 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-07 02:40:41,390 INFO L432 NwaCegarLoop]: 721 mSDtfsCounter, 658 mSDsluCounter, 730 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 658 SdHoareTripleChecker+Valid, 1451 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 02:40:41,390 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [658 Valid, 1451 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 02:40:41,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2024-11-07 02:40:41,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 556. [2024-11-07 02:40:41,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 556 states, 551 states have (on average 1.4337568058076224) internal successors, (790), 551 states have internal predecessors, (790), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-07 02:40:41,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 796 transitions. [2024-11-07 02:40:41,408 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 796 transitions. Word has length 179 [2024-11-07 02:40:41,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:40:41,409 INFO L471 AbstractCegarLoop]: Abstraction has 556 states and 796 transitions. [2024-11-07 02:40:41,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.4) internal successors, (167), 5 states have internal predecessors, (167), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-07 02:40:41,409 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 796 transitions. [2024-11-07 02:40:41,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-11-07 02:40:41,411 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:40:41,411 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:40:41,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-11-07 02:40:41,411 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:40:41,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:40:41,411 INFO L85 PathProgramCache]: Analyzing trace with hash -242540242, now seen corresponding path program 1 times [2024-11-07 02:40:41,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 02:40:41,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432132931] [2024-11-07 02:40:41,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:40:41,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 02:40:41,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:41,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 02:40:41,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:41,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-07 02:40:41,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:41,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 02:40:41,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:41,721 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-07 02:40:41,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 02:40:41,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432132931] [2024-11-07 02:40:41,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432132931] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 02:40:41,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 02:40:41,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 02:40:41,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766913998] [2024-11-07 02:40:41,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 02:40:41,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 02:40:41,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 02:40:41,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 02:40:41,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-07 02:40:41,723 INFO L87 Difference]: Start difference. First operand 556 states and 796 transitions. Second operand has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-07 02:40:41,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:40:41,843 INFO L93 Difference]: Finished difference Result 1010 states and 1440 transitions. [2024-11-07 02:40:41,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 02:40:41,843 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 180 [2024-11-07 02:40:41,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:40:41,845 INFO L225 Difference]: With dead ends: 1010 [2024-11-07 02:40:41,845 INFO L226 Difference]: Without dead ends: 556 [2024-11-07 02:40:41,846 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-07 02:40:41,846 INFO L432 NwaCegarLoop]: 721 mSDtfsCounter, 1290 mSDsluCounter, 723 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1290 SdHoareTripleChecker+Valid, 1444 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 02:40:41,846 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1290 Valid, 1444 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 02:40:41,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2024-11-07 02:40:41,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 556. [2024-11-07 02:40:41,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 556 states, 551 states have (on average 1.4319419237749547) internal successors, (789), 551 states have internal predecessors, (789), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-07 02:40:41,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 795 transitions. [2024-11-07 02:40:41,855 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 795 transitions. Word has length 180 [2024-11-07 02:40:41,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:40:41,855 INFO L471 AbstractCegarLoop]: Abstraction has 556 states and 795 transitions. [2024-11-07 02:40:41,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-07 02:40:41,856 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 795 transitions. [2024-11-07 02:40:41,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2024-11-07 02:40:41,856 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:40:41,856 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:40:41,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-11-07 02:40:41,856 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:40:41,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:40:41,857 INFO L85 PathProgramCache]: Analyzing trace with hash -1196109242, now seen corresponding path program 1 times [2024-11-07 02:40:41,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 02:40:41,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413148652] [2024-11-07 02:40:41,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:40:41,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 02:40:41,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:42,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 02:40:42,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:42,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-07 02:40:42,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:42,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 02:40:42,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:42,459 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-07 02:40:42,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 02:40:42,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413148652] [2024-11-07 02:40:42,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413148652] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 02:40:42,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 02:40:42,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 02:40:42,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431368740] [2024-11-07 02:40:42,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 02:40:42,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 02:40:42,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 02:40:42,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 02:40:42,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 02:40:42,461 INFO L87 Difference]: Start difference. First operand 556 states and 795 transitions. Second operand has 5 states, 5 states have (on average 33.8) internal successors, (169), 5 states have internal predecessors, (169), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-07 02:40:42,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:40:42,493 INFO L93 Difference]: Finished difference Result 1089 states and 1528 transitions. [2024-11-07 02:40:42,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 02:40:42,493 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.8) internal successors, (169), 5 states have internal predecessors, (169), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 181 [2024-11-07 02:40:42,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:40:42,496 INFO L225 Difference]: With dead ends: 1089 [2024-11-07 02:40:42,496 INFO L226 Difference]: Without dead ends: 635 [2024-11-07 02:40:42,497 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 02:40:42,497 INFO L432 NwaCegarLoop]: 782 mSDtfsCounter, 19 mSDsluCounter, 2337 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 3119 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 02:40:42,498 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 3119 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 02:40:42,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2024-11-07 02:40:42,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 633. [2024-11-07 02:40:42,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 633 states, 628 states have (on average 1.393312101910828) internal successors, (875), 628 states have internal predecessors, (875), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-07 02:40:42,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 633 states and 881 transitions. [2024-11-07 02:40:42,515 INFO L78 Accepts]: Start accepts. Automaton has 633 states and 881 transitions. Word has length 181 [2024-11-07 02:40:42,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:40:42,516 INFO L471 AbstractCegarLoop]: Abstraction has 633 states and 881 transitions. [2024-11-07 02:40:42,516 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.8) internal successors, (169), 5 states have internal predecessors, (169), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-07 02:40:42,516 INFO L276 IsEmpty]: Start isEmpty. Operand 633 states and 881 transitions. [2024-11-07 02:40:42,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2024-11-07 02:40:42,516 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:40:42,517 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:40:42,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-11-07 02:40:42,517 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:40:42,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:40:42,517 INFO L85 PathProgramCache]: Analyzing trace with hash -1810760508, now seen corresponding path program 1 times [2024-11-07 02:40:42,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 02:40:42,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594290530] [2024-11-07 02:40:42,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:40:42,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 02:40:42,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:43,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 02:40:43,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:43,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-07 02:40:43,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:43,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 02:40:43,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:43,333 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-07 02:40:43,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 02:40:43,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594290530] [2024-11-07 02:40:43,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [594290530] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 02:40:43,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 02:40:43,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 02:40:43,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031139983] [2024-11-07 02:40:43,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 02:40:43,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 02:40:43,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 02:40:43,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 02:40:43,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 02:40:43,335 INFO L87 Difference]: Start difference. First operand 633 states and 881 transitions. Second operand has 6 states, 6 states have (on average 28.333333333333332) internal successors, (170), 6 states have internal predecessors, (170), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-07 02:40:43,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:40:43,431 INFO L93 Difference]: Finished difference Result 1396 states and 1898 transitions. [2024-11-07 02:40:43,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 02:40:43,432 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 28.333333333333332) internal successors, (170), 6 states have internal predecessors, (170), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 182 [2024-11-07 02:40:43,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:40:43,434 INFO L225 Difference]: With dead ends: 1396 [2024-11-07 02:40:43,435 INFO L226 Difference]: Without dead ends: 865 [2024-11-07 02:40:43,435 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-11-07 02:40:43,436 INFO L432 NwaCegarLoop]: 776 mSDtfsCounter, 1133 mSDsluCounter, 2322 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1136 SdHoareTripleChecker+Valid, 3098 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 02:40:43,436 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1136 Valid, 3098 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 02:40:43,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 865 states. [2024-11-07 02:40:43,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 865 to 865. [2024-11-07 02:40:43,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 865 states, 857 states have (on average 1.3488914819136524) internal successors, (1156), 857 states have internal predecessors, (1156), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-07 02:40:43,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 865 states to 865 states and 1168 transitions. [2024-11-07 02:40:43,452 INFO L78 Accepts]: Start accepts. Automaton has 865 states and 1168 transitions. Word has length 182 [2024-11-07 02:40:43,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:40:43,453 INFO L471 AbstractCegarLoop]: Abstraction has 865 states and 1168 transitions. [2024-11-07 02:40:43,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.333333333333332) internal successors, (170), 6 states have internal predecessors, (170), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-07 02:40:43,453 INFO L276 IsEmpty]: Start isEmpty. Operand 865 states and 1168 transitions. [2024-11-07 02:40:43,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 451 [2024-11-07 02:40:43,455 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:40:43,455 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:40:43,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-11-07 02:40:43,456 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:40:43,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:40:43,456 INFO L85 PathProgramCache]: Analyzing trace with hash -958233778, now seen corresponding path program 1 times [2024-11-07 02:40:43,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 02:40:43,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015252758] [2024-11-07 02:40:43,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:40:43,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 02:40:43,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:44,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 02:40:44,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:44,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-07 02:40:44,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:44,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 02:40:44,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:44,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 327 [2024-11-07 02:40:44,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:44,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 343 [2024-11-07 02:40:44,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:44,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 355 [2024-11-07 02:40:44,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:44,108 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-07 02:40:44,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 02:40:44,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015252758] [2024-11-07 02:40:44,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015252758] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 02:40:44,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 02:40:44,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 02:40:44,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870624100] [2024-11-07 02:40:44,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 02:40:44,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 02:40:44,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 02:40:44,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 02:40:44,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-07 02:40:44,111 INFO L87 Difference]: Start difference. First operand 865 states and 1168 transitions. Second operand has 5 states, 5 states have (on average 84.6) internal successors, (423), 5 states have internal predecessors, (423), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-07 02:40:44,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:40:44,292 INFO L93 Difference]: Finished difference Result 1396 states and 1897 transitions. [2024-11-07 02:40:44,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 02:40:44,292 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 84.6) internal successors, (423), 5 states have internal predecessors, (423), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 450 [2024-11-07 02:40:44,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:40:44,296 INFO L225 Difference]: With dead ends: 1396 [2024-11-07 02:40:44,296 INFO L226 Difference]: Without dead ends: 865 [2024-11-07 02:40:44,297 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-07 02:40:44,298 INFO L432 NwaCegarLoop]: 721 mSDtfsCounter, 723 mSDsluCounter, 730 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 726 SdHoareTripleChecker+Valid, 1451 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 02:40:44,298 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [726 Valid, 1451 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 02:40:44,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 865 states. [2024-11-07 02:40:44,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 865 to 865. [2024-11-07 02:40:44,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 865 states, 857 states have (on average 1.3477246207701283) internal successors, (1155), 857 states have internal predecessors, (1155), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-07 02:40:44,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 865 states to 865 states and 1167 transitions. [2024-11-07 02:40:44,318 INFO L78 Accepts]: Start accepts. Automaton has 865 states and 1167 transitions. Word has length 450 [2024-11-07 02:40:44,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:40:44,318 INFO L471 AbstractCegarLoop]: Abstraction has 865 states and 1167 transitions. [2024-11-07 02:40:44,318 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 84.6) internal successors, (423), 5 states have internal predecessors, (423), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-07 02:40:44,319 INFO L276 IsEmpty]: Start isEmpty. Operand 865 states and 1167 transitions. [2024-11-07 02:40:44,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 452 [2024-11-07 02:40:44,321 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:40:44,322 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:40:44,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-11-07 02:40:44,322 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:40:44,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:40:44,323 INFO L85 PathProgramCache]: Analyzing trace with hash 1652333072, now seen corresponding path program 1 times [2024-11-07 02:40:44,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 02:40:44,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345096889] [2024-11-07 02:40:44,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:40:44,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 02:40:44,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:45,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 02:40:45,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:45,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-07 02:40:45,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:45,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 02:40:45,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:45,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 328 [2024-11-07 02:40:45,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:45,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 344 [2024-11-07 02:40:45,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:45,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 356 [2024-11-07 02:40:45,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:45,066 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-07 02:40:45,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 02:40:45,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345096889] [2024-11-07 02:40:45,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345096889] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 02:40:45,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 02:40:45,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 02:40:45,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588236732] [2024-11-07 02:40:45,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 02:40:45,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 02:40:45,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 02:40:45,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 02:40:45,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-07 02:40:45,070 INFO L87 Difference]: Start difference. First operand 865 states and 1167 transitions. Second operand has 5 states, 5 states have (on average 84.8) internal successors, (424), 5 states have internal predecessors, (424), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-07 02:40:45,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:40:45,207 INFO L93 Difference]: Finished difference Result 1396 states and 1895 transitions. [2024-11-07 02:40:45,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 02:40:45,208 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 84.8) internal successors, (424), 5 states have internal predecessors, (424), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 451 [2024-11-07 02:40:45,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:40:45,211 INFO L225 Difference]: With dead ends: 1396 [2024-11-07 02:40:45,211 INFO L226 Difference]: Without dead ends: 865 [2024-11-07 02:40:45,212 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-07 02:40:45,213 INFO L432 NwaCegarLoop]: 721 mSDtfsCounter, 715 mSDsluCounter, 730 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 718 SdHoareTripleChecker+Valid, 1451 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 02:40:45,213 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [718 Valid, 1451 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 02:40:45,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 865 states. [2024-11-07 02:40:45,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 865 to 865. [2024-11-07 02:40:45,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 865 states, 857 states have (on average 1.3465577596266045) internal successors, (1154), 857 states have internal predecessors, (1154), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-07 02:40:45,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 865 states to 865 states and 1166 transitions. [2024-11-07 02:40:45,233 INFO L78 Accepts]: Start accepts. Automaton has 865 states and 1166 transitions. Word has length 451 [2024-11-07 02:40:45,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:40:45,234 INFO L471 AbstractCegarLoop]: Abstraction has 865 states and 1166 transitions. [2024-11-07 02:40:45,234 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 84.8) internal successors, (424), 5 states have internal predecessors, (424), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-07 02:40:45,234 INFO L276 IsEmpty]: Start isEmpty. Operand 865 states and 1166 transitions. [2024-11-07 02:40:45,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 453 [2024-11-07 02:40:45,237 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:40:45,237 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:40:45,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-11-07 02:40:45,238 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:40:45,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:40:45,238 INFO L85 PathProgramCache]: Analyzing trace with hash 1564026489, now seen corresponding path program 1 times [2024-11-07 02:40:45,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 02:40:45,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061575391] [2024-11-07 02:40:45,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:40:45,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 02:40:45,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:45,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 02:40:45,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:45,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-07 02:40:45,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:45,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 02:40:45,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:45,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 329 [2024-11-07 02:40:45,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:45,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 345 [2024-11-07 02:40:46,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:46,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 357 [2024-11-07 02:40:46,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:46,001 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-07 02:40:46,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 02:40:46,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061575391] [2024-11-07 02:40:46,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061575391] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 02:40:46,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 02:40:46,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 02:40:46,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746132793] [2024-11-07 02:40:46,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 02:40:46,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 02:40:46,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 02:40:46,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 02:40:46,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-07 02:40:46,004 INFO L87 Difference]: Start difference. First operand 865 states and 1166 transitions. Second operand has 5 states, 5 states have (on average 85.0) internal successors, (425), 5 states have internal predecessors, (425), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-07 02:40:46,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:40:46,104 INFO L93 Difference]: Finished difference Result 1396 states and 1893 transitions. [2024-11-07 02:40:46,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 02:40:46,104 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 85.0) internal successors, (425), 5 states have internal predecessors, (425), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 452 [2024-11-07 02:40:46,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:40:46,106 INFO L225 Difference]: With dead ends: 1396 [2024-11-07 02:40:46,107 INFO L226 Difference]: Without dead ends: 865 [2024-11-07 02:40:46,107 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-07 02:40:46,108 INFO L432 NwaCegarLoop]: 721 mSDtfsCounter, 707 mSDsluCounter, 730 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 710 SdHoareTripleChecker+Valid, 1451 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 02:40:46,108 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [710 Valid, 1451 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 02:40:46,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 865 states. [2024-11-07 02:40:46,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 865 to 865. [2024-11-07 02:40:46,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 865 states, 857 states have (on average 1.3453908984830805) internal successors, (1153), 857 states have internal predecessors, (1153), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-07 02:40:46,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 865 states to 865 states and 1165 transitions. [2024-11-07 02:40:46,123 INFO L78 Accepts]: Start accepts. Automaton has 865 states and 1165 transitions. Word has length 452 [2024-11-07 02:40:46,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:40:46,123 INFO L471 AbstractCegarLoop]: Abstraction has 865 states and 1165 transitions. [2024-11-07 02:40:46,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 85.0) internal successors, (425), 5 states have internal predecessors, (425), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-07 02:40:46,124 INFO L276 IsEmpty]: Start isEmpty. Operand 865 states and 1165 transitions. [2024-11-07 02:40:46,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 454 [2024-11-07 02:40:46,128 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:40:46,128 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:40:46,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-11-07 02:40:46,129 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:40:46,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:40:46,129 INFO L85 PathProgramCache]: Analyzing trace with hash -18661797, now seen corresponding path program 1 times [2024-11-07 02:40:46,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 02:40:46,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788263295] [2024-11-07 02:40:46,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:40:46,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 02:40:46,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:46,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 02:40:46,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:46,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-07 02:40:46,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:46,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 02:40:46,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:46,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 330 [2024-11-07 02:40:46,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:46,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 346 [2024-11-07 02:40:46,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:46,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 358 [2024-11-07 02:40:46,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:46,756 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-07 02:40:46,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 02:40:46,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788263295] [2024-11-07 02:40:46,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [788263295] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 02:40:46,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 02:40:46,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 02:40:46,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49122451] [2024-11-07 02:40:46,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 02:40:46,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 02:40:46,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 02:40:46,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 02:40:46,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-07 02:40:46,759 INFO L87 Difference]: Start difference. First operand 865 states and 1165 transitions. Second operand has 5 states, 5 states have (on average 85.2) internal successors, (426), 5 states have internal predecessors, (426), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-07 02:40:46,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:40:46,884 INFO L93 Difference]: Finished difference Result 1396 states and 1891 transitions. [2024-11-07 02:40:46,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 02:40:46,885 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 85.2) internal successors, (426), 5 states have internal predecessors, (426), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 453 [2024-11-07 02:40:46,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:40:46,889 INFO L225 Difference]: With dead ends: 1396 [2024-11-07 02:40:46,889 INFO L226 Difference]: Without dead ends: 865 [2024-11-07 02:40:46,890 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-07 02:40:46,891 INFO L432 NwaCegarLoop]: 721 mSDtfsCounter, 699 mSDsluCounter, 730 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 702 SdHoareTripleChecker+Valid, 1451 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 02:40:46,891 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [702 Valid, 1451 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 02:40:46,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 865 states. [2024-11-07 02:40:46,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 865 to 865. [2024-11-07 02:40:46,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 865 states, 857 states have (on average 1.3442240373395566) internal successors, (1152), 857 states have internal predecessors, (1152), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-07 02:40:46,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 865 states to 865 states and 1164 transitions. [2024-11-07 02:40:46,913 INFO L78 Accepts]: Start accepts. Automaton has 865 states and 1164 transitions. Word has length 453 [2024-11-07 02:40:46,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:40:46,914 INFO L471 AbstractCegarLoop]: Abstraction has 865 states and 1164 transitions. [2024-11-07 02:40:46,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 85.2) internal successors, (426), 5 states have internal predecessors, (426), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-07 02:40:46,914 INFO L276 IsEmpty]: Start isEmpty. Operand 865 states and 1164 transitions. [2024-11-07 02:40:46,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 455 [2024-11-07 02:40:46,922 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:40:46,922 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:40:46,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-11-07 02:40:46,922 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:40:46,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:40:46,923 INFO L85 PathProgramCache]: Analyzing trace with hash -2045725148, now seen corresponding path program 1 times [2024-11-07 02:40:46,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 02:40:46,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449444381] [2024-11-07 02:40:46,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:40:46,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 02:40:47,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:47,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 02:40:47,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:47,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-07 02:40:47,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:47,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 02:40:47,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:47,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 331 [2024-11-07 02:40:47,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:47,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 347 [2024-11-07 02:40:47,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:47,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 359 [2024-11-07 02:40:47,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:47,520 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-07 02:40:47,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 02:40:47,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449444381] [2024-11-07 02:40:47,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449444381] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 02:40:47,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 02:40:47,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 02:40:47,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939709483] [2024-11-07 02:40:47,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 02:40:47,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 02:40:47,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 02:40:47,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 02:40:47,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-07 02:40:47,523 INFO L87 Difference]: Start difference. First operand 865 states and 1164 transitions. Second operand has 5 states, 5 states have (on average 85.4) internal successors, (427), 5 states have internal predecessors, (427), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-07 02:40:47,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:40:47,624 INFO L93 Difference]: Finished difference Result 1396 states and 1889 transitions. [2024-11-07 02:40:47,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 02:40:47,625 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 85.4) internal successors, (427), 5 states have internal predecessors, (427), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 454 [2024-11-07 02:40:47,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:40:47,628 INFO L225 Difference]: With dead ends: 1396 [2024-11-07 02:40:47,628 INFO L226 Difference]: Without dead ends: 865 [2024-11-07 02:40:47,629 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-07 02:40:47,629 INFO L432 NwaCegarLoop]: 721 mSDtfsCounter, 1259 mSDsluCounter, 723 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1262 SdHoareTripleChecker+Valid, 1444 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 02:40:47,629 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1262 Valid, 1444 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 02:40:47,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 865 states. [2024-11-07 02:40:47,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 865 to 865. [2024-11-07 02:40:47,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 865 states, 857 states have (on average 1.3430571761960326) internal successors, (1151), 857 states have internal predecessors, (1151), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-07 02:40:47,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 865 states to 865 states and 1163 transitions. [2024-11-07 02:40:47,645 INFO L78 Accepts]: Start accepts. Automaton has 865 states and 1163 transitions. Word has length 454 [2024-11-07 02:40:47,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:40:47,646 INFO L471 AbstractCegarLoop]: Abstraction has 865 states and 1163 transitions. [2024-11-07 02:40:47,646 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 85.4) internal successors, (427), 5 states have internal predecessors, (427), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-07 02:40:47,646 INFO L276 IsEmpty]: Start isEmpty. Operand 865 states and 1163 transitions. [2024-11-07 02:40:47,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 456 [2024-11-07 02:40:47,648 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:40:47,648 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:40:47,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-11-07 02:40:47,649 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:40:47,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:40:47,649 INFO L85 PathProgramCache]: Analyzing trace with hash 2051569446, now seen corresponding path program 1 times [2024-11-07 02:40:47,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 02:40:47,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958887989] [2024-11-07 02:40:47,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:40:47,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 02:40:47,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:48,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 02:40:48,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:48,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-07 02:40:48,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:48,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 02:40:48,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:48,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 332 [2024-11-07 02:40:48,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:48,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 348 [2024-11-07 02:40:48,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:48,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 360 [2024-11-07 02:40:48,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:48,405 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-07 02:40:48,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 02:40:48,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958887989] [2024-11-07 02:40:48,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958887989] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 02:40:48,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 02:40:48,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 02:40:48,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362178561] [2024-11-07 02:40:48,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 02:40:48,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 02:40:48,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 02:40:48,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 02:40:48,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-07 02:40:48,407 INFO L87 Difference]: Start difference. First operand 865 states and 1163 transitions. Second operand has 5 states, 5 states have (on average 85.6) internal successors, (428), 5 states have internal predecessors, (428), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-07 02:40:48,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:40:48,521 INFO L93 Difference]: Finished difference Result 1396 states and 1887 transitions. [2024-11-07 02:40:48,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 02:40:48,522 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 85.6) internal successors, (428), 5 states have internal predecessors, (428), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 455 [2024-11-07 02:40:48,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:40:48,525 INFO L225 Difference]: With dead ends: 1396 [2024-11-07 02:40:48,526 INFO L226 Difference]: Without dead ends: 865 [2024-11-07 02:40:48,529 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-07 02:40:48,529 INFO L432 NwaCegarLoop]: 721 mSDtfsCounter, 1243 mSDsluCounter, 723 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1246 SdHoareTripleChecker+Valid, 1444 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 02:40:48,530 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1246 Valid, 1444 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 02:40:48,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 865 states. [2024-11-07 02:40:48,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 865 to 865. [2024-11-07 02:40:48,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 865 states, 857 states have (on average 1.3418903150525088) internal successors, (1150), 857 states have internal predecessors, (1150), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-07 02:40:48,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 865 states to 865 states and 1162 transitions. [2024-11-07 02:40:48,549 INFO L78 Accepts]: Start accepts. Automaton has 865 states and 1162 transitions. Word has length 455 [2024-11-07 02:40:48,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:40:48,549 INFO L471 AbstractCegarLoop]: Abstraction has 865 states and 1162 transitions. [2024-11-07 02:40:48,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 85.6) internal successors, (428), 5 states have internal predecessors, (428), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-07 02:40:48,549 INFO L276 IsEmpty]: Start isEmpty. Operand 865 states and 1162 transitions. [2024-11-07 02:40:48,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 457 [2024-11-07 02:40:48,553 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:40:48,554 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:40:48,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-11-07 02:40:48,554 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:40:48,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:40:48,554 INFO L85 PathProgramCache]: Analyzing trace with hash 967242319, now seen corresponding path program 1 times [2024-11-07 02:40:48,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 02:40:48,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725783235] [2024-11-07 02:40:48,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:40:48,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 02:40:48,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:49,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 02:40:49,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:49,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-07 02:40:49,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:49,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 02:40:49,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:49,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 333 [2024-11-07 02:40:49,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:49,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 349 [2024-11-07 02:40:49,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:49,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 361 [2024-11-07 02:40:49,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:49,189 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-07 02:40:49,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 02:40:49,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725783235] [2024-11-07 02:40:49,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725783235] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 02:40:49,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 02:40:49,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 02:40:49,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988703223] [2024-11-07 02:40:49,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 02:40:49,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 02:40:49,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 02:40:49,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 02:40:49,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-07 02:40:49,191 INFO L87 Difference]: Start difference. First operand 865 states and 1162 transitions. Second operand has 5 states, 5 states have (on average 85.8) internal successors, (429), 5 states have internal predecessors, (429), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-07 02:40:49,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:40:49,289 INFO L93 Difference]: Finished difference Result 1396 states and 1885 transitions. [2024-11-07 02:40:49,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 02:40:49,290 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 85.8) internal successors, (429), 5 states have internal predecessors, (429), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 456 [2024-11-07 02:40:49,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:40:49,292 INFO L225 Difference]: With dead ends: 1396 [2024-11-07 02:40:49,292 INFO L226 Difference]: Without dead ends: 865 [2024-11-07 02:40:49,293 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-07 02:40:49,293 INFO L432 NwaCegarLoop]: 721 mSDtfsCounter, 675 mSDsluCounter, 730 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 678 SdHoareTripleChecker+Valid, 1451 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 02:40:49,293 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [678 Valid, 1451 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 02:40:49,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 865 states. [2024-11-07 02:40:49,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 865 to 865. [2024-11-07 02:40:49,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 865 states, 857 states have (on average 1.3407234539089847) internal successors, (1149), 857 states have internal predecessors, (1149), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-07 02:40:49,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 865 states to 865 states and 1161 transitions. [2024-11-07 02:40:49,305 INFO L78 Accepts]: Start accepts. Automaton has 865 states and 1161 transitions. Word has length 456 [2024-11-07 02:40:49,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:40:49,305 INFO L471 AbstractCegarLoop]: Abstraction has 865 states and 1161 transitions. [2024-11-07 02:40:49,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 85.8) internal successors, (429), 5 states have internal predecessors, (429), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-07 02:40:49,306 INFO L276 IsEmpty]: Start isEmpty. Operand 865 states and 1161 transitions. [2024-11-07 02:40:49,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 458 [2024-11-07 02:40:49,309 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:40:49,309 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:40:49,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-11-07 02:40:49,310 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:40:49,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:40:49,310 INFO L85 PathProgramCache]: Analyzing trace with hash -87554959, now seen corresponding path program 1 times [2024-11-07 02:40:49,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 02:40:49,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614033428] [2024-11-07 02:40:49,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:40:49,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 02:40:49,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:49,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 02:40:49,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:49,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-07 02:40:49,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:49,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 02:40:49,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:49,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 334 [2024-11-07 02:40:49,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:49,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 350 [2024-11-07 02:40:49,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:49,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 362 [2024-11-07 02:40:49,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:49,992 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-07 02:40:49,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 02:40:49,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614033428] [2024-11-07 02:40:49,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614033428] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 02:40:49,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 02:40:49,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 02:40:49,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167030728] [2024-11-07 02:40:49,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 02:40:49,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 02:40:49,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 02:40:49,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 02:40:49,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-07 02:40:49,997 INFO L87 Difference]: Start difference. First operand 865 states and 1161 transitions. Second operand has 5 states, 5 states have (on average 86.0) internal successors, (430), 5 states have internal predecessors, (430), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-07 02:40:50,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:40:50,092 INFO L93 Difference]: Finished difference Result 1396 states and 1883 transitions. [2024-11-07 02:40:50,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 02:40:50,092 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 86.0) internal successors, (430), 5 states have internal predecessors, (430), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 457 [2024-11-07 02:40:50,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:40:50,094 INFO L225 Difference]: With dead ends: 1396 [2024-11-07 02:40:50,094 INFO L226 Difference]: Without dead ends: 865 [2024-11-07 02:40:50,095 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-07 02:40:50,096 INFO L432 NwaCegarLoop]: 721 mSDtfsCounter, 667 mSDsluCounter, 730 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 670 SdHoareTripleChecker+Valid, 1451 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 02:40:50,096 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [670 Valid, 1451 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 02:40:50,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 865 states. [2024-11-07 02:40:50,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 865 to 865. [2024-11-07 02:40:50,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 865 states, 857 states have (on average 1.339556592765461) internal successors, (1148), 857 states have internal predecessors, (1148), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-07 02:40:50,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 865 states to 865 states and 1160 transitions. [2024-11-07 02:40:50,111 INFO L78 Accepts]: Start accepts. Automaton has 865 states and 1160 transitions. Word has length 457 [2024-11-07 02:40:50,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:40:50,112 INFO L471 AbstractCegarLoop]: Abstraction has 865 states and 1160 transitions. [2024-11-07 02:40:50,112 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 86.0) internal successors, (430), 5 states have internal predecessors, (430), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-07 02:40:50,112 INFO L276 IsEmpty]: Start isEmpty. Operand 865 states and 1160 transitions. [2024-11-07 02:40:50,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 459 [2024-11-07 02:40:50,114 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:40:50,115 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:40:50,115 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-11-07 02:40:50,115 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:40:50,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:40:50,115 INFO L85 PathProgramCache]: Analyzing trace with hash 588880634, now seen corresponding path program 1 times [2024-11-07 02:40:50,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 02:40:50,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530325233] [2024-11-07 02:40:50,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:40:50,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 02:40:50,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:50,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 02:40:50,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:50,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-07 02:40:50,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:50,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 02:40:50,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:50,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 335 [2024-11-07 02:40:50,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:50,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 351 [2024-11-07 02:40:50,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:50,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 363 [2024-11-07 02:40:50,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:50,718 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-07 02:40:50,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 02:40:50,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530325233] [2024-11-07 02:40:50,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530325233] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 02:40:50,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 02:40:50,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 02:40:50,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631547153] [2024-11-07 02:40:50,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 02:40:50,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 02:40:50,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 02:40:50,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 02:40:50,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-07 02:40:50,720 INFO L87 Difference]: Start difference. First operand 865 states and 1160 transitions. Second operand has 5 states, 5 states have (on average 86.2) internal successors, (431), 5 states have internal predecessors, (431), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-07 02:40:50,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:40:50,857 INFO L93 Difference]: Finished difference Result 1396 states and 1881 transitions. [2024-11-07 02:40:50,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 02:40:50,858 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 86.2) internal successors, (431), 5 states have internal predecessors, (431), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 458 [2024-11-07 02:40:50,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:40:50,863 INFO L225 Difference]: With dead ends: 1396 [2024-11-07 02:40:50,863 INFO L226 Difference]: Without dead ends: 865 [2024-11-07 02:40:50,864 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-07 02:40:50,864 INFO L432 NwaCegarLoop]: 745 mSDtfsCounter, 644 mSDsluCounter, 754 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 647 SdHoareTripleChecker+Valid, 1499 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 02:40:50,865 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [647 Valid, 1499 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 02:40:50,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 865 states. [2024-11-07 02:40:50,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 865 to 865. [2024-11-07 02:40:50,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 865 states, 857 states have (on average 1.338389731621937) internal successors, (1147), 857 states have internal predecessors, (1147), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-07 02:40:50,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 865 states to 865 states and 1159 transitions. [2024-11-07 02:40:50,883 INFO L78 Accepts]: Start accepts. Automaton has 865 states and 1159 transitions. Word has length 458 [2024-11-07 02:40:50,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:40:50,883 INFO L471 AbstractCegarLoop]: Abstraction has 865 states and 1159 transitions. [2024-11-07 02:40:50,884 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 86.2) internal successors, (431), 5 states have internal predecessors, (431), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-07 02:40:50,884 INFO L276 IsEmpty]: Start isEmpty. Operand 865 states and 1159 transitions. [2024-11-07 02:40:50,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 460 [2024-11-07 02:40:50,886 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:40:50,886 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:40:50,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-11-07 02:40:50,887 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:40:50,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:40:50,887 INFO L85 PathProgramCache]: Analyzing trace with hash 366847548, now seen corresponding path program 1 times [2024-11-07 02:40:50,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 02:40:50,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462560931] [2024-11-07 02:40:50,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:40:50,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 02:40:51,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:51,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 02:40:51,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:51,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-07 02:40:51,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:51,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 02:40:51,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:51,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 336 [2024-11-07 02:40:51,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:51,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 352 [2024-11-07 02:40:51,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:51,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 364 [2024-11-07 02:40:51,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:51,534 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-07 02:40:51,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 02:40:51,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462560931] [2024-11-07 02:40:51,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462560931] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 02:40:51,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 02:40:51,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 02:40:51,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702037872] [2024-11-07 02:40:51,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 02:40:51,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 02:40:51,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 02:40:51,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 02:40:51,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-07 02:40:51,536 INFO L87 Difference]: Start difference. First operand 865 states and 1159 transitions. Second operand has 5 states, 5 states have (on average 86.4) internal successors, (432), 5 states have internal predecessors, (432), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-07 02:40:51,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:40:51,658 INFO L93 Difference]: Finished difference Result 1396 states and 1879 transitions. [2024-11-07 02:40:51,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 02:40:51,659 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 86.4) internal successors, (432), 5 states have internal predecessors, (432), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 459 [2024-11-07 02:40:51,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:40:51,661 INFO L225 Difference]: With dead ends: 1396 [2024-11-07 02:40:51,661 INFO L226 Difference]: Without dead ends: 865 [2024-11-07 02:40:51,662 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-07 02:40:51,662 INFO L432 NwaCegarLoop]: 745 mSDtfsCounter, 636 mSDsluCounter, 754 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 639 SdHoareTripleChecker+Valid, 1499 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 02:40:51,663 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [639 Valid, 1499 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 02:40:51,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 865 states. [2024-11-07 02:40:51,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 865 to 865. [2024-11-07 02:40:51,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 865 states, 857 states have (on average 1.337222870478413) internal successors, (1146), 857 states have internal predecessors, (1146), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-07 02:40:51,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 865 states to 865 states and 1158 transitions. [2024-11-07 02:40:51,677 INFO L78 Accepts]: Start accepts. Automaton has 865 states and 1158 transitions. Word has length 459 [2024-11-07 02:40:51,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:40:51,678 INFO L471 AbstractCegarLoop]: Abstraction has 865 states and 1158 transitions. [2024-11-07 02:40:51,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 86.4) internal successors, (432), 5 states have internal predecessors, (432), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-07 02:40:51,678 INFO L276 IsEmpty]: Start isEmpty. Operand 865 states and 1158 transitions. [2024-11-07 02:40:51,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 461 [2024-11-07 02:40:51,681 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:40:51,681 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:40:51,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-11-07 02:40:51,682 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:40:51,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:40:51,682 INFO L85 PathProgramCache]: Analyzing trace with hash -530157531, now seen corresponding path program 1 times [2024-11-07 02:40:51,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 02:40:51,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170526819] [2024-11-07 02:40:51,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:40:51,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 02:40:51,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:52,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 02:40:52,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:52,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-07 02:40:52,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:52,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 02:40:52,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:52,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 337 [2024-11-07 02:40:52,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:52,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 353 [2024-11-07 02:40:52,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:52,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 365 [2024-11-07 02:40:52,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:52,438 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-07 02:40:52,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 02:40:52,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170526819] [2024-11-07 02:40:52,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170526819] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 02:40:52,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 02:40:52,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 02:40:52,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784249370] [2024-11-07 02:40:52,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 02:40:52,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 02:40:52,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 02:40:52,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 02:40:52,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-07 02:40:52,440 INFO L87 Difference]: Start difference. First operand 865 states and 1158 transitions. Second operand has 5 states, 5 states have (on average 86.6) internal successors, (433), 5 states have internal predecessors, (433), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-07 02:40:52,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:40:52,531 INFO L93 Difference]: Finished difference Result 1396 states and 1877 transitions. [2024-11-07 02:40:52,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 02:40:52,531 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 86.6) internal successors, (433), 5 states have internal predecessors, (433), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 460 [2024-11-07 02:40:52,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:40:52,534 INFO L225 Difference]: With dead ends: 1396 [2024-11-07 02:40:52,534 INFO L226 Difference]: Without dead ends: 865 [2024-11-07 02:40:52,535 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-07 02:40:52,536 INFO L432 NwaCegarLoop]: 745 mSDtfsCounter, 628 mSDsluCounter, 754 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 631 SdHoareTripleChecker+Valid, 1499 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 02:40:52,536 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [631 Valid, 1499 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 02:40:52,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 865 states. [2024-11-07 02:40:52,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 865 to 865. [2024-11-07 02:40:52,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 865 states, 857 states have (on average 1.3360560093348892) internal successors, (1145), 857 states have internal predecessors, (1145), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-07 02:40:52,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 865 states to 865 states and 1157 transitions. [2024-11-07 02:40:52,558 INFO L78 Accepts]: Start accepts. Automaton has 865 states and 1157 transitions. Word has length 460 [2024-11-07 02:40:52,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:40:52,558 INFO L471 AbstractCegarLoop]: Abstraction has 865 states and 1157 transitions. [2024-11-07 02:40:52,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 86.6) internal successors, (433), 5 states have internal predecessors, (433), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-07 02:40:52,559 INFO L276 IsEmpty]: Start isEmpty. Operand 865 states and 1157 transitions. [2024-11-07 02:40:52,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 462 [2024-11-07 02:40:52,562 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:40:52,562 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:40:52,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-11-07 02:40:52,562 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:40:52,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:40:52,563 INFO L85 PathProgramCache]: Analyzing trace with hash -261809017, now seen corresponding path program 1 times [2024-11-07 02:40:52,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 02:40:52,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503733638] [2024-11-07 02:40:52,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:40:52,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 02:40:52,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:53,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 02:40:53,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:53,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-07 02:40:53,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:53,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 02:40:53,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:53,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 338 [2024-11-07 02:40:53,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:53,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 354 [2024-11-07 02:40:53,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:53,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 366 [2024-11-07 02:40:53,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:53,223 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-07 02:40:53,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 02:40:53,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503733638] [2024-11-07 02:40:53,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503733638] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 02:40:53,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 02:40:53,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 02:40:53,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537521433] [2024-11-07 02:40:53,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 02:40:53,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 02:40:53,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 02:40:53,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 02:40:53,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-07 02:40:53,225 INFO L87 Difference]: Start difference. First operand 865 states and 1157 transitions. Second operand has 5 states, 5 states have (on average 86.8) internal successors, (434), 5 states have internal predecessors, (434), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-07 02:40:53,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:40:53,303 INFO L93 Difference]: Finished difference Result 1396 states and 1875 transitions. [2024-11-07 02:40:53,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 02:40:53,304 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 86.8) internal successors, (434), 5 states have internal predecessors, (434), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 461 [2024-11-07 02:40:53,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:40:53,305 INFO L225 Difference]: With dead ends: 1396 [2024-11-07 02:40:53,305 INFO L226 Difference]: Without dead ends: 865 [2024-11-07 02:40:53,306 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-07 02:40:53,306 INFO L432 NwaCegarLoop]: 745 mSDtfsCounter, 1132 mSDsluCounter, 747 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1135 SdHoareTripleChecker+Valid, 1492 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 02:40:53,306 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1135 Valid, 1492 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 02:40:53,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 865 states. [2024-11-07 02:40:53,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 865 to 865. [2024-11-07 02:40:53,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 865 states, 857 states have (on average 1.3348891481913652) internal successors, (1144), 857 states have internal predecessors, (1144), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-07 02:40:53,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 865 states to 865 states and 1156 transitions. [2024-11-07 02:40:53,320 INFO L78 Accepts]: Start accepts. Automaton has 865 states and 1156 transitions. Word has length 461 [2024-11-07 02:40:53,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:40:53,320 INFO L471 AbstractCegarLoop]: Abstraction has 865 states and 1156 transitions. [2024-11-07 02:40:53,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 86.8) internal successors, (434), 5 states have internal predecessors, (434), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-07 02:40:53,321 INFO L276 IsEmpty]: Start isEmpty. Operand 865 states and 1156 transitions. [2024-11-07 02:40:53,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 463 [2024-11-07 02:40:53,323 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:40:53,323 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:40:53,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-11-07 02:40:53,324 INFO L396 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:40:53,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:40:53,324 INFO L85 PathProgramCache]: Analyzing trace with hash 1114321360, now seen corresponding path program 1 times [2024-11-07 02:40:53,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 02:40:53,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812402459] [2024-11-07 02:40:53,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:40:53,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 02:40:53,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:54,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 02:40:54,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:54,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-07 02:40:54,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:54,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 02:40:54,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:54,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 339 [2024-11-07 02:40:54,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:54,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 355 [2024-11-07 02:40:54,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:54,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 367 [2024-11-07 02:40:54,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:54,292 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-07 02:40:54,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 02:40:54,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812402459] [2024-11-07 02:40:54,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812402459] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 02:40:54,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 02:40:54,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 02:40:54,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003156124] [2024-11-07 02:40:54,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 02:40:54,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 02:40:54,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 02:40:54,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 02:40:54,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-07 02:40:54,298 INFO L87 Difference]: Start difference. First operand 865 states and 1156 transitions. Second operand has 5 states, 5 states have (on average 87.0) internal successors, (435), 5 states have internal predecessors, (435), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-07 02:40:54,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:40:54,388 INFO L93 Difference]: Finished difference Result 1396 states and 1873 transitions. [2024-11-07 02:40:54,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 02:40:54,388 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 87.0) internal successors, (435), 5 states have internal predecessors, (435), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 462 [2024-11-07 02:40:54,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:40:54,391 INFO L225 Difference]: With dead ends: 1396 [2024-11-07 02:40:54,391 INFO L226 Difference]: Without dead ends: 865 [2024-11-07 02:40:54,392 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-07 02:40:54,392 INFO L432 NwaCegarLoop]: 757 mSDtfsCounter, 1109 mSDsluCounter, 759 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1112 SdHoareTripleChecker+Valid, 1516 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 02:40:54,392 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1112 Valid, 1516 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 02:40:54,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 865 states. [2024-11-07 02:40:54,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 865 to 865. [2024-11-07 02:40:54,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 865 states, 857 states have (on average 1.3337222870478413) internal successors, (1143), 857 states have internal predecessors, (1143), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-07 02:40:54,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 865 states to 865 states and 1155 transitions. [2024-11-07 02:40:54,415 INFO L78 Accepts]: Start accepts. Automaton has 865 states and 1155 transitions. Word has length 462 [2024-11-07 02:40:54,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:40:54,415 INFO L471 AbstractCegarLoop]: Abstraction has 865 states and 1155 transitions. [2024-11-07 02:40:54,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 87.0) internal successors, (435), 5 states have internal predecessors, (435), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-07 02:40:54,416 INFO L276 IsEmpty]: Start isEmpty. Operand 865 states and 1155 transitions. [2024-11-07 02:40:54,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 464 [2024-11-07 02:40:54,418 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:40:54,419 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:40:54,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-11-07 02:40:54,419 INFO L396 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:40:54,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:40:54,419 INFO L85 PathProgramCache]: Analyzing trace with hash 1587160914, now seen corresponding path program 1 times [2024-11-07 02:40:54,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 02:40:54,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17670789] [2024-11-07 02:40:54,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:40:54,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 02:40:54,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:55,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 02:40:55,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:55,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-07 02:40:55,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:55,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 02:40:55,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:55,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 340 [2024-11-07 02:40:55,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:55,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 356 [2024-11-07 02:40:55,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:55,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 368 [2024-11-07 02:40:55,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:55,025 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-07 02:40:55,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 02:40:55,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17670789] [2024-11-07 02:40:55,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17670789] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 02:40:55,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 02:40:55,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 02:40:55,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339699220] [2024-11-07 02:40:55,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 02:40:55,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 02:40:55,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 02:40:55,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 02:40:55,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-07 02:40:55,030 INFO L87 Difference]: Start difference. First operand 865 states and 1155 transitions. Second operand has 5 states, 5 states have (on average 87.2) internal successors, (436), 5 states have internal predecessors, (436), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-07 02:40:55,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:40:55,109 INFO L93 Difference]: Finished difference Result 1396 states and 1871 transitions. [2024-11-07 02:40:55,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 02:40:55,110 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 87.2) internal successors, (436), 5 states have internal predecessors, (436), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 463 [2024-11-07 02:40:55,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:40:55,112 INFO L225 Difference]: With dead ends: 1396 [2024-11-07 02:40:55,112 INFO L226 Difference]: Without dead ends: 865 [2024-11-07 02:40:55,113 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-07 02:40:55,113 INFO L432 NwaCegarLoop]: 757 mSDtfsCounter, 597 mSDsluCounter, 766 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 600 SdHoareTripleChecker+Valid, 1523 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 02:40:55,113 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [600 Valid, 1523 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 02:40:55,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 865 states. [2024-11-07 02:40:55,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 865 to 865. [2024-11-07 02:40:55,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 865 states, 857 states have (on average 1.3325554259043173) internal successors, (1142), 857 states have internal predecessors, (1142), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-07 02:40:55,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 865 states to 865 states and 1154 transitions. [2024-11-07 02:40:55,140 INFO L78 Accepts]: Start accepts. Automaton has 865 states and 1154 transitions. Word has length 463 [2024-11-07 02:40:55,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:40:55,140 INFO L471 AbstractCegarLoop]: Abstraction has 865 states and 1154 transitions. [2024-11-07 02:40:55,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 87.2) internal successors, (436), 5 states have internal predecessors, (436), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-07 02:40:55,141 INFO L276 IsEmpty]: Start isEmpty. Operand 865 states and 1154 transitions. [2024-11-07 02:40:55,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 465 [2024-11-07 02:40:55,146 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:40:55,146 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:40:55,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-11-07 02:40:55,148 INFO L396 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:40:55,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:40:55,149 INFO L85 PathProgramCache]: Analyzing trace with hash -1931108357, now seen corresponding path program 1 times [2024-11-07 02:40:55,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 02:40:55,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282890859] [2024-11-07 02:40:55,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:40:55,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 02:40:55,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:56,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 02:40:56,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:56,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-07 02:40:56,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:56,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 02:40:56,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:56,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 341 [2024-11-07 02:40:56,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:56,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 357 [2024-11-07 02:40:56,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:56,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 369 [2024-11-07 02:40:56,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:56,132 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-07 02:40:56,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 02:40:56,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282890859] [2024-11-07 02:40:56,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282890859] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 02:40:56,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 02:40:56,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 02:40:56,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831988735] [2024-11-07 02:40:56,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 02:40:56,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 02:40:56,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 02:40:56,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 02:40:56,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-07 02:40:56,138 INFO L87 Difference]: Start difference. First operand 865 states and 1154 transitions. Second operand has 5 states, 5 states have (on average 87.4) internal successors, (437), 5 states have internal predecessors, (437), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-07 02:40:56,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:40:56,418 INFO L93 Difference]: Finished difference Result 1396 states and 1869 transitions. [2024-11-07 02:40:56,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 02:40:56,418 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 87.4) internal successors, (437), 5 states have internal predecessors, (437), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 464 [2024-11-07 02:40:56,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:40:56,421 INFO L225 Difference]: With dead ends: 1396 [2024-11-07 02:40:56,421 INFO L226 Difference]: Without dead ends: 865 [2024-11-07 02:40:56,422 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-07 02:40:56,422 INFO L432 NwaCegarLoop]: 578 mSDtfsCounter, 1070 mSDsluCounter, 580 mSDsCounter, 0 mSdLazyCounter, 392 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1073 SdHoareTripleChecker+Valid, 1158 SdHoareTripleChecker+Invalid, 393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 02:40:56,422 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1073 Valid, 1158 Invalid, 393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 392 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 02:40:56,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 865 states. [2024-11-07 02:40:56,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 865 to 865. [2024-11-07 02:40:56,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 865 states, 857 states have (on average 1.3313885647607935) internal successors, (1141), 857 states have internal predecessors, (1141), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-07 02:40:56,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 865 states to 865 states and 1153 transitions. [2024-11-07 02:40:56,435 INFO L78 Accepts]: Start accepts. Automaton has 865 states and 1153 transitions. Word has length 464 [2024-11-07 02:40:56,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:40:56,435 INFO L471 AbstractCegarLoop]: Abstraction has 865 states and 1153 transitions. [2024-11-07 02:40:56,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 87.4) internal successors, (437), 5 states have internal predecessors, (437), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-07 02:40:56,436 INFO L276 IsEmpty]: Start isEmpty. Operand 865 states and 1153 transitions. [2024-11-07 02:40:56,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 466 [2024-11-07 02:40:56,438 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:40:56,439 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:40:56,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-11-07 02:40:56,439 INFO L396 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:40:56,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:40:56,439 INFO L85 PathProgramCache]: Analyzing trace with hash 68716189, now seen corresponding path program 1 times [2024-11-07 02:40:56,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 02:40:56,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664007438] [2024-11-07 02:40:56,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:40:56,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 02:40:56,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:57,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 02:40:57,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:57,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-07 02:40:57,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:57,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 02:40:57,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:57,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 342 [2024-11-07 02:40:57,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:57,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 358 [2024-11-07 02:40:57,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:57,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 370 [2024-11-07 02:40:57,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:57,572 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-07 02:40:57,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 02:40:57,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664007438] [2024-11-07 02:40:57,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664007438] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 02:40:57,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 02:40:57,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 02:40:57,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125436434] [2024-11-07 02:40:57,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 02:40:57,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 02:40:57,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 02:40:57,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 02:40:57,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 02:40:57,578 INFO L87 Difference]: Start difference. First operand 865 states and 1153 transitions. Second operand has 4 states, 4 states have (on average 109.5) internal successors, (438), 4 states have internal predecessors, (438), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-07 02:40:57,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:40:57,649 INFO L93 Difference]: Finished difference Result 1396 states and 1867 transitions. [2024-11-07 02:40:57,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 02:40:57,650 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 109.5) internal successors, (438), 4 states have internal predecessors, (438), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 465 [2024-11-07 02:40:57,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:40:57,657 INFO L225 Difference]: With dead ends: 1396 [2024-11-07 02:40:57,657 INFO L226 Difference]: Without dead ends: 865 [2024-11-07 02:40:57,659 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 02:40:57,659 INFO L432 NwaCegarLoop]: 756 mSDtfsCounter, 495 mSDsluCounter, 758 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 495 SdHoareTripleChecker+Valid, 1514 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 02:40:57,660 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [495 Valid, 1514 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 02:40:57,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 865 states. [2024-11-07 02:40:57,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 865 to 865. [2024-11-07 02:40:57,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 865 states, 857 states have (on average 1.3302217036172694) internal successors, (1140), 857 states have internal predecessors, (1140), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-07 02:40:57,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 865 states to 865 states and 1152 transitions. [2024-11-07 02:40:57,709 INFO L78 Accepts]: Start accepts. Automaton has 865 states and 1152 transitions. Word has length 465 [2024-11-07 02:40:57,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:40:57,710 INFO L471 AbstractCegarLoop]: Abstraction has 865 states and 1152 transitions. [2024-11-07 02:40:57,710 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 109.5) internal successors, (438), 4 states have internal predecessors, (438), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-07 02:40:57,710 INFO L276 IsEmpty]: Start isEmpty. Operand 865 states and 1152 transitions. [2024-11-07 02:40:57,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 467 [2024-11-07 02:40:57,719 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:40:57,719 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:40:57,719 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-11-07 02:40:57,719 INFO L396 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:40:57,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:40:57,720 INFO L85 PathProgramCache]: Analyzing trace with hash -2072862135, now seen corresponding path program 1 times [2024-11-07 02:40:57,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 02:40:57,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299957984] [2024-11-07 02:40:57,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:40:57,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 02:40:58,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:58,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 02:40:58,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:58,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-07 02:40:58,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:58,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 02:40:58,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:58,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 343 [2024-11-07 02:40:58,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:58,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 359 [2024-11-07 02:40:58,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:58,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 371 [2024-11-07 02:40:58,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:58,799 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-07 02:40:58,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 02:40:58,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299957984] [2024-11-07 02:40:58,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299957984] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 02:40:58,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 02:40:58,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 02:40:58,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097201526] [2024-11-07 02:40:58,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 02:40:58,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 02:40:58,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 02:40:58,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 02:40:58,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-07 02:40:58,801 INFO L87 Difference]: Start difference. First operand 865 states and 1152 transitions. Second operand has 5 states, 5 states have (on average 87.8) internal successors, (439), 5 states have internal predecessors, (439), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-07 02:40:58,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:40:58,871 INFO L93 Difference]: Finished difference Result 1396 states and 1865 transitions. [2024-11-07 02:40:58,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 02:40:58,871 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 87.8) internal successors, (439), 5 states have internal predecessors, (439), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 466 [2024-11-07 02:40:58,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:40:58,873 INFO L225 Difference]: With dead ends: 1396 [2024-11-07 02:40:58,873 INFO L226 Difference]: Without dead ends: 865 [2024-11-07 02:40:58,874 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-07 02:40:58,874 INFO L432 NwaCegarLoop]: 741 mSDtfsCounter, 655 mSDsluCounter, 750 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 655 SdHoareTripleChecker+Valid, 1491 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 02:40:58,874 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [655 Valid, 1491 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 02:40:58,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 865 states. [2024-11-07 02:40:58,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 865 to 865. [2024-11-07 02:40:58,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 865 states, 857 states have (on average 1.3290548424737456) internal successors, (1139), 857 states have internal predecessors, (1139), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-07 02:40:58,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 865 states to 865 states and 1151 transitions. [2024-11-07 02:40:58,883 INFO L78 Accepts]: Start accepts. Automaton has 865 states and 1151 transitions. Word has length 466 [2024-11-07 02:40:58,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:40:58,883 INFO L471 AbstractCegarLoop]: Abstraction has 865 states and 1151 transitions. [2024-11-07 02:40:58,884 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 87.8) internal successors, (439), 5 states have internal predecessors, (439), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-07 02:40:58,884 INFO L276 IsEmpty]: Start isEmpty. Operand 865 states and 1151 transitions. [2024-11-07 02:40:58,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 468 [2024-11-07 02:40:58,885 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:40:58,886 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:40:58,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2024-11-07 02:40:58,886 INFO L396 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:40:58,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:40:58,886 INFO L85 PathProgramCache]: Analyzing trace with hash -621088291, now seen corresponding path program 1 times [2024-11-07 02:40:58,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 02:40:58,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062007947] [2024-11-07 02:40:58,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:40:58,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 02:40:59,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:59,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 02:40:59,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:59,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-07 02:40:59,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:59,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 02:40:59,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:59,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 344 [2024-11-07 02:40:59,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:59,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 360 [2024-11-07 02:40:59,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:59,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 372 [2024-11-07 02:40:59,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:40:59,874 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-07 02:40:59,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 02:40:59,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062007947] [2024-11-07 02:40:59,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062007947] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 02:40:59,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 02:40:59,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 02:40:59,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076310867] [2024-11-07 02:40:59,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 02:40:59,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 02:40:59,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 02:40:59,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 02:40:59,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-07 02:40:59,876 INFO L87 Difference]: Start difference. First operand 865 states and 1151 transitions. Second operand has 5 states, 5 states have (on average 88.0) internal successors, (440), 5 states have internal predecessors, (440), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-07 02:40:59,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:40:59,944 INFO L93 Difference]: Finished difference Result 1396 states and 1863 transitions. [2024-11-07 02:40:59,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 02:40:59,945 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 88.0) internal successors, (440), 5 states have internal predecessors, (440), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 467 [2024-11-07 02:40:59,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:40:59,946 INFO L225 Difference]: With dead ends: 1396 [2024-11-07 02:40:59,946 INFO L226 Difference]: Without dead ends: 865 [2024-11-07 02:40:59,947 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-07 02:40:59,947 INFO L432 NwaCegarLoop]: 741 mSDtfsCounter, 1166 mSDsluCounter, 743 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1166 SdHoareTripleChecker+Valid, 1484 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 02:40:59,947 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1166 Valid, 1484 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 02:40:59,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 865 states. [2024-11-07 02:40:59,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 865 to 865. [2024-11-07 02:40:59,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 865 states, 857 states have (on average 1.3278879813302218) internal successors, (1138), 857 states have internal predecessors, (1138), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-07 02:40:59,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 865 states to 865 states and 1150 transitions. [2024-11-07 02:40:59,956 INFO L78 Accepts]: Start accepts. Automaton has 865 states and 1150 transitions. Word has length 467 [2024-11-07 02:40:59,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:40:59,957 INFO L471 AbstractCegarLoop]: Abstraction has 865 states and 1150 transitions. [2024-11-07 02:40:59,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 88.0) internal successors, (440), 5 states have internal predecessors, (440), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-07 02:40:59,957 INFO L276 IsEmpty]: Start isEmpty. Operand 865 states and 1150 transitions. [2024-11-07 02:40:59,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 469 [2024-11-07 02:40:59,959 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:40:59,959 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:40:59,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2024-11-07 02:40:59,959 INFO L396 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:40:59,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:40:59,959 INFO L85 PathProgramCache]: Analyzing trace with hash 1484072218, now seen corresponding path program 1 times [2024-11-07 02:40:59,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 02:40:59,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143761894] [2024-11-07 02:40:59,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:40:59,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 02:41:00,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:00,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 02:41:00,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:00,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-07 02:41:00,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:00,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 02:41:00,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:00,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 345 [2024-11-07 02:41:00,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:00,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 361 [2024-11-07 02:41:00,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:00,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 373 [2024-11-07 02:41:00,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:00,967 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-07 02:41:00,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 02:41:00,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143761894] [2024-11-07 02:41:00,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143761894] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 02:41:00,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 02:41:00,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 02:41:00,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527937451] [2024-11-07 02:41:00,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 02:41:00,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 02:41:00,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 02:41:00,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 02:41:00,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 02:41:00,969 INFO L87 Difference]: Start difference. First operand 865 states and 1150 transitions. Second operand has 4 states, 4 states have (on average 110.25) internal successors, (441), 4 states have internal predecessors, (441), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-07 02:41:01,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:41:01,024 INFO L93 Difference]: Finished difference Result 1396 states and 1861 transitions. [2024-11-07 02:41:01,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 02:41:01,024 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 110.25) internal successors, (441), 4 states have internal predecessors, (441), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 468 [2024-11-07 02:41:01,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:41:01,026 INFO L225 Difference]: With dead ends: 1396 [2024-11-07 02:41:01,026 INFO L226 Difference]: Without dead ends: 865 [2024-11-07 02:41:01,026 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 02:41:01,026 INFO L432 NwaCegarLoop]: 741 mSDtfsCounter, 504 mSDsluCounter, 743 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 504 SdHoareTripleChecker+Valid, 1484 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 02:41:01,027 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [504 Valid, 1484 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 02:41:01,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 865 states. [2024-11-07 02:41:01,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 865 to 865. [2024-11-07 02:41:01,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 865 states, 857 states have (on average 1.3267211201866977) internal successors, (1137), 857 states have internal predecessors, (1137), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-07 02:41:01,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 865 states to 865 states and 1149 transitions. [2024-11-07 02:41:01,035 INFO L78 Accepts]: Start accepts. Automaton has 865 states and 1149 transitions. Word has length 468 [2024-11-07 02:41:01,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:41:01,035 INFO L471 AbstractCegarLoop]: Abstraction has 865 states and 1149 transitions. [2024-11-07 02:41:01,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 110.25) internal successors, (441), 4 states have internal predecessors, (441), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-07 02:41:01,036 INFO L276 IsEmpty]: Start isEmpty. Operand 865 states and 1149 transitions. [2024-11-07 02:41:01,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 470 [2024-11-07 02:41:01,037 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:41:01,038 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:41:01,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2024-11-07 02:41:01,038 INFO L396 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:41:01,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:41:01,038 INFO L85 PathProgramCache]: Analyzing trace with hash -29552052, now seen corresponding path program 1 times [2024-11-07 02:41:01,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 02:41:01,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291236635] [2024-11-07 02:41:01,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:41:01,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 02:41:01,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:02,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 02:41:02,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:02,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-07 02:41:02,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:02,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 02:41:02,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:02,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 346 [2024-11-07 02:41:02,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:02,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 362 [2024-11-07 02:41:02,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:02,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 374 [2024-11-07 02:41:02,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:02,077 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-07 02:41:02,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 02:41:02,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291236635] [2024-11-07 02:41:02,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1291236635] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 02:41:02,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 02:41:02,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 02:41:02,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660861532] [2024-11-07 02:41:02,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 02:41:02,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 02:41:02,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 02:41:02,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 02:41:02,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-07 02:41:02,079 INFO L87 Difference]: Start difference. First operand 865 states and 1149 transitions. Second operand has 5 states, 5 states have (on average 88.4) internal successors, (442), 5 states have internal predecessors, (442), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-07 02:41:02,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:41:02,222 INFO L93 Difference]: Finished difference Result 1396 states and 1859 transitions. [2024-11-07 02:41:02,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 02:41:02,222 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 88.4) internal successors, (442), 5 states have internal predecessors, (442), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 469 [2024-11-07 02:41:02,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:41:02,224 INFO L225 Difference]: With dead ends: 1396 [2024-11-07 02:41:02,224 INFO L226 Difference]: Without dead ends: 865 [2024-11-07 02:41:02,225 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-07 02:41:02,225 INFO L432 NwaCegarLoop]: 710 mSDtfsCounter, 637 mSDsluCounter, 719 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 637 SdHoareTripleChecker+Valid, 1429 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 02:41:02,225 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [637 Valid, 1429 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 02:41:02,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 865 states. [2024-11-07 02:41:02,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 865 to 865. [2024-11-07 02:41:02,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 865 states, 857 states have (on average 1.325554259043174) internal successors, (1136), 857 states have internal predecessors, (1136), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-07 02:41:02,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 865 states to 865 states and 1148 transitions. [2024-11-07 02:41:02,235 INFO L78 Accepts]: Start accepts. Automaton has 865 states and 1148 transitions. Word has length 469 [2024-11-07 02:41:02,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:41:02,235 INFO L471 AbstractCegarLoop]: Abstraction has 865 states and 1148 transitions. [2024-11-07 02:41:02,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 88.4) internal successors, (442), 5 states have internal predecessors, (442), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-07 02:41:02,235 INFO L276 IsEmpty]: Start isEmpty. Operand 865 states and 1148 transitions. [2024-11-07 02:41:02,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 471 [2024-11-07 02:41:02,237 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:41:02,237 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:41:02,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2024-11-07 02:41:02,238 INFO L396 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:41:02,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:41:02,238 INFO L85 PathProgramCache]: Analyzing trace with hash 1861250744, now seen corresponding path program 1 times [2024-11-07 02:41:02,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 02:41:02,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381527780] [2024-11-07 02:41:02,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:41:02,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 02:41:02,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:03,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 02:41:03,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:03,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-07 02:41:03,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:03,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 02:41:03,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:03,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 347 [2024-11-07 02:41:03,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:03,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 363 [2024-11-07 02:41:03,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:03,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 375 [2024-11-07 02:41:03,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:03,192 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-07 02:41:03,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 02:41:03,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381527780] [2024-11-07 02:41:03,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381527780] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 02:41:03,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 02:41:03,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 02:41:03,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561375144] [2024-11-07 02:41:03,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 02:41:03,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 02:41:03,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 02:41:03,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 02:41:03,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-07 02:41:03,194 INFO L87 Difference]: Start difference. First operand 865 states and 1148 transitions. Second operand has 5 states, 5 states have (on average 88.6) internal successors, (443), 5 states have internal predecessors, (443), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-07 02:41:03,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:41:03,297 INFO L93 Difference]: Finished difference Result 1396 states and 1857 transitions. [2024-11-07 02:41:03,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 02:41:03,297 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 88.6) internal successors, (443), 5 states have internal predecessors, (443), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 470 [2024-11-07 02:41:03,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:41:03,299 INFO L225 Difference]: With dead ends: 1396 [2024-11-07 02:41:03,299 INFO L226 Difference]: Without dead ends: 865 [2024-11-07 02:41:03,299 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-07 02:41:03,300 INFO L432 NwaCegarLoop]: 710 mSDtfsCounter, 636 mSDsluCounter, 719 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 636 SdHoareTripleChecker+Valid, 1429 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 02:41:03,300 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [636 Valid, 1429 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 02:41:03,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 865 states. [2024-11-07 02:41:03,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 865 to 865. [2024-11-07 02:41:03,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 865 states, 857 states have (on average 1.3243873978996499) internal successors, (1135), 857 states have internal predecessors, (1135), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-07 02:41:03,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 865 states to 865 states and 1147 transitions. [2024-11-07 02:41:03,308 INFO L78 Accepts]: Start accepts. Automaton has 865 states and 1147 transitions. Word has length 470 [2024-11-07 02:41:03,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:41:03,309 INFO L471 AbstractCegarLoop]: Abstraction has 865 states and 1147 transitions. [2024-11-07 02:41:03,309 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 88.6) internal successors, (443), 5 states have internal predecessors, (443), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-07 02:41:03,309 INFO L276 IsEmpty]: Start isEmpty. Operand 865 states and 1147 transitions. [2024-11-07 02:41:03,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 472 [2024-11-07 02:41:03,311 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:41:03,311 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:41:03,311 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2024-11-07 02:41:03,311 INFO L396 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:41:03,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:41:03,311 INFO L85 PathProgramCache]: Analyzing trace with hash -532059941, now seen corresponding path program 1 times [2024-11-07 02:41:03,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 02:41:03,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671947509] [2024-11-07 02:41:03,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:41:03,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 02:41:03,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:04,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 02:41:04,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:04,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-07 02:41:04,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:04,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 02:41:04,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:04,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 348 [2024-11-07 02:41:04,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:04,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 364 [2024-11-07 02:41:04,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:04,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 376 [2024-11-07 02:41:04,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:04,420 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-07 02:41:04,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 02:41:04,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671947509] [2024-11-07 02:41:04,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671947509] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 02:41:04,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 02:41:04,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 02:41:04,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728074493] [2024-11-07 02:41:04,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 02:41:04,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 02:41:04,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 02:41:04,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 02:41:04,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 02:41:04,422 INFO L87 Difference]: Start difference. First operand 865 states and 1147 transitions. Second operand has 4 states, 4 states have (on average 111.0) internal successors, (444), 4 states have internal predecessors, (444), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-07 02:41:04,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:41:04,510 INFO L93 Difference]: Finished difference Result 1396 states and 1855 transitions. [2024-11-07 02:41:04,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 02:41:04,510 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 111.0) internal successors, (444), 4 states have internal predecessors, (444), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 471 [2024-11-07 02:41:04,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:41:04,511 INFO L225 Difference]: With dead ends: 1396 [2024-11-07 02:41:04,511 INFO L226 Difference]: Without dead ends: 865 [2024-11-07 02:41:04,512 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 02:41:04,512 INFO L432 NwaCegarLoop]: 710 mSDtfsCounter, 557 mSDsluCounter, 712 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 557 SdHoareTripleChecker+Valid, 1422 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 02:41:04,512 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [557 Valid, 1422 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 02:41:04,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 865 states. [2024-11-07 02:41:04,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 865 to 865. [2024-11-07 02:41:04,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 865 states, 857 states have (on average 1.323220536756126) internal successors, (1134), 857 states have internal predecessors, (1134), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-07 02:41:04,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 865 states to 865 states and 1146 transitions. [2024-11-07 02:41:04,521 INFO L78 Accepts]: Start accepts. Automaton has 865 states and 1146 transitions. Word has length 471 [2024-11-07 02:41:04,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:41:04,521 INFO L471 AbstractCegarLoop]: Abstraction has 865 states and 1146 transitions. [2024-11-07 02:41:04,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 111.0) internal successors, (444), 4 states have internal predecessors, (444), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-07 02:41:04,521 INFO L276 IsEmpty]: Start isEmpty. Operand 865 states and 1146 transitions. [2024-11-07 02:41:04,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 473 [2024-11-07 02:41:04,523 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:41:04,523 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:41:04,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2024-11-07 02:41:04,524 INFO L396 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:41:04,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:41:04,524 INFO L85 PathProgramCache]: Analyzing trace with hash 1148349673, now seen corresponding path program 1 times [2024-11-07 02:41:04,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 02:41:04,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864035629] [2024-11-07 02:41:04,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:41:04,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 02:41:04,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:05,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 02:41:05,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:05,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-07 02:41:05,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:05,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 02:41:05,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:05,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 349 [2024-11-07 02:41:05,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:05,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 365 [2024-11-07 02:41:05,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:05,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 377 [2024-11-07 02:41:05,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:05,520 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-07 02:41:05,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 02:41:05,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864035629] [2024-11-07 02:41:05,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864035629] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 02:41:05,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 02:41:05,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 02:41:05,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698734781] [2024-11-07 02:41:05,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 02:41:05,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 02:41:05,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 02:41:05,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 02:41:05,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-07 02:41:05,523 INFO L87 Difference]: Start difference. First operand 865 states and 1146 transitions. Second operand has 5 states, 5 states have (on average 89.0) internal successors, (445), 5 states have internal predecessors, (445), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-07 02:41:05,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:41:05,652 INFO L93 Difference]: Finished difference Result 1396 states and 1853 transitions. [2024-11-07 02:41:05,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 02:41:05,652 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 89.0) internal successors, (445), 5 states have internal predecessors, (445), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 472 [2024-11-07 02:41:05,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:41:05,654 INFO L225 Difference]: With dead ends: 1396 [2024-11-07 02:41:05,654 INFO L226 Difference]: Without dead ends: 865 [2024-11-07 02:41:05,655 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-07 02:41:05,655 INFO L432 NwaCegarLoop]: 710 mSDtfsCounter, 634 mSDsluCounter, 719 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 634 SdHoareTripleChecker+Valid, 1429 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 02:41:05,656 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [634 Valid, 1429 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 02:41:05,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 865 states. [2024-11-07 02:41:05,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 865 to 865. [2024-11-07 02:41:05,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 865 states, 857 states have (on average 1.322053675612602) internal successors, (1133), 857 states have internal predecessors, (1133), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-07 02:41:05,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 865 states to 865 states and 1145 transitions. [2024-11-07 02:41:05,675 INFO L78 Accepts]: Start accepts. Automaton has 865 states and 1145 transitions. Word has length 472 [2024-11-07 02:41:05,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:41:05,675 INFO L471 AbstractCegarLoop]: Abstraction has 865 states and 1145 transitions. [2024-11-07 02:41:05,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 89.0) internal successors, (445), 5 states have internal predecessors, (445), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-07 02:41:05,676 INFO L276 IsEmpty]: Start isEmpty. Operand 865 states and 1145 transitions. [2024-11-07 02:41:05,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 474 [2024-11-07 02:41:05,680 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:41:05,680 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:41:05,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2024-11-07 02:41:05,680 INFO L396 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:41:05,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:41:05,681 INFO L85 PathProgramCache]: Analyzing trace with hash -1007736342, now seen corresponding path program 1 times [2024-11-07 02:41:05,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 02:41:05,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364111816] [2024-11-07 02:41:05,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:41:05,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 02:41:06,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:06,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 02:41:06,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:06,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-07 02:41:06,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:06,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 02:41:06,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:06,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 350 [2024-11-07 02:41:06,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:06,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 366 [2024-11-07 02:41:06,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:06,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 378 [2024-11-07 02:41:06,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:06,722 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-07 02:41:06,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 02:41:06,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364111816] [2024-11-07 02:41:06,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364111816] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 02:41:06,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 02:41:06,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 02:41:06,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437441535] [2024-11-07 02:41:06,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 02:41:06,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 02:41:06,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 02:41:06,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 02:41:06,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-07 02:41:06,724 INFO L87 Difference]: Start difference. First operand 865 states and 1145 transitions. Second operand has 5 states, 5 states have (on average 89.2) internal successors, (446), 5 states have internal predecessors, (446), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-07 02:41:06,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:41:06,825 INFO L93 Difference]: Finished difference Result 1396 states and 1851 transitions. [2024-11-07 02:41:06,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 02:41:06,826 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 89.2) internal successors, (446), 5 states have internal predecessors, (446), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 473 [2024-11-07 02:41:06,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:41:06,827 INFO L225 Difference]: With dead ends: 1396 [2024-11-07 02:41:06,827 INFO L226 Difference]: Without dead ends: 865 [2024-11-07 02:41:06,828 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-07 02:41:06,828 INFO L432 NwaCegarLoop]: 710 mSDtfsCounter, 633 mSDsluCounter, 719 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 633 SdHoareTripleChecker+Valid, 1429 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 02:41:06,828 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [633 Valid, 1429 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 02:41:06,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 865 states. [2024-11-07 02:41:06,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 865 to 865. [2024-11-07 02:41:06,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 865 states, 857 states have (on average 1.3208868144690782) internal successors, (1132), 857 states have internal predecessors, (1132), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-07 02:41:06,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 865 states to 865 states and 1144 transitions. [2024-11-07 02:41:06,837 INFO L78 Accepts]: Start accepts. Automaton has 865 states and 1144 transitions. Word has length 473 [2024-11-07 02:41:06,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:41:06,837 INFO L471 AbstractCegarLoop]: Abstraction has 865 states and 1144 transitions. [2024-11-07 02:41:06,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 89.2) internal successors, (446), 5 states have internal predecessors, (446), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-07 02:41:06,837 INFO L276 IsEmpty]: Start isEmpty. Operand 865 states and 1144 transitions. [2024-11-07 02:41:06,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 475 [2024-11-07 02:41:06,839 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:41:06,839 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:41:06,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2024-11-07 02:41:06,839 INFO L396 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:41:06,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:41:06,840 INFO L85 PathProgramCache]: Analyzing trace with hash 1633999002, now seen corresponding path program 1 times [2024-11-07 02:41:06,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 02:41:06,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409612400] [2024-11-07 02:41:06,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:41:06,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 02:41:07,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:07,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 02:41:07,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:07,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-07 02:41:07,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:07,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 02:41:07,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:07,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 351 [2024-11-07 02:41:07,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:07,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 367 [2024-11-07 02:41:07,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:07,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 379 [2024-11-07 02:41:07,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:07,804 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-07 02:41:07,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 02:41:07,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409612400] [2024-11-07 02:41:07,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409612400] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 02:41:07,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 02:41:07,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 02:41:07,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667879520] [2024-11-07 02:41:07,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 02:41:07,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 02:41:07,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 02:41:07,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 02:41:07,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-07 02:41:07,806 INFO L87 Difference]: Start difference. First operand 865 states and 1144 transitions. Second operand has 5 states, 5 states have (on average 89.4) internal successors, (447), 5 states have internal predecessors, (447), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-07 02:41:07,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:41:07,920 INFO L93 Difference]: Finished difference Result 1396 states and 1849 transitions. [2024-11-07 02:41:07,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 02:41:07,921 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 89.4) internal successors, (447), 5 states have internal predecessors, (447), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 474 [2024-11-07 02:41:07,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:41:07,922 INFO L225 Difference]: With dead ends: 1396 [2024-11-07 02:41:07,922 INFO L226 Difference]: Without dead ends: 865 [2024-11-07 02:41:07,923 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-07 02:41:07,923 INFO L432 NwaCegarLoop]: 710 mSDtfsCounter, 1161 mSDsluCounter, 712 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1161 SdHoareTripleChecker+Valid, 1422 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 02:41:07,923 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1161 Valid, 1422 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 02:41:07,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 865 states. [2024-11-07 02:41:07,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 865 to 865. [2024-11-07 02:41:07,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 865 states, 857 states have (on average 1.3197199533255544) internal successors, (1131), 857 states have internal predecessors, (1131), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-07 02:41:07,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 865 states to 865 states and 1143 transitions. [2024-11-07 02:41:07,932 INFO L78 Accepts]: Start accepts. Automaton has 865 states and 1143 transitions. Word has length 474 [2024-11-07 02:41:07,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:41:07,932 INFO L471 AbstractCegarLoop]: Abstraction has 865 states and 1143 transitions. [2024-11-07 02:41:07,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 89.4) internal successors, (447), 5 states have internal predecessors, (447), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-07 02:41:07,932 INFO L276 IsEmpty]: Start isEmpty. Operand 865 states and 1143 transitions. [2024-11-07 02:41:07,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 476 [2024-11-07 02:41:07,934 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:41:07,934 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:41:07,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2024-11-07 02:41:07,934 INFO L396 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:41:07,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:41:07,935 INFO L85 PathProgramCache]: Analyzing trace with hash 1272882553, now seen corresponding path program 1 times [2024-11-07 02:41:07,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 02:41:07,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984507068] [2024-11-07 02:41:07,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:41:07,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 02:41:08,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:09,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 02:41:09,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:09,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-07 02:41:09,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:09,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 02:41:09,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:09,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 352 [2024-11-07 02:41:09,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:09,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 368 [2024-11-07 02:41:09,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:09,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 380 [2024-11-07 02:41:09,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:09,025 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-07 02:41:09,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 02:41:09,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984507068] [2024-11-07 02:41:09,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984507068] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 02:41:09,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 02:41:09,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 02:41:09,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35797601] [2024-11-07 02:41:09,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 02:41:09,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 02:41:09,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 02:41:09,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 02:41:09,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 02:41:09,027 INFO L87 Difference]: Start difference. First operand 865 states and 1143 transitions. Second operand has 4 states, 4 states have (on average 112.0) internal successors, (448), 4 states have internal predecessors, (448), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-07 02:41:09,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:41:09,120 INFO L93 Difference]: Finished difference Result 1396 states and 1847 transitions. [2024-11-07 02:41:09,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 02:41:09,121 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 112.0) internal successors, (448), 4 states have internal predecessors, (448), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 475 [2024-11-07 02:41:09,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:41:09,123 INFO L225 Difference]: With dead ends: 1396 [2024-11-07 02:41:09,123 INFO L226 Difference]: Without dead ends: 865 [2024-11-07 02:41:09,123 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 02:41:09,124 INFO L432 NwaCegarLoop]: 710 mSDtfsCounter, 521 mSDsluCounter, 712 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 521 SdHoareTripleChecker+Valid, 1422 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 02:41:09,124 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [521 Valid, 1422 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 02:41:09,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 865 states. [2024-11-07 02:41:09,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 865 to 865. [2024-11-07 02:41:09,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 865 states, 857 states have (on average 1.3185530921820303) internal successors, (1130), 857 states have internal predecessors, (1130), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-07 02:41:09,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 865 states to 865 states and 1142 transitions. [2024-11-07 02:41:09,137 INFO L78 Accepts]: Start accepts. Automaton has 865 states and 1142 transitions. Word has length 475 [2024-11-07 02:41:09,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:41:09,137 INFO L471 AbstractCegarLoop]: Abstraction has 865 states and 1142 transitions. [2024-11-07 02:41:09,138 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 112.0) internal successors, (448), 4 states have internal predecessors, (448), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-07 02:41:09,138 INFO L276 IsEmpty]: Start isEmpty. Operand 865 states and 1142 transitions. [2024-11-07 02:41:09,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2024-11-07 02:41:09,140 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:41:09,140 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:41:09,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2024-11-07 02:41:09,140 INFO L396 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:41:09,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:41:09,141 INFO L85 PathProgramCache]: Analyzing trace with hash 1244619211, now seen corresponding path program 1 times [2024-11-07 02:41:09,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 02:41:09,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825091898] [2024-11-07 02:41:09,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:41:09,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 02:41:09,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:10,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 02:41:10,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:10,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-07 02:41:10,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:10,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 02:41:10,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:10,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 353 [2024-11-07 02:41:10,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:10,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 369 [2024-11-07 02:41:10,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:10,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 381 [2024-11-07 02:41:10,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:10,321 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-07 02:41:10,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 02:41:10,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825091898] [2024-11-07 02:41:10,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825091898] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 02:41:10,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 02:41:10,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 02:41:10,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833240763] [2024-11-07 02:41:10,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 02:41:10,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 02:41:10,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 02:41:10,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 02:41:10,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 02:41:10,322 INFO L87 Difference]: Start difference. First operand 865 states and 1142 transitions. Second operand has 6 states, 6 states have (on average 74.83333333333333) internal successors, (449), 6 states have internal predecessors, (449), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-07 02:41:10,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:41:10,648 INFO L93 Difference]: Finished difference Result 1999 states and 2653 transitions. [2024-11-07 02:41:10,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 02:41:10,648 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 74.83333333333333) internal successors, (449), 6 states have internal predecessors, (449), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 476 [2024-11-07 02:41:10,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:41:10,651 INFO L225 Difference]: With dead ends: 1999 [2024-11-07 02:41:10,651 INFO L226 Difference]: Without dead ends: 1468 [2024-11-07 02:41:10,652 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-07 02:41:10,652 INFO L432 NwaCegarLoop]: 653 mSDtfsCounter, 713 mSDsluCounter, 2113 mSDsCounter, 0 mSdLazyCounter, 569 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 716 SdHoareTripleChecker+Valid, 2766 SdHoareTripleChecker+Invalid, 577 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 569 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 02:41:10,652 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [716 Valid, 2766 Invalid, 577 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 569 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 02:41:10,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1468 states. [2024-11-07 02:41:10,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1468 to 1352. [2024-11-07 02:41:10,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1352 states, 1341 states have (on average 1.3154362416107384) internal successors, (1764), 1341 states have internal predecessors, (1764), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-07 02:41:10,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1352 states to 1352 states and 1782 transitions. [2024-11-07 02:41:10,668 INFO L78 Accepts]: Start accepts. Automaton has 1352 states and 1782 transitions. Word has length 476 [2024-11-07 02:41:10,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:41:10,668 INFO L471 AbstractCegarLoop]: Abstraction has 1352 states and 1782 transitions. [2024-11-07 02:41:10,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 74.83333333333333) internal successors, (449), 6 states have internal predecessors, (449), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-07 02:41:10,669 INFO L276 IsEmpty]: Start isEmpty. Operand 1352 states and 1782 transitions. [2024-11-07 02:41:10,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 478 [2024-11-07 02:41:10,673 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:41:10,673 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:41:10,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2024-11-07 02:41:10,673 INFO L396 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:41:10,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:41:10,674 INFO L85 PathProgramCache]: Analyzing trace with hash 30361493, now seen corresponding path program 1 times [2024-11-07 02:41:10,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 02:41:10,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835742858] [2024-11-07 02:41:10,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:41:10,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 02:41:11,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:12,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 02:41:12,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:12,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-07 02:41:12,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:12,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 02:41:12,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:12,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 354 [2024-11-07 02:41:12,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:12,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 370 [2024-11-07 02:41:12,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:12,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 382 [2024-11-07 02:41:12,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:12,079 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-07 02:41:12,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 02:41:12,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835742858] [2024-11-07 02:41:12,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835742858] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 02:41:12,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 02:41:12,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 02:41:12,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865062108] [2024-11-07 02:41:12,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 02:41:12,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 02:41:12,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 02:41:12,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 02:41:12,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-07 02:41:12,081 INFO L87 Difference]: Start difference. First operand 1352 states and 1782 transitions. Second operand has 6 states, 6 states have (on average 75.0) internal successors, (450), 6 states have internal predecessors, (450), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-07 02:41:12,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:41:12,541 INFO L93 Difference]: Finished difference Result 1906 states and 2519 transitions. [2024-11-07 02:41:12,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 02:41:12,541 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 75.0) internal successors, (450), 6 states have internal predecessors, (450), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 477 [2024-11-07 02:41:12,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:41:12,544 INFO L225 Difference]: With dead ends: 1906 [2024-11-07 02:41:12,545 INFO L226 Difference]: Without dead ends: 1375 [2024-11-07 02:41:12,545 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 16 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 02:41:12,546 INFO L432 NwaCegarLoop]: 568 mSDtfsCounter, 1340 mSDsluCounter, 1674 mSDsCounter, 0 mSdLazyCounter, 791 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1343 SdHoareTripleChecker+Valid, 2242 SdHoareTripleChecker+Invalid, 791 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 791 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 02:41:12,547 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1343 Valid, 2242 Invalid, 791 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 791 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 02:41:12,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1375 states. [2024-11-07 02:41:12,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1375 to 1353. [2024-11-07 02:41:12,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1353 states, 1342 states have (on average 1.3152011922503726) internal successors, (1765), 1342 states have internal predecessors, (1765), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-07 02:41:12,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1353 states to 1353 states and 1783 transitions. [2024-11-07 02:41:12,562 INFO L78 Accepts]: Start accepts. Automaton has 1353 states and 1783 transitions. Word has length 477 [2024-11-07 02:41:12,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:41:12,562 INFO L471 AbstractCegarLoop]: Abstraction has 1353 states and 1783 transitions. [2024-11-07 02:41:12,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 75.0) internal successors, (450), 6 states have internal predecessors, (450), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-07 02:41:12,563 INFO L276 IsEmpty]: Start isEmpty. Operand 1353 states and 1783 transitions. [2024-11-07 02:41:12,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 478 [2024-11-07 02:41:12,565 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:41:12,565 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:41:12,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2024-11-07 02:41:12,566 INFO L396 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:41:12,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:41:12,566 INFO L85 PathProgramCache]: Analyzing trace with hash -1095729214, now seen corresponding path program 1 times [2024-11-07 02:41:12,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 02:41:12,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557364455] [2024-11-07 02:41:12,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:41:12,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 02:41:13,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:14,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 02:41:14,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:14,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 02:41:14,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:14,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 02:41:14,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:14,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 354 [2024-11-07 02:41:14,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:14,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 370 [2024-11-07 02:41:14,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:14,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 382 [2024-11-07 02:41:14,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:14,098 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2024-11-07 02:41:14,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 02:41:14,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557364455] [2024-11-07 02:41:14,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557364455] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 02:41:14,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 02:41:14,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 02:41:14,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335691829] [2024-11-07 02:41:14,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 02:41:14,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 02:41:14,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 02:41:14,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 02:41:14,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-07 02:41:14,100 INFO L87 Difference]: Start difference. First operand 1353 states and 1783 transitions. Second operand has 8 states, 8 states have (on average 46.0) internal successors, (368), 8 states have internal predecessors, (368), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-07 02:41:14,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:41:14,238 INFO L93 Difference]: Finished difference Result 3074 states and 4032 transitions. [2024-11-07 02:41:14,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 02:41:14,239 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 46.0) internal successors, (368), 8 states have internal predecessors, (368), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 477 [2024-11-07 02:41:14,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:41:14,246 INFO L225 Difference]: With dead ends: 3074 [2024-11-07 02:41:14,246 INFO L226 Difference]: Without dead ends: 2361 [2024-11-07 02:41:14,248 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-07 02:41:14,252 INFO L432 NwaCegarLoop]: 1824 mSDtfsCounter, 1146 mSDsluCounter, 8579 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1149 SdHoareTripleChecker+Valid, 10403 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 02:41:14,252 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1149 Valid, 10403 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 02:41:14,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2361 states. [2024-11-07 02:41:14,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2361 to 1420. [2024-11-07 02:41:14,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1420 states, 1406 states have (on average 1.3200568990042674) internal successors, (1856), 1406 states have internal predecessors, (1856), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-07 02:41:14,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1420 states to 1420 states and 1880 transitions. [2024-11-07 02:41:14,291 INFO L78 Accepts]: Start accepts. Automaton has 1420 states and 1880 transitions. Word has length 477 [2024-11-07 02:41:14,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:41:14,291 INFO L471 AbstractCegarLoop]: Abstraction has 1420 states and 1880 transitions. [2024-11-07 02:41:14,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 46.0) internal successors, (368), 8 states have internal predecessors, (368), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-07 02:41:14,292 INFO L276 IsEmpty]: Start isEmpty. Operand 1420 states and 1880 transitions. [2024-11-07 02:41:14,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 479 [2024-11-07 02:41:14,296 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:41:14,296 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:41:14,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2024-11-07 02:41:14,296 INFO L396 AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:41:14,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:41:14,297 INFO L85 PathProgramCache]: Analyzing trace with hash 367026472, now seen corresponding path program 1 times [2024-11-07 02:41:14,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 02:41:14,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657701615] [2024-11-07 02:41:14,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:41:14,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 02:41:15,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:16,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 02:41:16,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:16,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-07 02:41:16,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:16,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 02:41:16,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:16,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 355 [2024-11-07 02:41:16,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:16,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 371 [2024-11-07 02:41:16,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:16,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 383 [2024-11-07 02:41:16,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:16,068 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 129 trivial. 0 not checked. [2024-11-07 02:41:16,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 02:41:16,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657701615] [2024-11-07 02:41:16,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657701615] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 02:41:16,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 02:41:16,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 02:41:16,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299623864] [2024-11-07 02:41:16,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 02:41:16,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 02:41:16,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 02:41:16,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 02:41:16,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 02:41:16,071 INFO L87 Difference]: Start difference. First operand 1420 states and 1880 transitions. Second operand has 7 states, 7 states have (on average 55.0) internal successors, (385), 7 states have internal predecessors, (385), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-07 02:41:16,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:41:16,345 INFO L93 Difference]: Finished difference Result 2814 states and 3716 transitions. [2024-11-07 02:41:16,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 02:41:16,346 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 55.0) internal successors, (385), 7 states have internal predecessors, (385), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 478 [2024-11-07 02:41:16,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:41:16,348 INFO L225 Difference]: With dead ends: 2814 [2024-11-07 02:41:16,348 INFO L226 Difference]: Without dead ends: 1436 [2024-11-07 02:41:16,350 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-07 02:41:16,351 INFO L432 NwaCegarLoop]: 740 mSDtfsCounter, 786 mSDsluCounter, 2782 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 788 SdHoareTripleChecker+Valid, 3522 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 02:41:16,351 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [788 Valid, 3522 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 286 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 02:41:16,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1436 states. [2024-11-07 02:41:16,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1436 to 1428. [2024-11-07 02:41:16,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1428 states, 1414 states have (on average 1.3154172560113153) internal successors, (1860), 1414 states have internal predecessors, (1860), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-07 02:41:16,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1428 states to 1428 states and 1884 transitions. [2024-11-07 02:41:16,369 INFO L78 Accepts]: Start accepts. Automaton has 1428 states and 1884 transitions. Word has length 478 [2024-11-07 02:41:16,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:41:16,369 INFO L471 AbstractCegarLoop]: Abstraction has 1428 states and 1884 transitions. [2024-11-07 02:41:16,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 55.0) internal successors, (385), 7 states have internal predecessors, (385), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-07 02:41:16,370 INFO L276 IsEmpty]: Start isEmpty. Operand 1428 states and 1884 transitions. [2024-11-07 02:41:16,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 481 [2024-11-07 02:41:16,372 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:41:16,372 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:41:16,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2024-11-07 02:41:16,372 INFO L396 AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:41:16,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:41:16,373 INFO L85 PathProgramCache]: Analyzing trace with hash -986557952, now seen corresponding path program 1 times [2024-11-07 02:41:16,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 02:41:16,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696759252] [2024-11-07 02:41:16,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:41:16,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 02:41:17,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:17,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 02:41:17,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:17,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 02:41:17,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:17,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 02:41:17,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:17,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 356 [2024-11-07 02:41:17,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:17,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 373 [2024-11-07 02:41:17,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:17,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 385 [2024-11-07 02:41:17,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:17,821 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2024-11-07 02:41:17,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 02:41:17,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696759252] [2024-11-07 02:41:17,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696759252] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 02:41:17,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 02:41:17,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 02:41:17,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567229355] [2024-11-07 02:41:17,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 02:41:17,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 02:41:17,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 02:41:17,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 02:41:17,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-07 02:41:17,823 INFO L87 Difference]: Start difference. First operand 1428 states and 1884 transitions. Second operand has 7 states, 7 states have (on average 52.57142857142857) internal successors, (368), 7 states have internal predecessors, (368), 3 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-07 02:41:18,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:41:18,295 INFO L93 Difference]: Finished difference Result 2604 states and 3404 transitions. [2024-11-07 02:41:18,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 02:41:18,296 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 52.57142857142857) internal successors, (368), 7 states have internal predecessors, (368), 3 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 480 [2024-11-07 02:41:18,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:41:18,305 INFO L225 Difference]: With dead ends: 2604 [2024-11-07 02:41:18,309 INFO L226 Difference]: Without dead ends: 1444 [2024-11-07 02:41:18,311 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-11-07 02:41:18,311 INFO L432 NwaCegarLoop]: 560 mSDtfsCounter, 753 mSDsluCounter, 1680 mSDsCounter, 0 mSdLazyCounter, 810 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 755 SdHoareTripleChecker+Valid, 2240 SdHoareTripleChecker+Invalid, 812 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 810 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 02:41:18,311 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [755 Valid, 2240 Invalid, 812 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 810 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 02:41:18,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1444 states. [2024-11-07 02:41:18,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1444 to 1436. [2024-11-07 02:41:18,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1436 states, 1422 states have (on average 1.310829817158931) internal successors, (1864), 1422 states have internal predecessors, (1864), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-07 02:41:18,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1436 states to 1436 states and 1888 transitions. [2024-11-07 02:41:18,341 INFO L78 Accepts]: Start accepts. Automaton has 1436 states and 1888 transitions. Word has length 480 [2024-11-07 02:41:18,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:41:18,341 INFO L471 AbstractCegarLoop]: Abstraction has 1436 states and 1888 transitions. [2024-11-07 02:41:18,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 52.57142857142857) internal successors, (368), 7 states have internal predecessors, (368), 3 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-07 02:41:18,341 INFO L276 IsEmpty]: Start isEmpty. Operand 1436 states and 1888 transitions. [2024-11-07 02:41:18,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 483 [2024-11-07 02:41:18,343 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:41:18,344 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:41:18,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2024-11-07 02:41:18,344 INFO L396 AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:41:18,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:41:18,344 INFO L85 PathProgramCache]: Analyzing trace with hash -208955982, now seen corresponding path program 1 times [2024-11-07 02:41:18,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 02:41:18,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257369652] [2024-11-07 02:41:18,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:41:18,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 02:41:19,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:20,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 02:41:20,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:20,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 02:41:20,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:20,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 02:41:20,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:20,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 357 [2024-11-07 02:41:20,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:20,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 374 [2024-11-07 02:41:20,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:20,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 387 [2024-11-07 02:41:20,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:20,969 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 158 trivial. 0 not checked. [2024-11-07 02:41:20,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 02:41:20,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257369652] [2024-11-07 02:41:20,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [257369652] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 02:41:20,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 02:41:20,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 02:41:20,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133327169] [2024-11-07 02:41:20,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 02:41:20,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 02:41:20,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 02:41:20,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 02:41:20,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-07 02:41:20,971 INFO L87 Difference]: Start difference. First operand 1436 states and 1888 transitions. Second operand has 8 states, 8 states have (on average 45.25) internal successors, (362), 8 states have internal predecessors, (362), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-07 02:41:21,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:41:21,395 INFO L93 Difference]: Finished difference Result 2666 states and 3473 transitions. [2024-11-07 02:41:21,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 02:41:21,396 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 45.25) internal successors, (362), 8 states have internal predecessors, (362), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 482 [2024-11-07 02:41:21,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:41:21,398 INFO L225 Difference]: With dead ends: 2666 [2024-11-07 02:41:21,398 INFO L226 Difference]: Without dead ends: 1468 [2024-11-07 02:41:21,400 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-07 02:41:21,400 INFO L432 NwaCegarLoop]: 564 mSDtfsCounter, 696 mSDsluCounter, 2767 mSDsCounter, 0 mSdLazyCounter, 1196 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 698 SdHoareTripleChecker+Valid, 3331 SdHoareTripleChecker+Invalid, 1197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 02:41:21,400 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [698 Valid, 3331 Invalid, 1197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1196 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 02:41:21,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1468 states. [2024-11-07 02:41:21,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1468 to 1456. [2024-11-07 02:41:21,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1456 states, 1442 states have (on average 1.3092926490984744) internal successors, (1888), 1442 states have internal predecessors, (1888), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-07 02:41:21,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1456 states to 1456 states and 1912 transitions. [2024-11-07 02:41:21,423 INFO L78 Accepts]: Start accepts. Automaton has 1456 states and 1912 transitions. Word has length 482 [2024-11-07 02:41:21,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:41:21,423 INFO L471 AbstractCegarLoop]: Abstraction has 1456 states and 1912 transitions. [2024-11-07 02:41:21,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 45.25) internal successors, (362), 8 states have internal predecessors, (362), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-07 02:41:21,424 INFO L276 IsEmpty]: Start isEmpty. Operand 1456 states and 1912 transitions. [2024-11-07 02:41:21,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2024-11-07 02:41:21,427 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:41:21,427 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:41:21,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2024-11-07 02:41:21,428 INFO L396 AbstractCegarLoop]: === Iteration 68 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:41:21,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:41:21,428 INFO L85 PathProgramCache]: Analyzing trace with hash 1287823872, now seen corresponding path program 1 times [2024-11-07 02:41:21,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 02:41:21,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582731963] [2024-11-07 02:41:21,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:41:21,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 02:41:22,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:23,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 02:41:23,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:23,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 02:41:23,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:23,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-07 02:41:23,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:23,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 358 [2024-11-07 02:41:23,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:23,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 376 [2024-11-07 02:41:23,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:23,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 389 [2024-11-07 02:41:23,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:23,440 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-11-07 02:41:23,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 02:41:23,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582731963] [2024-11-07 02:41:23,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582731963] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 02:41:23,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 02:41:23,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 02:41:23,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384655758] [2024-11-07 02:41:23,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 02:41:23,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 02:41:23,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 02:41:23,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 02:41:23,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-07 02:41:23,442 INFO L87 Difference]: Start difference. First operand 1456 states and 1912 transitions. Second operand has 8 states, 8 states have (on average 49.5) internal successors, (396), 8 states have internal predecessors, (396), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-07 02:41:24,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:41:24,195 INFO L93 Difference]: Finished difference Result 3648 states and 4723 transitions. [2024-11-07 02:41:24,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-07 02:41:24,196 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 49.5) internal successors, (396), 8 states have internal predecessors, (396), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 484 [2024-11-07 02:41:24,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:41:24,199 INFO L225 Difference]: With dead ends: 3648 [2024-11-07 02:41:24,199 INFO L226 Difference]: Without dead ends: 2617 [2024-11-07 02:41:24,201 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2024-11-07 02:41:24,201 INFO L432 NwaCegarLoop]: 1162 mSDtfsCounter, 1261 mSDsluCounter, 4991 mSDsCounter, 0 mSdLazyCounter, 1408 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1264 SdHoareTripleChecker+Valid, 6153 SdHoareTripleChecker+Invalid, 1408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1408 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-07 02:41:24,201 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1264 Valid, 6153 Invalid, 1408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1408 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-07 02:41:24,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2617 states. [2024-11-07 02:41:24,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2617 to 2609. [2024-11-07 02:41:24,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2609 states, 2589 states have (on average 1.2974121282348396) internal successors, (3359), 2589 states have internal predecessors, (3359), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-07 02:41:24,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2609 states to 2609 states and 3395 transitions. [2024-11-07 02:41:24,236 INFO L78 Accepts]: Start accepts. Automaton has 2609 states and 3395 transitions. Word has length 484 [2024-11-07 02:41:24,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:41:24,237 INFO L471 AbstractCegarLoop]: Abstraction has 2609 states and 3395 transitions. [2024-11-07 02:41:24,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 49.5) internal successors, (396), 8 states have internal predecessors, (396), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-07 02:41:24,237 INFO L276 IsEmpty]: Start isEmpty. Operand 2609 states and 3395 transitions. [2024-11-07 02:41:24,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 487 [2024-11-07 02:41:24,241 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:41:24,241 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:41:24,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2024-11-07 02:41:24,242 INFO L396 AbstractCegarLoop]: === Iteration 69 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:41:24,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:41:24,242 INFO L85 PathProgramCache]: Analyzing trace with hash 315438300, now seen corresponding path program 1 times [2024-11-07 02:41:24,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 02:41:24,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810605900] [2024-11-07 02:41:24,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:41:24,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 02:41:24,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:25,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 02:41:25,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:25,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 02:41:25,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:25,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-07 02:41:25,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:25,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 359 [2024-11-07 02:41:25,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:25,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 377 [2024-11-07 02:41:25,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:25,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 390 [2024-11-07 02:41:25,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:25,852 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 116 proven. 3 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-07 02:41:25,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 02:41:25,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810605900] [2024-11-07 02:41:25,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1810605900] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 02:41:25,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [20902049] [2024-11-07 02:41:25,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:41:25,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 02:41:25,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 02:41:25,856 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 02:41:25,857 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-07 02:41:27,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:27,675 INFO L255 TraceCheckSpWp]: Trace formula consists of 2968 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-07 02:41:27,695 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 02:41:27,980 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2024-11-07 02:41:27,981 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 02:41:27,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [20902049] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 02:41:27,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 02:41:27,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2024-11-07 02:41:27,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309086046] [2024-11-07 02:41:27,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 02:41:27,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 02:41:27,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 02:41:27,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 02:41:27,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-07 02:41:27,982 INFO L87 Difference]: Start difference. First operand 2609 states and 3395 transitions. Second operand has 4 states, 4 states have (on average 100.0) internal successors, (400), 4 states have internal predecessors, (400), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-07 02:41:28,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:41:28,238 INFO L93 Difference]: Finished difference Result 3697 states and 4788 transitions. [2024-11-07 02:41:28,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 02:41:28,238 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 100.0) internal successors, (400), 4 states have internal predecessors, (400), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 486 [2024-11-07 02:41:28,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:41:28,240 INFO L225 Difference]: With dead ends: 3697 [2024-11-07 02:41:28,240 INFO L226 Difference]: Without dead ends: 1454 [2024-11-07 02:41:28,242 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 505 GetRequests, 497 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-11-07 02:41:28,242 INFO L432 NwaCegarLoop]: 565 mSDtfsCounter, 649 mSDsluCounter, 567 mSDsCounter, 0 mSdLazyCounter, 389 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 649 SdHoareTripleChecker+Valid, 1132 SdHoareTripleChecker+Invalid, 389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 02:41:28,242 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [649 Valid, 1132 Invalid, 389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 389 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 02:41:28,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1454 states. [2024-11-07 02:41:28,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1454 to 1454. [2024-11-07 02:41:28,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1454 states, 1440 states have (on average 1.3055555555555556) internal successors, (1880), 1440 states have internal predecessors, (1880), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-07 02:41:28,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1454 states to 1454 states and 1904 transitions. [2024-11-07 02:41:28,261 INFO L78 Accepts]: Start accepts. Automaton has 1454 states and 1904 transitions. Word has length 486 [2024-11-07 02:41:28,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:41:28,262 INFO L471 AbstractCegarLoop]: Abstraction has 1454 states and 1904 transitions. [2024-11-07 02:41:28,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 100.0) internal successors, (400), 4 states have internal predecessors, (400), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-07 02:41:28,262 INFO L276 IsEmpty]: Start isEmpty. Operand 1454 states and 1904 transitions. [2024-11-07 02:41:28,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 487 [2024-11-07 02:41:28,264 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:41:28,264 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:41:28,293 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-07 02:41:28,465 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable68 [2024-11-07 02:41:28,466 INFO L396 AbstractCegarLoop]: === Iteration 70 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:41:28,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:41:28,466 INFO L85 PathProgramCache]: Analyzing trace with hash 104602996, now seen corresponding path program 1 times [2024-11-07 02:41:28,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 02:41:28,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581599036] [2024-11-07 02:41:28,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:41:28,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 02:41:30,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:35,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 02:41:35,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:35,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 02:41:35,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:35,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-07 02:41:35,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:35,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 359 [2024-11-07 02:41:35,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:35,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 377 [2024-11-07 02:41:35,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:35,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 391 [2024-11-07 02:41:35,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:35,276 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 81 proven. 38 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-07 02:41:35,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 02:41:35,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581599036] [2024-11-07 02:41:35,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1581599036] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 02:41:35,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [288018695] [2024-11-07 02:41:35,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:41:35,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 02:41:35,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 02:41:35,279 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 02:41:35,280 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-07 02:41:37,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:37,063 INFO L255 TraceCheckSpWp]: Trace formula consists of 2968 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-07 02:41:37,074 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 02:41:37,930 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 151 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-07 02:41:37,931 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 02:41:37,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [288018695] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 02:41:37,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 02:41:37,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [18] total 22 [2024-11-07 02:41:37,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268237717] [2024-11-07 02:41:37,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 02:41:37,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 02:41:37,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 02:41:37,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 02:41:37,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=386, Unknown=0, NotChecked=0, Total=462 [2024-11-07 02:41:37,933 INFO L87 Difference]: Start difference. First operand 1454 states and 1904 transitions. Second operand has 6 states, 6 states have (on average 76.5) internal successors, (459), 6 states have internal predecessors, (459), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-07 02:41:38,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:41:38,374 INFO L93 Difference]: Finished difference Result 2758 states and 3585 transitions. [2024-11-07 02:41:38,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 02:41:38,374 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 76.5) internal successors, (459), 6 states have internal predecessors, (459), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 486 [2024-11-07 02:41:38,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:41:38,376 INFO L225 Difference]: With dead ends: 2758 [2024-11-07 02:41:38,376 INFO L226 Difference]: Without dead ends: 1470 [2024-11-07 02:41:38,377 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 515 GetRequests, 495 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=386, Unknown=0, NotChecked=0, Total=462 [2024-11-07 02:41:38,378 INFO L432 NwaCegarLoop]: 559 mSDtfsCounter, 414 mSDsluCounter, 1670 mSDsCounter, 0 mSdLazyCounter, 802 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 414 SdHoareTripleChecker+Valid, 2229 SdHoareTripleChecker+Invalid, 804 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 802 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 02:41:38,378 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [414 Valid, 2229 Invalid, 804 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 802 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 02:41:38,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1470 states. [2024-11-07 02:41:38,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1470 to 1466. [2024-11-07 02:41:38,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1466 states, 1452 states have (on average 1.300275482093664) internal successors, (1888), 1452 states have internal predecessors, (1888), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-07 02:41:38,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1466 states to 1466 states and 1912 transitions. [2024-11-07 02:41:38,395 INFO L78 Accepts]: Start accepts. Automaton has 1466 states and 1912 transitions. Word has length 486 [2024-11-07 02:41:38,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:41:38,395 INFO L471 AbstractCegarLoop]: Abstraction has 1466 states and 1912 transitions. [2024-11-07 02:41:38,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 76.5) internal successors, (459), 6 states have internal predecessors, (459), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-07 02:41:38,395 INFO L276 IsEmpty]: Start isEmpty. Operand 1466 states and 1912 transitions. [2024-11-07 02:41:38,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 491 [2024-11-07 02:41:38,397 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:41:38,398 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:41:38,423 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-07 02:41:38,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable69 [2024-11-07 02:41:38,599 INFO L396 AbstractCegarLoop]: === Iteration 71 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:41:38,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:41:38,599 INFO L85 PathProgramCache]: Analyzing trace with hash 1883338106, now seen corresponding path program 1 times [2024-11-07 02:41:38,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 02:41:38,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689477268] [2024-11-07 02:41:38,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:41:38,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms