./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-86.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4f9af400 extending candidate: java ['java'] extending candidate: /usr/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/oracle-jdk-bin-*/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/openjdk-*/bin/java ['java', '/usr/bin/java'] extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java ['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java'] ['/root/.sdkman/candidates/java/21.0.5-tem/bin/java', '-Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config', '-Xmx15G', '-Xms4m', '-jar', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar', '-data', '@noDefault', '-ultimatedata', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data', '-tc', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml', '-i', '../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-86.i', '-s', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf', '--cacsl2boogietranslator.entry.function', 'main', '--witnessprinter.witness.directory', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux', '--witnessprinter.witness.filename', 'witness', '--witnessprinter.write.witness.besides.input.file', 'false', '--witnessprinter.graph.data.specification', 'CHECK( init(main()), LTL(G ! call(reach_error())) )\n\n', '--witnessprinter.graph.data.producer', 'Automizer', '--witnessprinter.graph.data.architecture', '32bit', '--witnessprinter.graph.data.programhash', 'a9741d9253f3a1c34b363b1f78a0a60d9588ccafe85a5c037fb56edb8bf20d1f'] Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-86.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a9741d9253f3a1c34b363b1f78a0a60d9588ccafe85a5c037fb56edb8bf20d1f --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 04:15:05,813 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 04:15:05,886 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-07 04:15:05,892 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 04:15:05,893 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 04:15:05,919 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 04:15:05,920 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 04:15:05,920 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 04:15:05,920 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 04:15:05,921 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 04:15:05,921 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 04:15:05,921 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 04:15:05,921 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 04:15:05,923 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 04:15:05,924 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 04:15:05,924 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 04:15:05,925 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 04:15:05,925 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 04:15:05,925 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 04:15:05,925 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 04:15:05,925 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 04:15:05,926 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 04:15:05,926 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 04:15:05,926 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 04:15:05,926 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 04:15:05,926 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 04:15:05,926 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 04:15:05,926 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 04:15:05,927 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 04:15:05,927 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 04:15:05,927 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 04:15:05,927 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 04:15:05,927 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 04:15:05,927 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 04:15:05,928 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 04:15:05,928 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 04:15:05,928 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 04:15:05,928 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 04:15:05,929 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 04:15:05,929 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 04:15:05,929 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 04:15:05,929 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 04:15:05,929 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a9741d9253f3a1c34b363b1f78a0a60d9588ccafe85a5c037fb56edb8bf20d1f [2024-11-07 04:15:06,233 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 04:15:06,241 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 04:15:06,243 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 04:15:06,244 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 04:15:06,244 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 04:15:06,246 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-86.i [2024-11-07 04:15:07,670 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 04:15:07,966 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 04:15:07,969 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-86.i [2024-11-07 04:15:07,977 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/98f261d64/0b2c6d077ae549c1bd902e5b47cff62a/FLAG8a2eeb760 [2024-11-07 04:15:08,001 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/98f261d64/0b2c6d077ae549c1bd902e5b47cff62a [2024-11-07 04:15:08,005 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 04:15:08,006 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 04:15:08,009 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 04:15:08,009 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 04:15:08,017 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 04:15:08,018 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:15:08" (1/1) ... [2024-11-07 04:15:08,019 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63c7e823 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:15:08, skipping insertion in model container [2024-11-07 04:15:08,019 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:15:08" (1/1) ... [2024-11-07 04:15:08,037 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 04:15:08,181 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-86.i[913,926] [2024-11-07 04:15:08,254 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 04:15:08,268 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 04:15:08,283 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-86.i[913,926] [2024-11-07 04:15:08,313 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 04:15:08,333 INFO L204 MainTranslator]: Completed translation [2024-11-07 04:15:08,334 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:15:08 WrapperNode [2024-11-07 04:15:08,335 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 04:15:08,336 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 04:15:08,337 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 04:15:08,337 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 04:15:08,343 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:15:08" (1/1) ... [2024-11-07 04:15:08,352 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:15:08" (1/1) ... [2024-11-07 04:15:08,395 INFO L138 Inliner]: procedures = 26, calls = 44, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 160 [2024-11-07 04:15:08,396 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 04:15:08,397 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 04:15:08,397 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 04:15:08,397 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 04:15:08,404 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:15:08" (1/1) ... [2024-11-07 04:15:08,404 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:15:08" (1/1) ... [2024-11-07 04:15:08,407 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:15:08" (1/1) ... [2024-11-07 04:15:08,426 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 04:15:08,429 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:15:08" (1/1) ... [2024-11-07 04:15:08,429 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:15:08" (1/1) ... [2024-11-07 04:15:08,436 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:15:08" (1/1) ... [2024-11-07 04:15:08,441 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:15:08" (1/1) ... [2024-11-07 04:15:08,447 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:15:08" (1/1) ... [2024-11-07 04:15:08,453 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:15:08" (1/1) ... [2024-11-07 04:15:08,460 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 04:15:08,462 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 04:15:08,462 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 04:15:08,462 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 04:15:08,464 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:15:08" (1/1) ... [2024-11-07 04:15:08,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 04:15:08,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 04:15:08,501 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 04:15:08,505 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 04:15:08,531 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 04:15:08,532 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 04:15:08,532 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 04:15:08,532 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 04:15:08,532 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 04:15:08,532 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 04:15:08,622 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 04:15:08,624 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 04:15:08,981 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-07 04:15:08,982 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 04:15:08,993 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 04:15:08,994 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 04:15:08,994 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:15:08 BoogieIcfgContainer [2024-11-07 04:15:08,994 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 04:15:08,996 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 04:15:08,997 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 04:15:09,001 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 04:15:09,002 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 04:15:08" (1/3) ... [2024-11-07 04:15:09,002 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5187eb1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:15:09, skipping insertion in model container [2024-11-07 04:15:09,002 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:15:08" (2/3) ... [2024-11-07 04:15:09,003 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5187eb1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:15:09, skipping insertion in model container [2024-11-07 04:15:09,004 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:15:08" (3/3) ... [2024-11-07 04:15:09,005 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_normal_file-86.i [2024-11-07 04:15:09,018 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 04:15:09,018 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 04:15:09,073 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 04:15:09,081 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;@1322ab08, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 04:15:09,084 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 04:15:09,088 INFO L276 IsEmpty]: Start isEmpty. Operand has 76 states, 42 states have (on average 1.3571428571428572) internal successors, (57), 43 states have internal predecessors, (57), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2024-11-07 04:15:09,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2024-11-07 04:15:09,103 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 04:15:09,103 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:15:09,104 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 04:15:09,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 04:15:09,109 INFO L85 PathProgramCache]: Analyzing trace with hash -560862835, now seen corresponding path program 1 times [2024-11-07 04:15:09,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 04:15:09,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787746814] [2024-11-07 04:15:09,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:15:09,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 04:15:09,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:09,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 04:15:09,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:09,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 04:15:09,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:09,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 04:15:09,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:09,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 04:15:09,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:09,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 04:15:09,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:09,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 04:15:09,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:09,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 04:15:09,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:09,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 04:15:09,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:09,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 04:15:09,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:09,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 04:15:09,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:09,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 04:15:09,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:09,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 04:15:09,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:09,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 04:15:09,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:09,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 04:15:09,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:09,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 04:15:09,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:09,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 04:15:09,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:09,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 04:15:09,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:09,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 04:15:09,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:09,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 04:15:09,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:09,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-07 04:15:09,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:09,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-07 04:15:09,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:09,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-07 04:15:09,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:09,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-07 04:15:09,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:09,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-07 04:15:09,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:09,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-07 04:15:09,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:09,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-07 04:15:09,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:09,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-07 04:15:09,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:09,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-07 04:15:09,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:09,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-07 04:15:09,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:09,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-07 04:15:09,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:09,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-11-07 04:15:09,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:09,595 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-11-07 04:15:09,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 04:15:09,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787746814] [2024-11-07 04:15:09,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787746814] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 04:15:09,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 04:15:09,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 04:15:09,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372639208] [2024-11-07 04:15:09,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 04:15:09,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 04:15:09,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 04:15:09,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 04:15:09,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 04:15:09,632 INFO L87 Difference]: Start difference. First operand has 76 states, 42 states have (on average 1.3571428571428572) internal successors, (57), 43 states have internal predecessors, (57), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) Second operand has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) [2024-11-07 04:15:09,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 04:15:09,665 INFO L93 Difference]: Finished difference Result 145 states and 263 transitions. [2024-11-07 04:15:09,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 04:15:09,668 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) Word has length 186 [2024-11-07 04:15:09,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 04:15:09,674 INFO L225 Difference]: With dead ends: 145 [2024-11-07 04:15:09,674 INFO L226 Difference]: Without dead ends: 72 [2024-11-07 04:15:09,678 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 95 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 04:15:09,684 INFO L432 NwaCegarLoop]: 112 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, 112 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 04:15:09,685 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 04:15:09,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-11-07 04:15:09,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2024-11-07 04:15:09,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 39 states have (on average 1.2820512820512822) internal successors, (50), 39 states have internal predecessors, (50), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2024-11-07 04:15:09,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 112 transitions. [2024-11-07 04:15:09,743 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 112 transitions. Word has length 186 [2024-11-07 04:15:09,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 04:15:09,744 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 112 transitions. [2024-11-07 04:15:09,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) [2024-11-07 04:15:09,746 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 112 transitions. [2024-11-07 04:15:09,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2024-11-07 04:15:09,751 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 04:15:09,752 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:15:09,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 04:15:09,753 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 04:15:09,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 04:15:09,754 INFO L85 PathProgramCache]: Analyzing trace with hash -926672629, now seen corresponding path program 1 times [2024-11-07 04:15:09,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 04:15:09,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165613422] [2024-11-07 04:15:09,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:15:09,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 04:15:10,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:23,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 04:15:23,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:23,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 04:15:23,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:23,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 04:15:23,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:23,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 04:15:23,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:23,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 04:15:23,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:23,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 04:15:23,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:23,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 04:15:23,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:23,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 04:15:23,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:23,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 04:15:23,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:23,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 04:15:23,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:23,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 04:15:23,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:23,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 04:15:23,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:23,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 04:15:23,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:23,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 04:15:23,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:23,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 04:15:23,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:23,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 04:15:23,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:23,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 04:15:23,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:23,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 04:15:23,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:23,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 04:15:23,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:23,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-07 04:15:23,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:23,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-07 04:15:23,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:23,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-07 04:15:23,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:23,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-07 04:15:23,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:23,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-07 04:15:23,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:23,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-07 04:15:23,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:23,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-07 04:15:23,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:23,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-07 04:15:23,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:23,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-07 04:15:23,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:23,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-07 04:15:23,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:23,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-07 04:15:23,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:23,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-11-07 04:15:23,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:23,193 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-11-07 04:15:23,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 04:15:23,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165613422] [2024-11-07 04:15:23,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165613422] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 04:15:23,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 04:15:23,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-07 04:15:23,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251328588] [2024-11-07 04:15:23,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 04:15:23,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-07 04:15:23,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 04:15:23,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-07 04:15:23,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-07 04:15:23,199 INFO L87 Difference]: Start difference. First operand 72 states and 112 transitions. Second operand has 10 states, 10 states have (on average 3.4) internal successors, (34), 10 states have internal predecessors, (34), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-07 04:15:24,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 04:15:24,957 INFO L93 Difference]: Finished difference Result 191 states and 286 transitions. [2024-11-07 04:15:24,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 04:15:24,960 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.4) internal successors, (34), 10 states have internal predecessors, (34), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 186 [2024-11-07 04:15:24,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 04:15:24,963 INFO L225 Difference]: With dead ends: 191 [2024-11-07 04:15:24,964 INFO L226 Difference]: Without dead ends: 122 [2024-11-07 04:15:24,967 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=68, Invalid=114, Unknown=0, NotChecked=0, Total=182 [2024-11-07 04:15:24,968 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 102 mSDsluCounter, 367 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 464 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-07 04:15:24,970 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 464 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-07 04:15:24,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-11-07 04:15:24,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 82. [2024-11-07 04:15:24,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 49 states have (on average 1.3061224489795917) internal successors, (64), 49 states have internal predecessors, (64), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2024-11-07 04:15:24,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 126 transitions. [2024-11-07 04:15:24,988 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 126 transitions. Word has length 186 [2024-11-07 04:15:24,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 04:15:24,990 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 126 transitions. [2024-11-07 04:15:24,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.4) internal successors, (34), 10 states have internal predecessors, (34), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-07 04:15:24,992 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 126 transitions. [2024-11-07 04:15:24,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2024-11-07 04:15:24,997 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 04:15:24,997 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:15:24,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 04:15:24,998 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 04:15:24,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 04:15:24,999 INFO L85 PathProgramCache]: Analyzing trace with hash -1319699639, now seen corresponding path program 1 times [2024-11-07 04:15:24,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 04:15:24,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410702242] [2024-11-07 04:15:24,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:15:25,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 04:15:25,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:25,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 04:15:25,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:25,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 04:15:25,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:25,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 04:15:25,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:25,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 04:15:25,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:25,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 04:15:25,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:25,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 04:15:25,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:25,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 04:15:25,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:25,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 04:15:25,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:25,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 04:15:25,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:25,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 04:15:25,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:25,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 04:15:25,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:25,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 04:15:25,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:25,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 04:15:25,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:25,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 04:15:25,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:25,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 04:15:25,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:25,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 04:15:25,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:25,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 04:15:25,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:25,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 04:15:25,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:25,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 04:15:25,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:25,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-07 04:15:25,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:25,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-07 04:15:25,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:25,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-07 04:15:25,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:25,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-07 04:15:25,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:25,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-07 04:15:25,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:25,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-07 04:15:25,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:25,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-07 04:15:25,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:25,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-07 04:15:25,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:25,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-07 04:15:25,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:25,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-07 04:15:25,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:25,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-07 04:15:25,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:25,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-11-07 04:15:25,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:25,152 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-11-07 04:15:25,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 04:15:25,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410702242] [2024-11-07 04:15:25,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410702242] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 04:15:25,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 04:15:25,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 04:15:25,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132771262] [2024-11-07 04:15:25,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 04:15:25,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 04:15:25,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 04:15:25,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 04:15:25,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 04:15:25,156 INFO L87 Difference]: Start difference. First operand 82 states and 126 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-07 04:15:25,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 04:15:25,203 INFO L93 Difference]: Finished difference Result 190 states and 289 transitions. [2024-11-07 04:15:25,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 04:15:25,204 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 186 [2024-11-07 04:15:25,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 04:15:25,207 INFO L225 Difference]: With dead ends: 190 [2024-11-07 04:15:25,208 INFO L226 Difference]: Without dead ends: 111 [2024-11-07 04:15:25,209 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 04:15:25,209 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 45 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 04:15:25,211 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 256 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 04:15:25,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-07 04:15:25,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 108. [2024-11-07 04:15:25,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 66 states have (on average 1.2878787878787878) internal successors, (85), 67 states have internal predecessors, (85), 39 states have call successors, (39), 2 states have call predecessors, (39), 2 states have return successors, (39), 38 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-07 04:15:25,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 163 transitions. [2024-11-07 04:15:25,232 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 163 transitions. Word has length 186 [2024-11-07 04:15:25,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 04:15:25,234 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 163 transitions. [2024-11-07 04:15:25,234 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-07 04:15:25,234 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 163 transitions. [2024-11-07 04:15:25,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-11-07 04:15:25,236 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 04:15:25,237 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:15:25,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 04:15:25,237 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 04:15:25,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 04:15:25,241 INFO L85 PathProgramCache]: Analyzing trace with hash -1298466405, now seen corresponding path program 1 times [2024-11-07 04:15:25,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 04:15:25,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939246852] [2024-11-07 04:15:25,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:15:25,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 04:15:25,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:32,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 04:15:32,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:32,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 04:15:32,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:32,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 04:15:32,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:32,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 04:15:32,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:32,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 04:15:32,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:32,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 04:15:32,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:32,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 04:15:32,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:32,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 04:15:32,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:32,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 04:15:32,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:32,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 04:15:32,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:32,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 04:15:32,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:32,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 04:15:32,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:32,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 04:15:32,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:32,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 04:15:32,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:32,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 04:15:32,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:32,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 04:15:32,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:32,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 04:15:32,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:32,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 04:15:32,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:32,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 04:15:32,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:32,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-07 04:15:32,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:32,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-07 04:15:32,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:32,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-07 04:15:32,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:32,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-07 04:15:32,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:32,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-07 04:15:32,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:32,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-07 04:15:32,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:32,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-07 04:15:32,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:32,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-07 04:15:32,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:32,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-07 04:15:32,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:32,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-07 04:15:32,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:32,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-07 04:15:32,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:32,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-11-07 04:15:32,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:32,792 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-11-07 04:15:32,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 04:15:32,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939246852] [2024-11-07 04:15:32,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939246852] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 04:15:32,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 04:15:32,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-07 04:15:32,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500779251] [2024-11-07 04:15:32,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 04:15:32,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-07 04:15:32,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 04:15:32,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-07 04:15:32,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-11-07 04:15:32,796 INFO L87 Difference]: Start difference. First operand 108 states and 163 transitions. Second operand has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 states have internal predecessors, (35), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-07 04:15:36,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 04:15:36,023 INFO L93 Difference]: Finished difference Result 150 states and 211 transitions. [2024-11-07 04:15:36,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 04:15:36,024 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 states have internal predecessors, (35), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 187 [2024-11-07 04:15:36,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 04:15:36,027 INFO L225 Difference]: With dead ends: 150 [2024-11-07 04:15:36,027 INFO L226 Difference]: Without dead ends: 148 [2024-11-07 04:15:36,027 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=132, Invalid=248, Unknown=0, NotChecked=0, Total=380 [2024-11-07 04:15:36,028 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 174 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 285 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 578 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-07 04:15:36,028 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 578 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 285 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-07 04:15:36,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2024-11-07 04:15:36,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 112. [2024-11-07 04:15:36,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 70 states have (on average 1.3142857142857143) internal successors, (92), 71 states have internal predecessors, (92), 39 states have call successors, (39), 2 states have call predecessors, (39), 2 states have return successors, (39), 38 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-07 04:15:36,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 170 transitions. [2024-11-07 04:15:36,043 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 170 transitions. Word has length 187 [2024-11-07 04:15:36,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 04:15:36,044 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 170 transitions. [2024-11-07 04:15:36,044 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 states have internal predecessors, (35), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-07 04:15:36,044 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 170 transitions. [2024-11-07 04:15:36,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-11-07 04:15:36,046 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 04:15:36,046 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:15:36,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 04:15:36,047 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 04:15:36,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 04:15:36,047 INFO L85 PathProgramCache]: Analyzing trace with hash -1241208103, now seen corresponding path program 1 times [2024-11-07 04:15:36,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 04:15:36,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018657223] [2024-11-07 04:15:36,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:15:36,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 04:15:36,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:44,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 04:15:44,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:44,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 04:15:44,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:44,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 04:15:44,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:44,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 04:15:44,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:44,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 04:15:44,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:44,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 04:15:44,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:44,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 04:15:44,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:44,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 04:15:44,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:44,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 04:15:44,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:44,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 04:15:44,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:44,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 04:15:44,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:44,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 04:15:44,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:44,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 04:15:44,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:44,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 04:15:44,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:44,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 04:15:44,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:44,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 04:15:44,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:44,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 04:15:44,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:44,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 04:15:44,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:44,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 04:15:44,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:44,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-07 04:15:44,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:44,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-07 04:15:44,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:44,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-07 04:15:44,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:44,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-07 04:15:44,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:44,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-07 04:15:44,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:44,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-07 04:15:44,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:44,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-07 04:15:44,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:44,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-07 04:15:44,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:44,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-07 04:15:44,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:44,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-07 04:15:44,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:44,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-07 04:15:44,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:44,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-11-07 04:15:44,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:44,241 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-11-07 04:15:44,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 04:15:44,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018657223] [2024-11-07 04:15:44,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018657223] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 04:15:44,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 04:15:44,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-07 04:15:44,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311507526] [2024-11-07 04:15:44,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 04:15:44,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-07 04:15:44,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 04:15:44,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-07 04:15:44,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-07 04:15:44,245 INFO L87 Difference]: Start difference. First operand 112 states and 170 transitions. Second operand has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 states have internal predecessors, (35), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-07 04:15:46,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 04:15:46,867 INFO L93 Difference]: Finished difference Result 147 states and 208 transitions. [2024-11-07 04:15:46,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-07 04:15:46,868 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 states have internal predecessors, (35), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 187 [2024-11-07 04:15:46,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 04:15:46,870 INFO L225 Difference]: With dead ends: 147 [2024-11-07 04:15:46,870 INFO L226 Difference]: Without dead ends: 145 [2024-11-07 04:15:46,871 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=123, Invalid=219, Unknown=0, NotChecked=0, Total=342 [2024-11-07 04:15:46,871 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 135 mSDsluCounter, 537 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 639 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-07 04:15:46,872 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 639 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 292 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-07 04:15:46,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2024-11-07 04:15:46,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 113. [2024-11-07 04:15:46,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 71 states have (on average 1.323943661971831) internal successors, (94), 72 states have internal predecessors, (94), 39 states have call successors, (39), 2 states have call predecessors, (39), 2 states have return successors, (39), 38 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-07 04:15:46,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 172 transitions. [2024-11-07 04:15:46,888 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 172 transitions. Word has length 187 [2024-11-07 04:15:46,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 04:15:46,889 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 172 transitions. [2024-11-07 04:15:46,889 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 states have internal predecessors, (35), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-07 04:15:46,889 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 172 transitions. [2024-11-07 04:15:46,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-11-07 04:15:46,891 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 04:15:46,891 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:15:46,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 04:15:46,891 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 04:15:46,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 04:15:46,892 INFO L85 PathProgramCache]: Analyzing trace with hash -761053642, now seen corresponding path program 1 times [2024-11-07 04:15:46,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 04:15:46,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869794778] [2024-11-07 04:15:46,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:15:46,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 04:15:46,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:56,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 04:15:56,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:56,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 04:15:56,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:56,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 04:15:56,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:56,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 04:15:56,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:56,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 04:15:56,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:56,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 04:15:56,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:56,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 04:15:56,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:56,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 04:15:56,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:56,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 04:15:56,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:56,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 04:15:56,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:56,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 04:15:56,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:56,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 04:15:56,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:56,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 04:15:56,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:56,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 04:15:56,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:56,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 04:15:56,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:56,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 04:15:56,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:56,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 04:15:56,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:56,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 04:15:56,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:56,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 04:15:56,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:56,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-07 04:15:56,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:56,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-07 04:15:56,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:56,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-07 04:15:56,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:56,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-07 04:15:56,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:56,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-07 04:15:56,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:56,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-07 04:15:56,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:56,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-07 04:15:56,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:56,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-07 04:15:56,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:56,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-07 04:15:56,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:56,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-07 04:15:56,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:56,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-07 04:15:56,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:56,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-11-07 04:15:56,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:15:56,891 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-11-07 04:15:56,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 04:15:56,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869794778] [2024-11-07 04:15:56,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869794778] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 04:15:56,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 04:15:56,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-07 04:15:56,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058739544] [2024-11-07 04:15:56,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 04:15:56,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-07 04:15:56,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 04:15:56,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-07 04:15:56,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2024-11-07 04:15:56,893 INFO L87 Difference]: Start difference. First operand 113 states and 172 transitions. Second operand has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 states have internal predecessors, (35), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-07 04:16:00,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 04:16:00,470 INFO L93 Difference]: Finished difference Result 156 states and 219 transitions. [2024-11-07 04:16:00,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-07 04:16:00,471 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 states have internal predecessors, (35), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 187 [2024-11-07 04:16:00,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 04:16:00,472 INFO L225 Difference]: With dead ends: 156 [2024-11-07 04:16:00,472 INFO L226 Difference]: Without dead ends: 154 [2024-11-07 04:16:00,472 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=90, Invalid=150, Unknown=0, NotChecked=0, Total=240 [2024-11-07 04:16:00,473 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 103 mSDsluCounter, 445 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 548 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-07 04:16:00,473 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 548 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-07 04:16:00,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2024-11-07 04:16:00,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 115. [2024-11-07 04:16:00,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 73 states have (on average 1.3424657534246576) internal successors, (98), 74 states have internal predecessors, (98), 39 states have call successors, (39), 2 states have call predecessors, (39), 2 states have return successors, (39), 38 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-07 04:16:00,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 176 transitions. [2024-11-07 04:16:00,494 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 176 transitions. Word has length 187 [2024-11-07 04:16:00,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 04:16:00,495 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 176 transitions. [2024-11-07 04:16:00,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 states have internal predecessors, (35), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-07 04:16:00,495 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 176 transitions. [2024-11-07 04:16:00,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-11-07 04:16:00,497 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 04:16:00,497 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:16:00,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 04:16:00,497 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 04:16:00,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 04:16:00,498 INFO L85 PathProgramCache]: Analyzing trace with hash 1013953720, now seen corresponding path program 1 times [2024-11-07 04:16:00,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 04:16:00,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801555091] [2024-11-07 04:16:00,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:16:00,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 04:16:00,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:16:07,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 04:16:07,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:16:07,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 04:16:07,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:16:07,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 04:16:07,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:16:07,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 04:16:07,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:16:07,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 04:16:07,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:16:07,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 04:16:07,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:16:07,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 04:16:07,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:16:07,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 04:16:07,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:16:07,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 04:16:07,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:16:07,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 04:16:07,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:16:07,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 04:16:07,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:16:07,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 04:16:07,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:16:07,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 04:16:07,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:16:07,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 04:16:07,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:16:07,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 04:16:07,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:16:07,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 04:16:07,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:16:07,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 04:16:07,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:16:07,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 04:16:07,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:16:07,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 04:16:07,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:16:07,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-07 04:16:07,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:16:07,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-07 04:16:07,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:16:07,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-07 04:16:07,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:16:07,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-07 04:16:07,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:16:07,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-07 04:16:07,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:16:07,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-07 04:16:07,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:16:07,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-07 04:16:07,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:16:07,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-07 04:16:07,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:16:07,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-07 04:16:07,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:16:07,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-07 04:16:07,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:16:07,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-07 04:16:07,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:16:07,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-11-07 04:16:07,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:16:07,489 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-11-07 04:16:07,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 04:16:07,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801555091] [2024-11-07 04:16:07,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801555091] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 04:16:07,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 04:16:07,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-07 04:16:07,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956741763] [2024-11-07 04:16:07,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 04:16:07,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-07 04:16:07,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 04:16:07,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-07 04:16:07,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2024-11-07 04:16:07,492 INFO L87 Difference]: Start difference. First operand 115 states and 176 transitions. Second operand has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 states have internal predecessors, (35), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-07 04:16:10,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 04:16:10,111 INFO L93 Difference]: Finished difference Result 157 states and 219 transitions. [2024-11-07 04:16:10,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-07 04:16:10,112 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 states have internal predecessors, (35), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 187 [2024-11-07 04:16:10,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 04:16:10,114 INFO L225 Difference]: With dead ends: 157 [2024-11-07 04:16:10,115 INFO L226 Difference]: Without dead ends: 155 [2024-11-07 04:16:10,115 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=110, Invalid=196, Unknown=0, NotChecked=0, Total=306 [2024-11-07 04:16:10,116 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 104 mSDsluCounter, 430 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 530 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-07 04:16:10,116 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 530 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-07 04:16:10,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2024-11-07 04:16:10,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 115. [2024-11-07 04:16:10,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 73 states have (on average 1.3424657534246576) internal successors, (98), 74 states have internal predecessors, (98), 39 states have call successors, (39), 2 states have call predecessors, (39), 2 states have return successors, (39), 38 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-07 04:16:10,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 176 transitions. [2024-11-07 04:16:10,133 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 176 transitions. Word has length 187 [2024-11-07 04:16:10,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 04:16:10,133 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 176 transitions. [2024-11-07 04:16:10,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 states have internal predecessors, (35), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-07 04:16:10,133 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 176 transitions. [2024-11-07 04:16:10,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-11-07 04:16:10,135 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 04:16:10,135 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:16:10,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 04:16:10,135 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 04:16:10,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 04:16:10,136 INFO L85 PathProgramCache]: Analyzing trace with hash 665966823, now seen corresponding path program 1 times [2024-11-07 04:16:10,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 04:16:10,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856849266] [2024-11-07 04:16:10,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:16:10,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 04:16:10,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:16:15,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 04:16:15,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:16:15,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 04:16:15,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:16:15,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 04:16:15,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:16:15,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 04:16:15,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:16:15,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 04:16:15,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:16:15,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 04:16:15,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:16:15,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 04:16:15,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:16:15,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 04:16:15,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:16:15,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 04:16:15,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:16:15,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 04:16:15,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:16:15,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 04:16:15,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:16:15,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 04:16:15,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:16:15,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 04:16:15,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:16:15,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 04:16:15,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:16:15,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 04:16:15,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:16:15,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 04:16:15,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:16:15,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 04:16:15,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:16:15,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 04:16:15,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:16:15,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 04:16:15,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:16:15,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-07 04:16:15,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:16:15,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-07 04:16:15,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:16:15,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-07 04:16:15,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:16:15,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-07 04:16:15,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:16:15,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-07 04:16:15,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:16:15,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-07 04:16:15,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:16:15,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-07 04:16:15,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:16:15,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-07 04:16:15,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:16:15,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-07 04:16:15,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:16:15,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-07 04:16:15,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:16:15,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-07 04:16:15,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:16:15,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-11-07 04:16:15,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:16:15,681 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-11-07 04:16:15,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 04:16:15,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856849266] [2024-11-07 04:16:15,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856849266] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 04:16:15,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 04:16:15,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-07 04:16:15,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474523637] [2024-11-07 04:16:15,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 04:16:15,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-07 04:16:15,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 04:16:15,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-07 04:16:15,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2024-11-07 04:16:15,683 INFO L87 Difference]: Start difference. First operand 115 states and 176 transitions. Second operand has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 states have internal predecessors, (35), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-07 04:16:17,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 04:16:17,409 INFO L93 Difference]: Finished difference Result 165 states and 231 transitions. [2024-11-07 04:16:17,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-07 04:16:17,411 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 states have internal predecessors, (35), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 187 [2024-11-07 04:16:17,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 04:16:17,412 INFO L225 Difference]: With dead ends: 165 [2024-11-07 04:16:17,413 INFO L226 Difference]: Without dead ends: 163 [2024-11-07 04:16:17,414 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=98, Invalid=174, Unknown=0, NotChecked=0, Total=272 [2024-11-07 04:16:17,414 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 136 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 515 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 04:16:17,415 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 515 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 04:16:17,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2024-11-07 04:16:17,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 115. [2024-11-07 04:16:17,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 73 states have (on average 1.3424657534246576) internal successors, (98), 74 states have internal predecessors, (98), 39 states have call successors, (39), 2 states have call predecessors, (39), 2 states have return successors, (39), 38 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-07 04:16:17,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 176 transitions. [2024-11-07 04:16:17,428 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 176 transitions. Word has length 187 [2024-11-07 04:16:17,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 04:16:17,431 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 176 transitions. [2024-11-07 04:16:17,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 states have internal predecessors, (35), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-07 04:16:17,431 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 176 transitions. [2024-11-07 04:16:17,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-11-07 04:16:17,432 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 04:16:17,433 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:16:17,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 04:16:17,434 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 04:16:17,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 04:16:17,434 INFO L85 PathProgramCache]: Analyzing trace with hash 1346025193, now seen corresponding path program 1 times [2024-11-07 04:16:17,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 04:16:17,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766359894] [2024-11-07 04:16:17,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:16:17,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 04:16:17,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:16:22,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 04:16:22,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:16:22,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 04:16:22,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:16:22,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 04:16:22,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:16:22,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 04:16:22,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:16:22,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 04:16:22,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:16:22,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 04:16:22,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:16:22,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 04:16:22,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:16:22,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 04:16:22,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:16:22,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 04:16:22,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:16:22,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 04:16:22,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:16:22,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 04:16:22,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:16:22,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 04:16:22,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:16:22,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 04:16:22,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:16:22,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 04:16:22,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:16:22,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 04:16:22,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:16:22,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 04:16:22,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:16:22,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 04:16:22,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:16:22,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 04:16:22,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:16:22,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 04:16:22,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:16:22,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-07 04:16:22,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:16:22,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-07 04:16:22,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:16:22,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-07 04:16:22,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:16:22,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-07 04:16:22,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:16:22,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-07 04:16:22,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:16:22,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-07 04:16:22,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:16:22,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-07 04:16:22,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:16:22,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-07 04:16:22,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:16:22,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-07 04:16:22,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:16:22,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-07 04:16:22,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:16:22,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-07 04:16:22,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:16:22,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-11-07 04:16:22,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:16:22,669 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-11-07 04:16:22,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 04:16:22,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766359894] [2024-11-07 04:16:22,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766359894] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 04:16:22,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 04:16:22,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-07 04:16:22,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774346399] [2024-11-07 04:16:22,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 04:16:22,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-07 04:16:22,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 04:16:22,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-07 04:16:22,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2024-11-07 04:16:22,671 INFO L87 Difference]: Start difference. First operand 115 states and 176 transitions. Second operand has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 states have internal predecessors, (35), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31)